On certain other sets of integers (Q351354)

Let \(A\subset\{1, \ldots, N\}\) be a set of integers without non-trivial arithmetic progressions of length \(3\). Then \[ |A|=O\left(\frac{N}{(\log N)^{3/4-o(1)}}\right). \] The problem of estimating an upper bound on \(|A|\) goes back to Erdős and Turán, and was for example studied by Roth, Heath-Brown, Szemerédi, and Bourgain. The author refines the work of \textit{J. Bourgain} [J. Anal. Math. 104, 155-192 (2008; Zbl 1155.11011)], where a resampling technique was introduced. Here it is shown that several density increment steps are (in some sense) independent, so that they can be more efficiently treated simultaneously. The author has meanwhile significantly improved the upper bound to \[ |A|= O\left(\frac{N(\log \log N)^5}{\log N}\right) \] [Ann. Math. (2) 174, No. 1, 619--636 (2011; Zbl 1264.11004)].