Popular progression differences in vector spaces
From MaRDI portal
Abstract: Green proved an arithmetic analogue of Szemer'edi's celebrated regularity lemma and used it to verify a conjecture of Bergelson, Host, and Kra which sharpens Roth's theorem on three-term arithmetic progressions in dense sets. It shows that for every subset of with sufficiently large, the density of three-term arithmetic progressions with some nonzero common difference is at least the random bound (the cube of the set density) up to an additive . For a fixed odd prime , we prove that the required dimension grows as an exponential tower of 's of height . This improves both the lower and upper bound, and is the first example of a result where a tower-type bound coming from applying a regularity lemma is shown to be necessary.
Recommendations
- Popular progression differences in vector spaces II
- On the structure of steps of three-term arithmetic progressions in a dense set of integers
- On the distribution of three-term arithmetic progressions in sparse subsets of F_p^n
- Regularity, uniformity, and quasirandomness
- Szemerédi's theorem and problems on arithmetic progressions
Cited in
(9)- A tight bound for Green's arithmetic triangle removal lemma in vector spaces
- On the distribution of three-term arithmetic progressions in sparse subsets of F_p^n
- A tight bound for Green's arithmetic triangle removal lemma in vector spaces
- Stable arithmetic regularity in the finite field model
- Popular progression differences in vector spaces II
- An improved lower bound for arithmetic regularity
- Removal lemmas and approximate homomorphisms
- Tower-type bounds for Roth's theorem with popular differences
- Bounds in a popular multidimensional nonlinear Roth theorem
This page was built for publication: Popular progression differences in vector spaces
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5006287)