The Complexity Threshold For The Emergence Of Kakutani Inequivalence

Authors

V. Cyr
Aimee S.A. Johnson, Swarthmore CollegeFollow
B. Kra
A. Şahİn

Document Type

Article

Publication Date

2022

Published In

Israel Journal Of Mathematics

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 superlinear complexity that admit both loosely Bernoulli and non-loosely Bernoulli ergodic measures and that no minimal subshift with linear complexity can admit inequivalent measures.

Comments

This work is a preprint that is freely available courtesy of Springer. The version of record can be freely accessed via SpringerNature's SharedIt service.

Recommended Citation

V. Cyr, Aimee S.A. Johnson, B. Kra, and A. Şahİn. (2022). "The Complexity Threshold For The Emergence Of Kakutani Inequivalence". Israel Journal Of Mathematics. Volume 251, 271-300. DOI: 10.1007/s11856-022-2426-z
https://works.swarthmore.edu/fac-math-stat/279