arXiv · 2007.09220
The complexity threshold for the emergence of Kakutani inequivalence
Abstract
We show that linear complexity is the threshold for the emergence of Kakutani inequivalence for measurable systems supported on a minimal subshift. In particular, we show that there are minimal subshifts of arbitrarily low super-linear complexity that admit both loosely Bernoulli and non-loosely Bernoulli ergodic measures and that no minimal subshift with linear complexity can admit inequivalent measures.
Explore related subjects
Keep this discovery
Van Cyr, Aimee Johnson, Bryna Kra, Ayse Sahin. 2020-07-17. The complexity threshold for the emergence of Kakutani inequivalence. https://arxiv.org/abs/2007.09220
Cite the original work for its findings. Save a collection to share your selection of sources.