Sets of k-recurrence but not (k+1)-recurrence
From MaRDI portal
Abstract: For every , we produce a set of integers which is -recurrent but not -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.
Recommendations
- The construction of a set of recurrence which is not a set of strong recurrence
- Sets that force recurrence
- A note on recurrent sets
- Ruzsa's problem on sets of recurrence
- The generalized recurrent set and strong chain recurrence
- Sets of recurrence as bases for the positive integers
- On sets without k-term arithmetic progression
- scientific article; zbMATH DE number 936375
- Recursively enumerable sets and van der Waerden's theorem on arithmetic progressions
- On a Class of Recursively Enumerable Sets
Cites work
- scientific article; zbMATH DE number 3719449 (Why is no real title available?)
- scientific article; zbMATH DE number 891064 (Why is no real title available?)
- An ergodic Szemerédi theorem for commuting transformations
- Chromatic numbers of Cayley graphs on \(\mathbb Z\) and recurrence
- Ergodic behavior of diagonal measures and a theorem of Szemeredi on arithmetic progressions
- Nonconventional ergodic averages and nilmanifolds
- The ergodic theoretical proof of Szemerédi’s theorem
- Universal characteristic factors and Furstenberg averages
- Weakly mixing PET
Cited in
(21)- Recurrence properties of sequences of integers
- Sets without k‐term progressions can have many shorter progressions
- A generalization of van der Corput's difference theorem with applications to recurrence and multiple ergodic averages
- Recurrence, rigidity, and popular differences
- Some new examples of recurrence and non-recurrence sets for products of rotations on the unit circle.
- A set of 2-recurrence whose perfect squares do not form a set of measurable recurrence
- Powers of sequences and recurrence
- Sets that force recurrence
- The construction of a set of recurrence which is not a set of strong recurrence
- Uniform distribution of prime powers and sets of recurrence and van der Corput sets in \(\mathbb{Z}^k\)
- Semi-progressions
- Variations on topological recurrence
- Powers of sequences and convergence of ergodic averages
- Some open problems on multiple ergodic averages
- scientific article; zbMATH DE number 5219605 (Why is no real title available?)
- Random differences in Szemerédi's theorem and related results
- Intersections of shifted sets
- Recurrent sets, entropy and independence
- Bohr recurrence and density of non-lacunary semigroups of \(\mathbb{N}\)
- Degree lowering for ergodic averages along arithmetic progressions
- Nil Bohr-sets and almost automorphy of higher order
This page was built for publication: Sets of \(k\)-recurrence but not \((k+1)\)-recurrence
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q877530)