Sets of k-recurrence but not (k+1)-recurrence
classification
🧮 math.DS
math.CO
keywords
recurrentresultaveragescombinatorialconsequenceconvergencediscussergodic
read the original abstract
For every $k\in \mathbb{N}$, we produce a set of integers which is $k$-recurrent but not $(k+1)$-recurrent. This extends a result of Furstenberg who produced a 1-recurrent set which is not 2-recurrent. We discuss a similar result for convergence of multiple ergodic averages. Finally, we also point out a combinatorial consequence related to Szemer\' edi's theorem.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.