Strong Orbit Equivalence and Superlinear Complexity
Dynamical Systems
2022-01-26 v2
Abstract
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 and any sequence of positive numbers such that , there exist a minimal subshift whose dimension group is order isomorphic to and whose complexity function grows slower than . 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 .
Cite
@article{arxiv.2009.13654,
title = {Strong Orbit Equivalence and Superlinear Complexity},
author = {Paulina Cecchi Bernales and Sebastián Donoso},
journal= {arXiv preprint arXiv:2009.13654},
year = {2022}
}
Comments
18 pages