A nilpotent IP polynomial multiple recurrence theorem
Dynamical Systems
2018-06-06 v4 Combinatorics
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 version of the nilpotent Hales-Jewett theorem due to Bergelson and Leibman.
Keywords
Cite
@article{arxiv.1206.0287,
title = {A nilpotent IP polynomial multiple recurrence theorem},
author = {Pavel Zorin-Kranich},
journal= {arXiv preprint arXiv:1206.0287},
year = {2018}
}
Comments
v4: switch to TeXlive 2016 and biblatex