Measure-theoretically mixing subshifts of minimal word complexity
Transactions of the American Mathematical Society · 07.05.2026 · 379 (9) · 6393-6446
DOI: 10.1090/tran/9634 ↗Kurz gefasst
Fachartikel in der Zeitschrift Transactions of the American Mathematical Society, online erschienen am 07.05.2026. Verfasst von Darren Creutz. Die Arbeit nennt 27 Literaturangaben.
Abstract (Originalsprache)
We resolve a long-standing open question on the relationship between measure-theoretic dynamical complexity and symbolic complexity by establishing the exact word complexity at which measure-theoretic strong mixing manifests: For every superlinear f : N → N f : \mathbb {N} \to \mathbb {N} , i.e., f ( q ) q → ∞ \frac {f(q)}{q} \to \infty , there exists a subshift admitting a (strongly) mixing of all orders probability measure with word complexity p p such that p ( q ) f ( q ) → 0 \frac {p(q)}{f(q)} \to 0 . For a subshift with non-superlinear word complexity p p , lim inf p ( q ) q > ∞ \liminf \frac {p(q)}{q} > \infty , every ergodic probability measure is partially rigid.
Zitieren
APA
Creutz, D. (2026). Measure-theoretically mixing subshifts of minimal word complexity. Transactions of the American Mathematical Society, 379(9), 6393-6446. https://doi.org/10.1090/tran/9634
Vancouver
Creutz D. Measure-theoretically mixing subshifts of minimal word complexity. Transactions of the American Mathematical Society. 2026;379(9):6393-6446. doi:10.1090/tran/9634
BibTeX
@article{Creutz2026,
author = {Creutz, Darren},
title = {Measure-theoretically mixing subshifts of minimal word complexity},
journal = {Transactions of the American Mathematical Society},
year = {2026},
volume = {379},
number = {9},
pages = {6393--6446},
doi = {10.1090/tran/9634}
}
EUVIMED