arXiv · 2611.19805
Word complexity cutoffs for mixing properties of subshifts
Abstract
Investigating word complexity cutoffs for partial and light mixing in subshifts, we construct partially mixing rank-one subshifts whose word complexity functions $p(q)$ satisfy $ \liminf_{q\to\infty}\frac{p(q)}q<2+ε$ for any prescribed $ε>0$ and, conversely, we prove that every lightly mixing rank-one subshift satisfies $ \liminf_{q\to\infty}\frac{p(q)}q>2, $ establishing $2$ as the optimal limiting threshold in the rank-one setting. More quantitatively, we show that every $α$-partially mixing rank-one subshift satisfies $ \liminf_{q\to\infty}\frac{p(q)}q\geq 2+\fracα{(1+α)}. $ Our constructions are a combination of staircase and Chacon-like rank-one stages; we introduce the independently interesting notion of mixing spans and meshes to establish partial mixing while retaining low word complexity.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Darren Creutz. 2026-11-15. Word complexity cutoffs for mixing properties of subshifts. https://searcharxiv.com/abs/2611.19805
Citations retain the original authors and DOI and include this site’s record URL. If this discovery service contributed to your research, you can also cite Searcharxiv by Indiciae: BibTeX · RIS.