arXiv · 2007.03528
Breaking the logarithmic barrier in Roth's theorem on arithmetic progressions
Abstract
We show that if $A\subset \{1,\ldots,N\}$ contains no non-trivial three-term arithmetic progressions then $\lvert A\rvert \ll N/(\log N)^{1+c}$ for some absolute constant $c>0$. In particular, this proves the first non-trivial case of a conjecture of Erd\H{o}s on arithmetic progressions.
Explore related subjects
Keep this discovery
Thomas F. Bloom, Olof Sisask. 2020-07-07. Breaking the logarithmic barrier in Roth's theorem on arithmetic progressions. https://arxiv.org/abs/2007.03528
Cite the original work for its findings. Save a collection to share your selection of sources.