WorksMathematics
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 satisfy for any prescribed and, conversely, we prove that every lightly mixing rank-one subshift satisfies establishing as the optimal limiting threshold in the rank-one setting. More quantitatively, we show that every -partially mixing rank-one subshift satisfies 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.