On word complexity and topological entropy of random substitution subshifts
From MaRDI portal
Publication:6435801
arXiv2305.04817MaRDI QIDQ6435801FDOQ6435801
Authors: Andrew Mitchell 
Publication date: 8 May 2023
Abstract: We consider word complexity and topological entropy for random substitution subshifts. In contrast to previous work, we do not assume that the underlying random substitution is compatible. We show that the subshift of a primitive random substitution has zero topological entropy if and only if it can be obtained as the subshift of a deterministic substitution, answering in the affirmative an open question of Rust and Spindeler. For constant length primitive random substitutions, we develop a systematic approach to calculating the topological entropy of the associated subshift. Further, we prove lower and upper bounds which hold even without primitivity. We show that for subshifts of non-primitive random substitutions, the complexity function can exhibit features not possible in the deterministic or primitive random setting, such as intermediate growth, and provide a partial classification of the permissible complexity functions for subshifts of constant length random substitutions.
Measures of information, entropy (94A17) Symbolic dynamics (37B10) Topological entropy (37B40) Quasicrystals and aperiodic tilings in discrete geometry (52C23)
This page was built for publication: On word complexity and topological entropy of random substitution subshifts
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6435801)
