On the complexity function for sequences which are not uniformly recurrent
Abstract
We prove that every non-minimal transitive subshift X satisfying a mild aperiodicity condition satisfies cn(X) - 1.5n = ∞, and give a class of examples which shows that the threshold of 1.5n cannot be increased. As a corollary, we show that any transitive X satisfying cn(X) - n = ∞ and cn(X) - 1.5n < ∞ must be minimal. We also prove some restrictions on the structure of transitive non-minimal X satisfying cn(X) - 2n = -∞, which imply unique ergodicity (for a periodic measure) as a corollary, which extends a result of Boshernitzan from the minimal case to the more general transitive case.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.