A quantitative ergodic theory proof of Szemerédi's theorem

Electronic Journal of Combinatorics

Volumn 13, Issue 1 R, 2006, Pages 1-49

  Tao, Terence ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 33750924975     PISSN: 10778926     EISSN: 10778926     Source Type: Journal    
DOI: 10.37236/1125     Document Type: Article

References (47)

1. I. Assani, Pointwise convergence of ergodic averages along cubes, preprint.
2. F. Beleznay, M. Foreman, The complexity of the collection of measure-distal transformations. Ergodic Theory Dynam. Systems 16 (1996), no. 5, 929-962.
3. V. Bergelson and A. Leibman, Polynomial extensions of van der Waerden's and Szemerédi's theorems, J. Amer. Math. Soc. 9 (1996), 725-753.
4. V. Bergelson, B. Host, R. McCutcheon, F. Parreau, Aspects of uniformity in recurrence. Colloq. Math. 84/85 (2000), part 2, 549-576.
5. V. Bergelson and A. Leibman, Set polynomials and a polynomial extension of the Hales-Jewett theorem, Ann. of Math. (2) 150 (1999), no. 1, 33-75.
6. k, Israel J. Math 54 (1986), no. 3, 307-316.
7. J. Bourgain, On triples in arithmetic progression, GAFA 9 (1999), 968-984.
8. P. Erdos, P. Turán, On some sequences of integers, J. London Math. Soc. 11 (1936), 261-264.
9. P. Frankl, V. Rödl, Extremal problems on set systems, Random Structures and Algorithms 20 (2002), no. 2.
10. H. Furstenberg, Ergodic behavior of diagonal measures and a theorem of Szemerédi on arithmetic progressions, J. Analyse Math. 31 (1977), 204-256.
11. H. Furstenberg, Recurrence in Ergodic theory and Combinatorial Number Theory, Princeton University Press, Princeton NJ 1981.
12. H. Furstenberg, Y. Katznelson, An ergodic Szemerédi theorem for commuting transformations, J. d'Analyse Math. 34 (1978), 275-291.
13. H. Furstenberg, Y. Katznelson, An ergodic Szemerédi theorem for IP-systems and combinatorial theory, J. d'Analyse Math. 45 (1985), 117-168.
14. H. Furstenberg, Y. Katznelson, A density version of the Hales-Jewett theorem, J. d'Analyse Math. 57 (1991), 64-119.
15. H. Furstenberg, Y. Katznelson, D. Ornstein, The ergodic theoretical proof of Szemerédi's theorem, Bull. Amer. Math. Soc. 7 (1982), 527-552.
16. n2x), Convergence in ergodic theory and probability (Columbus OH 1993), 193-227, Ohio State Univ. Math. Res. Inst. Publ., 5. de Gruyter, Berlin, 1996.
17. J-Y. Girard, Herbrand's theorem and proof theory, Proceedings of the Herbrand symposium (Marseilles, 1981), 29-38, Stud. Logic Found. Math., 107, North-Holland, Amsterdam, 1982.
18. T. Cowers, Lower bounds of tower type for Szemerédi's uniformity lemma, Geom. Func. Anal. 7 (1997), 322-337.
19. T. Gowers, A new proof of Szemerédi's theorem for arithmetic progressions of length four, GAFA 8 (1998), 529-551.
20. T. Gowers, A new proof of Szemerédi's theorem, GAFA 11 (2001), 465-588.
21. T. Gowers, Hypergraph regularity and the multidimensional Szemerédi theorem, preprint.
22. R. Graham, B. Rothschild, J.H. Spencer, Ramsey Theory, John Wiley and Sons, NY (1980).
23. B.J. Green, T. Tao, The primes contain arbitrarily long arithmetic progressions, preprint.
24. 3(G) norm, preprint.
25. D.R. Heath-Brown, Integer sets containing no arithmetic progressions, J. London Math. Soc. 35 (1987), 385-394.
26. B. Host, B. Kra, Non-conventional ergodic averages and nilmanifolds, to appear in Ann. Math.
27. J. Kómlos, M. Simonovits, Szemerédi's regularity lemma and its applications in graph theory, Combinatorics, Paul Erdos is eighty, Vol 2. (Keszthely 1993), 295-352, Bolyai Soc. Math. Stud. 2, János Bolyai Math. Soc. Budapest 1996.
28. B. Nagle, V. Rödl, M. Schacht, The counting lemma for regular k-uniform hypergraphs, preprint.
29. V. Rödl, J. Skokan, Regularity lemma for k-uniform hypergraphs, Random Structures and Algorithms, 25 (2004), no. 1, 1-42.
30. V. Rödl, J. Skokan, Applications of the regularity lemma for uniform hypergraphs, Random Structures and Algorithms, 28 (2006), no. 2, 180-194.
31. V. Rödl, M. Schacht, E. Tengan, N. Tokushige, Density theorems and extremal hypergraph problems, Israel J. Math., 152 (2006), 371-380.
32. V. Rohlin, Selected topics from the metric theory of dynamical systems, Transl. Amer. Math. Soc. (2) 49 (1966), 171-209.
33. K.F. Roth, On certain sets of integers, J. London Math. Soc. 28 (1953), 245-252.
34. K.F. Roth, Irregularities of sequences relative to arithmetic progressions, IV. Period. Math. Hunger. 2 (1972), 301-326.
35. I. Ruzsa, E. Szemerédi, Triple systems with no six points carrying three triangles, Combinatorics (Proc. Fifth Hungarian Colloq. Keszthely, 1976), Vol. II., pp. 939-945., Colloq. Math. Soc. János Bolyai 18 (1978), North-Holland, Amsterdam-New York.
36. S. Shelah, Primitive recursive bounds for van der Waerden numbers, J. Amer. Math. Soc. 1 (1988), 683-697.
37. J. Solymosi, Note on a question of Erdos and Graham, Combinatorics Probability and Computing 13 (2004), 263-267.
38. E. Szemerédi, On sets of integers containing no four elements in arithmetic progression, Acta Math. Acad. Sci. Hungar. 20 (1969), 89-104.
39. E. Szemerédi, On sets of integers containing no k elements in arithmetic progression, Acta Arith. 27 (1975), 299-345.
40. E. Szemerédi, Regular partitions of graphs, in "Proc. Colloque Inter. CNRS" (J.-C. Bermond, J.-C. Fournier, M. Las Vergnas, D. Sotteau, eds.) (1978), 399-401.
41. T. Tao, Szemerédi's regularity lemma revisited, preprint.
42. T. Tao, A quantitative ergodic theory proof of Szemerédi's theorem (abridged), unpublished.
43. T. Tao, The Gaussian primes contain arbitrarily shaped constellations, preprint.
44. B.L. Van der Waerden, Beweis einer Baudetschen Vermutung, Nieuw. Arch. Wisk. 15 (1927), 212-216.
45. P. Varnavides, On certain sets of positive density, J. London Math. Soc. 39 (1959), 358-360.
46. M. Walters, Combinatorial proofs of the polynomial Van der Waerden and the polynomial Hales-Jewett theorem, J. London Math. Soc. 2 61 (2000), 1-12.
47. T. Ziegler, Universal characteristic factors and Furstenberg averages, J. Amer. Math. Soc. 20 (2007), 53-97.