Central sets generated by uniformly recurrent words
From MaRDI portal
Publication:5262240
DOI10.1017/etds.2013.69zbMath1355.37026arXiv1301.5115MaRDI QIDQ5262240
Luca Q. Zamboni, Michelangelo Bucci, Svetlana Puzynina
Publication date: 13 July 2015
Published in: Ergodic Theory and Dynamical Systems (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1301.5115
topological dynamics; numeration systems; Stone-Čech compactification; combinatorics on words; central sets
68R15: Combinatorics on words
05A05: Permutations, words, matrices
37B10: Symbolic dynamics
37B20: Notions of recurrence and recurrent behavior in topological dynamical systems
08A50: Word problems (aspects of algebraic structures)
Related Items
A history of central sets, On prefixal factorizations of words, Central sets and substitutive dynamical systems
Cites Work
- On additive properties of sets defined by the Thue-Morse word
- Behavior of various complexity functions
- Distral transformation groups
- Systèmes de numération et fonctions fractales relatifs aux substitutions. (Numeration systems and fractal functions related to substitutions)
- Sturmian words: structure, combinatorics, and their arithmetics
- Imbalances in Arnoux-Rauzy sequences
- Finite sums from sequences within cells of a partition of N
- Geometric realization and coincidence for reducible non-unimodular Pisot tiling spaces with an application to \(\beta\)-shifts
- On the number of partitions of an integer in the \(m\)-bonacci base
- On periodicity and low complexity of infinite permutations
- Strongly central sets and sets of polynomial returns mod 1
- Uniform sets and super-stationary sets over general alphabets
- Mixing properties of substitutions
- Infinite partition regular matrices: solutions in central sets
- A new and stronger central sets theorem
- Symbolic Dynamics II. Sturmian Trajectories
