Central sets generated by uniformly recurrent words

DOI10.1017/ETDS.2013.69MaRDI QIDQ5262240zbMATH OpenOpenAlexFDO

Authors Michelangelo Bucci, Svetlana Puzynina, Luca Q. Zamboni

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

zbMATH Keywords

combinatorics on wordstopological dynamicsnumeration systemscentral setsStone-Čech compactification

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Symbolic dynamics (37B10) Notions of recurrence and recurrent behavior in topological dynamical systems (37B20) Combinatorics on words (68R15) Word problems (aspects of algebraic structures) (08A50)

Abstract: A subset $A$ of $ats$ is called an IP-set if $A$ contains all finite sums of distinct terms of some infinite sequence $(x_n{)}_{ninats}$ of natural numbers. Central sets, first introduced by Furstenberg using notions from topological dynamics, constitute a special class of IP-sets possessing rich combinatorial properties: Each central set contains arbitrarily long arithmetic progressions, and solutions to all partition regular systems of homogeneous linear equations. In this paper we investigate central sets in the framework of combinatorics on words. Using various families of uniformly recurrent words, including Sturmian words, the Thue-Morse word and fixed points of weak mixing substitutions, we generate an assortment of central sets which reflect the rich combinatorial structure of the underlying words. The results in this paper rely on interactions between different areas of mathematics, some of which had not previously been directly linked. They include the general theory of combinatorics on words, abstract numeration systems, and the beautiful theory, developed by Hindman, Strauss and others, linking IP-sets and central sets to the algebraic/topological properties of the Stone-v{C}ech compactification of $ats.$

Recommendations

• Additive properties of sets and substitutive dynamics
• On \(\text{IP}^*\) sets and central sets
• Central sets and substitutive dynamical systems
• Central sets and their combinatorial characterization
• Combined algebraic properties of central* sets

Cites work

• A new and stronger central sets theorem
• Behavior of various complexity functions
• Distral transformation groups
• 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
• Imbalances in Arnoux-Rauzy sequences
• Infinite partition regular matrices: solutions in central sets
• Mixing properties of substitutions
• On additive properties of sets defined by the Thue-Morse word
• On periodicity and low complexity of infinite permutations
• On the number of partitions of an integer in the \(m\)-bonacci base
• Strongly central sets and sets of polynomial returns mod 1
• Sturmian words: structure, combinatorics, and their arithmetics
• Symbolic Dynamics II. Sturmian Trajectories
• Systèmes de numération et fonctions fractales relatifs aux substitutions. (Numeration systems and fractal functions related to substitutions)
• Uniform sets and super-stationary sets over general alphabets

Cited in

(5)

• Central sets and substitutive dynamical systems
• A history of central sets
• On prefixal factorizations of words
• Additive properties of sets and substitutive dynamics
• On additive properties of sets defined by the Thue-Morse word

This page was built for publication: Central sets generated by uniformly recurrent words

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5262240)