Arithmetic progressions of length three in subsets of a random set
From MaRDI portal
Publication:4883030
Recommendations
- On the structure of sets with few three-term arithmetic progressions
- Maximal arithmetic progressions in random subsets
- Three-term arithmetic progressions and sumsets
- On the distribution of three-term arithmetic progressions in sparse subsets of \(\mathbb F_p^n\)
- Arithmetic subsequences in a random ordering of an additive set
- Arithmetic progressions of length three in multiplicative subgroups of \(\mathbb{F}_p \)
- Arithmetic progressions in sums of subsets of sparse sets
- On the structure of steps of three-term arithmetic progressions in a dense set of integers
- On the maximal number of 3-term arithmetic progressions in subsets of ℤ/p ℤ
- The maximal number of 3-term arithmetic progressions in finite sets in different geometries
Cited in
(48)- On the stability of the Erdős-Ko-Rado theorem
- Small subsets inherit sparse \(\varepsilon\)-regularity
- Monochromatic Schur Triples in Randomly Perturbed Dense Sets of Integers
- On the number of \(B_h\)-sets
- Counting sum-free sets in abelian groups
- Counting independent sets in graphs
- What is good mathematics?
- On the KŁR conjecture in random graphs
- Counting configuration-free sets in groups
- On zero-sum free sequences contained in random subsets of finite cyclic groups
- Four‐term progression free sets with three‐term progressions in all large subsets
- Finite configurations in sparse sets
- Almost disjoint families of 3-term arithmetic progressions
- Minor arcs, mean values, and restriction theory for exponential sums over smooth numbers
- Three-term arithmetic progressions and sumsets
- The typical structure of sparse \(K_{r+1}\)-free graphs
- Number of arithmetic progressions in dense random subsets of \(\mathbb{Z}/n\mathbb{Z}\)
- Independent sets in hypergraphs
- On Two-Point Configurations in a Random Set
- A multi-dimensional Szemerédi theorem for the primes via a correspondence principle
- Normal limiting distributions for systems of linear equations in random sets
- A distributive lattice connected with arithmetic progressions of length three
- Infinite Sidon sets contained in sparse random sets of integers
- scientific article; zbMATH DE number 5219601 (Why is no real title available?)
- Mantel's theorem for random graphs
- Roth's theorem in the Piatetski-Shapiro primes
- Arithmetic subsequences in a random ordering of an additive set
- \(K_4\)-free subgraphs of random graphs revisited
- A uniform set with fewer than expected arithmetic progressions of length 4
- Bivariate fluctuations for the number of arithmetic progressions in random sets
- Regular pairs in sparse random graphs I
- The Sharp Threshold for Maximum-Size Sum-Free Subsets in Even-Order Abelian Groups
- An analytic approach to sparse hypergraphs: hypergraph removal
- Thick subsets that do not contain arithmetic progressions
- Combinatorial theorems in sparse random sets
- Extremal results for random discrete structures
- Counting configuration-free sets in groups
- Random sum-free subsets of abelian groups
- A weighted regularity lemma with applications
- Tower-type bounds for Roth's theorem with popular differences
- Extremal subgraphs of random graphs
- Online containers for hypergraphs, with applications to linear equations
- scientific article; zbMATH DE number 5528961 (Why is no real title available?)
- On the distribution of three-term arithmetic progressions in sparse subsets of \(\mathbb F_p^n\)
- The number of Sidon sets and the maximum size of Sidon sets contained in a sparse random set of integers
- On \(K^ 4\)-free subgraphs of random graphs
- A new proof of the KŁR conjecture
- Arithmetic structures in random sets
This page was built for publication: Arithmetic progressions of length three in subsets of a random set
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4883030)
