Integer sets containing no arithmetic progressions (Q2640635)

\textit{K. F. Roth} [J. Lond. Math. Soc. 28, 104-109 (1953; Zbl 0050.040)] showed that a set of positive integers containing no three elements in arithmetic progression has O(x/log log x) elements below x. The reviewer improved this to \(O(x(\log x)^{-c})\) with an unspecified constant exponent \(c>0\) [J. Lond. Math. Soc., II. Ser 35, 385-394 (1987; Zbl 0589.10062)]. The present paper gives the author's account of the problem, the reviewer's version having used ideas from earlier, weaker, unpublished material by the author. The same result is obtained. The discrete circle method is used, but a key lemma of Roth is avoided by a more direct, combinatorial, argument. This results in a shorter, more elegant treatment, in which the exponent c is more readily estimated. The paper states that \(c=1/4\) is admissable, although the necessary calculations are not included. It is clear that \(c=1/3\) is the natural limit of the method.