Arithmetic progressions in sets of small doubling

From MaRDI portal



Abstract: We show that if a finite, large enough subset A of an arbitrary abelian group satisfies the small doubling condition |A + A| < (log |A|)^{1 - epsilon} |A|, then A must contain a three-term arithmetic progression whose terms are not all equal, and A + A must contain an arithmetic progression or a coset of a subgroup, either of which of size at least exp^[ c (log |A|)^{delta} ]. This extends analogous results obtained by Sanders and, respectively, by Croot, Laba and Sisask in the case where the group is that of the integers or a finite field.


Let \(A\) be a finite set in a commutative group. The paper presents several results of the following kind: if \( |A+A| < K |A| \), then \(A\) and \(|A+A|\) contain arithmetic progressions, the length depending on the size of \(K\). Remarkably, the results are almost as strong as known under the stronger assumption that the density of \(A\) is \(1/K\). The existence of a 3-term progression is shown for NEWLINE\[NEWLINE K < c ( \log |A| ) ( \log\log |A| )^{-7} , NEWLINE\]NEWLINE and \(A+A\) is shown to contain a progression or a coset of size \( \exp c \left( (\log |A|)/ (K ( \log K)^3 \right)^{1/2} \).











This page was built for publication: Arithmetic progressions in sets of small doubling

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2810742)