2000 character limit reached
Subsystems of transitive subshifts with linear complexity
Published 15 Jul 2019 in math.DS | (1907.06325v1)
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].
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.