The complexity threshold for the emergence of Kakutani inequivalence

Van Cyr, Aimee Johnson, Bryna Kra*, Ayşe Şahİn

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

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.

Original languageEnglish (US)
Pages (from-to)271-300
Number of pages30
JournalIsrael Journal of Mathematics
Volume251
Issue number1
DOIs
StatePublished - Dec 2022

ASJC Scopus subject areas

  • Mathematics(all)

Fingerprint

Dive into the research topics of 'The complexity threshold for the emergence of Kakutani inequivalence'. Together they form a unique fingerprint.

Cite this