Roth's theorem on progressions revisited (Q940788)

The upper estimate of the maximal size of a set of integers in \([1, N]\) without three numbers forming an arithmetical progression is improved to \[ N { ( \log \log N)^2 ( \log N)^{-2/3}} . \] In the previous record (due to the same author) the exponent of the logarithm was 1/2. The method is a refinement of the author's, based on considering density increments in Bohr sets. Two further applications of the method are stated without proof, to covering sets with generalized arithmetic progressions (Freiman's theorem) and to finding Bohr sets in second difference sets. The details are given in an appendix by Sanders.