The abelian arithmetic regularity lemma
read the original abstract
We give a brief exposition and proof of the arithmetic regularity lemma of Green and Tao in the abelian ($U^2$) case, over $\{1,\dots,N\}$. This may be useful to those who need just the $U^2$ case of the lemma, as the general case is significantly more involved. It may also be useful as an introduction to the general case. No originality is claimed.
This paper has not been read by Pith yet.
Forward citations
Cited by 3 Pith papers
-
A structure theorem for sets with doubling $4+\delta$
Integer sets with doubling at most 4 + δ for sufficiently small δ > 0 have a specific arithmetic structure, generalizing the doubling < 4 case.
-
The sum-product phenomenon for dense subsets of finite fields
For dense subsets A of F_p with |A| ≥ αp, max(|A+A|, |A·A|) ≥ (f(α) - o(1))p where f(α) is the optimal constant explicitly determined here.
-
Arithmetic regularity as an alternative to transference
Arithmetic regularity decomposes arithmetic problems into real, p-adic, and combinatorial factors to obtain correct lower bounds on solution counts in dense sets, illustrated on a linear-plus-higher-degree equation system.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.