Improved bound in Roth's theorem on arithmetic progressions (Q2039550): Difference between revisions

In this paper the author improves the upper bound in the well known theorem of Roth on arithmetic progressions. Namely, he proves that if \(A \subseteq \{1,2, \dots{} ,N\}\) does not contain a non-trivial arithmetic progression of length three, then \[ |A| \ll \frac{(\log\log N)^{3}(\log\log\log N)^{4}}{\log N}N, \] where \(N\) is an integer and \(|A|\) denotes the cardinality of the set \(|A|\). The proof is based on Fourier analysis. In particular, the author applies the density increment argument and then the iterative method of Bloom. Furthermore, the author mentions that during the review process a preprint of \textit{T. F. Bloom} and \textit{O. Sisask} [``Breaking the logarithmic barrier in Roth's theorem on arithmetic progressions'', Preprint, \url{arXiv:2007.03528}] has appeared which improves on his result to \[ |A| \ll \frac{N}{(\log N)^{1+c}}, \] for some absolute constant \(c > 0\).