Subsystems of transitive subshifts with linear complexity
From MaRDI portal
Publication:5081579
Abstract: We bound the number of distinct minimal subsystems of a given transitive subshift of linear complexity, continuing work of Ormes and Pavlov [7]. We also bound the number of generic measures such a subshift can support based on its complexity function. Our measure-theoretic bounds generalize those of Boshernitzan [1] and are closely related to those of Cyr and Kra [2].
Recommendations
- Counting generic measures for a subshift of linear growth
- On the number of ergodic measures for minimal shifts with eventually constant complexity growth
- On the complexity function for sequences which are not uniformly recurrent
- The number of ergodic measures for transitive subshifts under the regular bispecial condition
- Realizing ergodic properties in zero entropy subshifts
Cites work
- A unique ergodicity of minimal symbolic flows with linear block growth
- An Introduction to Symbolic Dynamics and Coding
- Counting generic measures for a subshift of linear growth
- scientific article; zbMATH DE number 3745547 (Why is no real title available?)
- scientific article; zbMATH DE number 2042127 (Why is no real title available?)
- Interval exchange transformations
- Minimal symbolic flows having minimal block growth
- On the complexity function for sequences which are not uniformly recurrent
- On the number of ergodic measures for minimal shifts with eventually constant complexity growth
- Substitutions in dynamics, arithmetics and combinatorics
- Symbolic Dynamics II. Sturmian Trajectories
- The number of ergodic measures for transitive subshifts under the regular bispecial condition
Cited in
(10)- Counting generic measures for a subshift of linear growth
- Realizing ergodic properties in zero entropy subshifts
- The complexity threshold for the emergence of Kakutani inequivalence
- On the complexity function for sequences which are not uniformly recurrent
- Low complexity subshifts have discrete spectrum
- Measure-theoretically mixing subshifts with low complexity
- On the structure of generic subshifts
- Word Complexity of (Measure-Theoretically) Weakly Mixing Rank-One Subshifts
- Slow entropy and variational dynamical systems
- Measure-theoretically mixing subshifts of minimal word complexity
This page was built for publication: Subsystems of transitive subshifts with linear complexity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5081579)