Word Complexity of (Measure-Theoretically) Weakly Mixing Rank-One Subshifts

DOI10.1017/ETDS.2023.47MaRDI QIDQ6399442zbMATH OpenOpenAlexFDO

Authors Darren Creutz

Publication date 17 May 2022

Full work available at URL https://doi.org/10.1017/etds.2023.47

Mathematics Subject Classification ID

Ergodicity, mixing, rates of mixing (37A25) Symbolic dynamics (37B10)

Abstract: We exhibit subshifts admitting weakly mixing (probability) measures, for arbitrary $epsilon>0$, with word complexity $p$ satisfying $limsupfracp(q)q<1.5+epsilon$. For arbitrary $f(q)oinfty$, said subshifts can be made to satisfy $p(q)<q+f(q)$ infinitely often. We establish that every subshift associated to a rank-one transformation (on a probability space) which is not an odometer satisfies $limsupp(q)-1.5q=infty$ and that this is optimal for rank-ones.

Recommendations

• Measure-theoretically mixing subshifts with low complexity
• Low complexity subshifts have discrete spectrum
• Rank and symbolic complexity
• Topological mixing properties of rank-one subshifts
• Subsystems of transitive subshifts with linear complexity

Cited in

(3)

• On finite spacer rank for words and subshifts
• Low complexity subshifts have discrete spectrum
• Measure-theoretically mixing subshifts with low complexity

This page was built for publication: Word Complexity of (Measure-Theoretically) Weakly Mixing Rank-One Subshifts

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6399442)