Central sets and a non-commutative Roth theorem

American Journal of Mathematics

Volumn 129, Issue 5, 2007, Pages 1251-1275

  Bergelson, V ^a   McCutcheon, R ^b  

^a OHIO STATE UNIVERSITY   (United States)

^b University of Memphis   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 35348959595     PISSN: 00029327     EISSN: None     Source Type: Journal    
DOI: 10.1353/ajm.2007.0031     Document Type: Article

References (28)

1. V. Bergelson, Minimal idempotents and ergodic Ramsey theory, Topics in Dynamics and Ergodic Theory, London Math. Soc. Lecture Note Ser., vol. 310, Cambridge Univ. Press, Cambridge, 2003, pp. 8-39.
2. V. Bergelson and N. Hindman, Some topological semicommutative van der Waerden type theorems and their combinatorial consequences, J. London Math. Soc. (2) 45 (1992), 385-403.
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. _, A nilpotent Roth theorem, Invent. Math. 147 (2002), 429-470.
5. _, Failure of Roth theorem for solvable groups of exponential growth, Ergodic Theory Dynam. Syst. 24 (2004), 45-53.
6. V. Bergelson, A. Leibman and R. McCutcheon, Polynomial Szemerédi theorems for countable modules over integral domains and finite fields, J. Anal. Math. 95 (2005), 243-296.
7. V. Bergelson and R. McCutcheon, Recurrence for semigroup actions and a non-commutative Schur theorem, Contemp. Math. 215 (1998), 205-222.
8. _, An Ergodic IP Polynomial Szemerédi Theorem, Mem. Amer. Math. Soc., vol. 695, 2000.
9. V. Bergelson, R. McCutcheon and Q. Zhang, A Roth theorem for amenable groups, Amer. J. Math. 119 (1997), 1173-1211.
10. R. Ellis, Distal transformation groups, Pacific J. Math. 8 (1958), 401-405.
11. H. Furstenberg, Ergodic behavior of diagonal measures and a theorem of Szemerédi on arithmetic progressions, J. Anal. Math. 31 (1977), 204-256.
12. _, Recurrence in Ergodic Theory and Combinatorial Number Theory, Princeton University Press, 1981.
13. H. Furstenberg and Y. Katznelson, An ergodic Szemerédi theorem for commuting transformations, J. Anal. Math. 34 (1978), 275-291.
14. _, An ergodic Szemerédi theorem for IP-systems and combinatorial theory, J. Anal. Math. 45 (1985), 117-168.
15. _, A density version of the Hales-Jewett theorem, J. Anal. Math. 57 (1991), 64-119.
16. H. Furstenberg and B. Weiss, Markov processes and Ramsey theory for trees, Combin. Probab. Comput. 12 (2003), 547-563.
17. W. T. Gowers, A new proof of Szemerédi's theorem, Geom. Funct. Anal. 11 (2001), 465-588.
18. _, Hypergraph regularity and the multidimensional Szemerédi theorem, manuscript.
19. B. Green and T. Tao, The primes contain arbitrarily long arithmetic progressions, Ann. Math, (to appear).
20. N. Hindman and D. Strauss, Algebra in the Stone-Čech Compactification. Theory and Applications, de Gruyter Exp. Math., vol. 27, de Gruyter, Berlin, 1998.
21. A. Leibman, Multiple recurrence theorem for measure preserving actions of a nilpotent group, Geom. Funct. Anal. 8 (1998), 853-931.
22. B. Nagle, V. Rödl, and M. Schacht, The counting lemma for regular k-uniform hypergraphs, Random Structures Algorithms 28 (2006), 113-179.
23. V. Rödl and J. Skokan, Regularity lemma for k-uniform hypergraphs. Random Structures Algorithms 25 (2004), 1-42.
24. K. Roth, Sur quelques ensembles d'entiers, C.R. Acad. Sci. Paris 234 (1952), 388-390.
25. m (mod p), Jahresbericht der Deutschen Math.-Ver. 25 (1916), 114-117.
26. E. Szemerédi, On sets of integers containing no k elements in arithmetic progression, Acta Arith. 27 (1975), 199-245.
27. T. Tao, A correspondence principle between (hyper)graph theory and probability theory, and the (hyper)graph removal lemma, J. Anal. Math, (to appear).
28. B. L. van der Waerden, Beweis einer Baudetschen Vermutung, Nieuw Arch. Wisk. 15 (1927), 212-216.