arXiv · math/0503367
Sets of k-recurrence but not (k+1)-recurrence
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.
Explore related subjects
Keep this discovery
N. Frantzikinakis, E. Lesigne, M. Wierdl. 2005-04-05. Sets of k-recurrence but not (k+1)-recurrence. https://arxiv.org/abs/math/0503367
Cite the original work for its findings. Save a collection to share your selection of sources.