arXiv:1907.06626 [math.DS]AbstractReferencesReviewsResources
On the complexity function for sequences which are not uniformly recurrent
Published 2019-07-15Version 1
We prove that every non-minimal transitive subshift $X$ satisfying a mild aperiodicity condition satisfies $\limsup c_n(X) - 1.5n = \infty$, 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 $\limsup c_n(X) - n = \infty$ and $\limsup c_n(X) - 1.5n < \infty$ must be minimal. We also prove some restrictions on the structure of transitive non-minimal $X$ satisfying $\liminf c_n(X) - 2n = -\infty$, 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.
Comments: 12 pages
Categories: math.DS
Related articles: Most relevant | Search more
arXiv:2408.03403 [math.DS] (Published 2024-08-06)
On the complexity of subshifts and infinite words
Minoration of the complexity function associated to a translation on the torus
arXiv:2307.05850 [math.DS] (Published 2023-07-11)
Entropy for $k$-trees defined by $k$ transition matrices