A nilpotent IP polynomial multiple recurrence theorem
Preprint
Abstract
We generalize the IP-polynomial Szemer\'edi theorem due to Bergelson and McCutcheon and the nilpotent Szemer\'edi theorem due to Leibman. Important tools in our proof include a generalization of Leibman's result that polynomial mappings into a nilpotent group form a group and a multiparameter nilpotent Hales-Jewett theorem.Keywords
All Related Versions
This publication has 10 references indexed in Scilit:
- The quantitative behaviour of polynomial orbits on nilmanifoldsAnnals of Mathematics, 2012
- FVIP systems and multiple recurrenceIsrael Journal of Mathematics, 2005
- Multiple Recurrence Theorem for Measure Preserving Actions of a Nilpotent GroupGeometric and Functional Analysis, 1998
- Partition Theorems for Spaces of Variable WordsProceedings of the London Mathematical Society, 1994
- Recurrence in Ergodic Theory and Combinatorial Number Theory1981
- Topological dynamics and combinatorial number theoryJournal d'Analyse Mathématique, 1978
- A canonical partition relation for finite subsets of ωJournal of Combinatorial Theory, Series A, 1976
- Ramsey's theorem with sums or unionsJournal of Combinatorial Theory, Series A, 1975
- On sets of integers containing k elements in arithmetic progressionActa Arithmetica, 1975
- Finite sums from sequences within cells of a partition of NJournal of Combinatorial Theory, Series A, 1974