betaFeedback

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 p(q)p(q) satisfy lim inf⁡q→∞p(q)q<2+ε \liminf_{q\to\infty}\frac{p(q)}q<2+ε for any prescribed ε>0ε>0 and, conversely, we prove that every lightly mixing rank-one subshift satisfies lim inf⁡q→∞p(q)q>2, \liminf_{q\to\infty}\frac{p(q)}q>2, establishing 22 as the optimal limiting threshold in the rank-one setting. More quantitatively, we show that every αα-partially mixing rank-one subshift satisfies lim inf⁡q→∞p(q)q≥2+α(1+α). \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.

Paper details

vlnc:W_z9xzxw3s
Version
v1 · latest
Published
Fresh — added to the Hub within the last 30 days
Added
License
arXiv nonexclusive license
Usage

views · 0

downloads · 0

A view counts once per browser per day, a download each time the PDF is requested.

  • Mathematics

Not recorded for this paper

View statement
Looking for related papers…