论文信息 - Roth’s theorem on progressions revisited

Roth’s theorem on progressions revisited

This paper is a sequel to [B]. Our main result is an improvement of the density condition for a subset A ⊂ {1,. .. , N } to contain a nontrivial arithmetic progression of length 3. More specifically, we prove the following Theorem 1. (0.1) δ ≫ (log log N) 2 (log N) 2/3 (N assumed sufficiently large), then A contains nontrivial progressions of length 3.

Jean Bourgain | J. Bourgain

[1] D. R. Heath-Brown. Integer Sets Containing No Arithmetic Progressions , 1987 .

[2] K. F. Roth. On Certain Sets of Integers , 1953 .

[3] T. Sanders. Appendix to ‘Roth’s theorem on progressions revisited,’ by , 2008 .

[4] Jean Bourgain,et al. On Triples in Arithmetic Progression , 1999 .

[5] J. Bourgain. A Tribute to Paul Erdős: On arithmetic progressions in sums of sets of integers , 1990 .

[6] Mei-Chu Chang. A polynomial bound in Freiman's theorem , 2002 .

[7] Terence Tao,et al. Additive combinatorics , 2007, Cambridge studies in advanced mathematics.

[8] T. Sanders. Appendix to ‘Roth’s theorem on progressions revisited,’ by J. Bourgain , 2007, 0710.0642.

[9] T. Sanders,et al. A Note on Freĭman's Theorem in Vector Spaces , 2006, Combinatorics, Probability and Computing.