English

Breaking the logarithmic barrier in Roth's theorem on arithmetic progressions

Number Theory 2021-09-02 v2 Combinatorics

Abstract

We show that if A{1,,N}A\subset \{1,\ldots,N\} contains no non-trivial three-term arithmetic progressions then AN/(logN)1+c\lvert A\rvert \ll N/(\log N)^{1+c} for some absolute constant c>0c>0. In particular, this proves the first non-trivial case of a conjecture of Erd\H{o}s on arithmetic progressions.

Keywords

Cite

@article{arxiv.2007.03528,
  title  = {Breaking the logarithmic barrier in Roth's theorem on arithmetic progressions},
  author = {Thomas F. Bloom and Olof Sisask},
  journal= {arXiv preprint arXiv:2007.03528},
  year   = {2021}
}
R2 v1 2026-06-23T16:55:18.146Z