arXiv:2009.13654 [math.DS]AbstractReferencesReviewsResources
Strong Orbit Equivalence and Superlinear Complexity
Paulina Cecchi Bernales, Sebastián Donoso
Published 2020-09-28Version 1
We show that within any strong orbit equivalent class, there exist minimal subshifts with arbitrarily low superlinear complexity. This is done by proving that for any simple dimension group with unit $(G,G^+,u)$ and any sequence of positive numbers $(p_n)_{n\in\mathbb{N}}$ such that $\lim n/p_n=0$, there exist a minimal subshift whose dimension group is order isomorphic to $(G,G^+,u)$ and whose complexity function grows slower than $p_n$. As a consequence, we get that any Choquet simplex can be realized as the set of invariant measures of a minimal Toeplitz subshift whose complexity grows slower than $p_n$.
Comments: 18 pages
Categories: math.DS
Related articles: Most relevant | Search more
arXiv:2308.09352 [math.DS] (Published 2023-08-18)
Subshifts of finite symbolic rank
arXiv:2007.09220 [math.DS] (Published 2020-07-17)
The complexity threshold for the emergence of Kakutani inequivalence
arXiv:2010.10287 [math.DS] (Published 2020-10-20)
Strong Orbit Equivalence in Cantor dynamics and simple locally finite groups