Strong Orbit Equivalence and Superlinear Complexity

preprint2022arXivOpen access

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 (G,G+,u)(G,G^+,u) and any sequence of positive numbers (pn)n∈N(p_n)_{n\in\mathbb{N}} such that lim⁡n/pn=0\lim n/p_n=0, there exist a minimal subshift whose dimension group is order isomorphic to (G,G+,u)(G,G^+,u) and whose complexity function grows slower than pnp_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 pnp_n.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.