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

DOI10.5802/AIF.2202zbMATH Open1123.37001arXivmath/0503367OpenAlexW1643698954MaRDI QIDQ877530FDOQ877530

Nikos Frantzikinakis, Emmanuel Lesigne, Máté Wierdl

Publication date: 24 April 2007

Published in: Annales de l’institut Fourier (Search for Journal in Brave)

Abstract: For every $kinmathbbN$, 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.

Full work available at URL: https://arxiv.org/abs/math/0503367

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

zbMATH Keywords

ergodic theorycombinatorial additive number theorymultiple recurrent setssets of \(k\)-recurrence

Mathematics Subject Classification ID

Dynamical aspects of measure-preserving transformations (37A05) General groups of measure-preserving transformations and dynamical systems (37A15) Notions of recurrence and recurrent behavior in topological dynamical systems (37B20) Additive difference equations (39A10) Recurrences (11B37)

Cites Work

• Title not available (Why is that?)
• Ergodic behavior of diagonal measures and a theorem of Szemeredi on arithmetic progressions
• Weakly mixing PET
• Title not available (Why is that?)
• Nonconventional ergodic averages and nilmanifolds
• An ergodic Szemerédi theorem for commuting transformations
• The ergodic theoretical proof of Szemerédi’s theorem
• Universal characteristic factors and Furstenberg averages
• Chromatic numbers of Cayley graphs on \(\mathbb Z\) and recurrence

Cited In (15)

• A generalization of van der Corput's difference theorem with applications to recurrence and multiple ergodic averages
• Sets without k‐term progressions can have many shorter progressions
• Recurrence properties of sequences of integers
• Recurrence, rigidity, and popular differences
• Powers of sequences and recurrence
• Sets that force recurrence
• The construction of a set of recurrence which is not a set of strong recurrence
• Semi-progressions
• Title not available (Why is that?)
• Some open problems on multiple ergodic averages
• Variations on topological recurrence
• Powers of sequences and convergence of ergodic averages
• Random differences in Szemerédi's theorem and related results
• 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)