Under the condition 100K^2 δ ≤ 1, a set with small doubling and small Fourier coefficients must have a dense intersection with a translate of a large regular Bohr set of controlled dimension.
The Kelley--Meka bounds for sets free of three-term arithmetic progressions
1 Pith paper cite this work. Polarity classification is still indexing.
abstract
We give a self-contained exposition of the recent remarkable result of Kelley and Meka: if $A\subseteq \{1,\ldots,N\}$ has no non-trivial three-term arithmetic progressions then $\lvert A\rvert \leq \exp(-c(\log N)^{1/12})N$ for some constant $c>0$. Although our proof is identical to that of Kelley and Meka in all of the main ideas, we also incorporate some minor simplifications relating to Bohr sets. This eases some of the technical difficulties tackled by Kelley and Meka and widens the scope of their method. As a consequence, we improve the lower bounds for finding long arithmetic progressions in $A+A+A$, where $A\subseteq \{1,\ldots,N\}$.
citation-role summary
citation-polarity summary
fields
math.CO 1years
2024 1verdicts
CONDITIONAL 1roles
background 1polarities
unclear 1representative citing papers
citing papers explorer
-
On Fourier coefficients of sets with small doubling
Under the condition 100K^2 δ ≤ 1, a set with small doubling and small Fourier coefficients must have a dense intersection with a translate of a large regular Bohr set of controlled dimension.