On the complexity function for sequences which are not uniformly recurrent

DOI10.1090/CONM/736/14833MaRDI QIDQ5210869zbMATH OpenOpenAlexFDO

Authors Nic Ormes, Ronnie Pavlov

Publication date 22 January 2020

Published in Dynamical Systems and Random Processes (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1907.06626

zbMATH Keywords

minimalsymbolic dynamicstransitiveuniquely ergodicword complexity

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Ergodicity, mixing, rates of mixing (37A25) Symbolic dynamics (37B10) Notions of recurrence and recurrent behavior in topological dynamical systems (37B20)

Abstract: We prove that every non-minimal transitive subshift $X$ satisfying a mild aperiodicity condition satisfies $limsup{c}_n(X)-1.5n=infty$, and give a class of examples which shows that the threshold of $1.5n$ cannot be increased. As a corollary, we show that any transitive $X$ satisfying $limsup{c}_n(X)-n=infty$ and $limsup{c}_n(X)-1.5n<infty$ must be minimal. We also prove some restrictions on the structure of transitive non-minimal $X$ satisfying $liminf{c}_n(X)-2n=-infty$, which imply unique ergodicity (for a periodic measure) as a corollary, which extends a result of Boshernitzan from the minimal case to the more general transitive case.

Recommendations

• Subsystems of transitive subshifts with linear complexity
• Boshernitzan’s condition, factor complexity, and an application
• On the number of ergodic measures for minimal shifts with eventually constant complexity growth
• Words with unbounded periodicity complexity
• The number of ergodic measures for transitive subshifts under the regular bispecial condition

Cites work

• A unique ergodicity of minimal symbolic flows with linear block growth
• Counting generic measures for a subshift of linear growth
• Examples of sequences of complexity less than 2n
• scientific article; zbMATH DE number 1542660 (Why is no real title available?)
• Introduction to Dynamical Systems
• Minimal symbolic flows having minimal block growth
• Substitutions in dynamics, arithmetics and combinatorics
• The P(n)/n-function for bi-finite words

Cited in

(7)

• Decidability of uniform recurrence of morphic sequences
• scientific article; zbMATH DE number 4043835 (Why is no real title available?)
• Subsystems of transitive subshifts with linear complexity
• A Unified View on Sequence Complexity Measures as Isometries
• Low complexity subshifts have discrete spectrum
• On the structure of generic subshifts
• On the complexity of a family of \(k\)-context-free sequences

This page was built for publication: On the complexity function for sequences which are not uniformly recurrent

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