Skip to content

Sets of k-recurrence but not (k+1)-recurrence

N. Frantzikinakis, E. Lesigne, M. Wierdl

math.DSarXiv:math/0503367

Abstract

For every k∈ 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.

Create a lesson