Open Access. Powered by Scholars. Published by Universities.®
- Discipline
Articles 1 - 2 of 2
Full-Text Articles in Dynamical Systems
Measure-Theoretically Mixing Subshifts With Low Complexity, Darren Creutz, Ronnie Pavlov, Shaun Rodock
Measure-Theoretically Mixing Subshifts With Low Complexity, Darren Creutz, Ronnie Pavlov, Shaun Rodock
Mathematics: Faculty Scholarship
We introduce a class of rank-one transformations, which we call extremely elevated staircase transformations. We prove that they are measure-theoretically mixing and, for any f : N → N with f (n)/n increasing and ∑ 1/f (n) < ∞, that there exists an extremely elevated staircase with word complexity p(n) = o(f (n)). This improves the previously lowest known complexity for mixing subshifts, resolving a conjecture of Ferenczi.
Local Finiteness And Automorphism Groups Of Low Complexity Subshifts, Ronnie Pavlov, Scott Schmieding
Local Finiteness And Automorphism Groups Of Low Complexity Subshifts, Ronnie Pavlov, Scott Schmieding
Mathematics: Faculty Scholarship
We prove that for any transitive subshift X with word complexity function cn(X), if lim inf(log(cn(X)/n)/(log log log n)) = 0, then the quotient group Aut(X, σ)/〈 σ〉 of the automorphism group of X by the subgroup generated by the shift σ is locally finite. We prove that significantly weaker upper bounds on cn(X) imply the same conclusion if the gap conjecture from geometric group theory is true. Our proofs rely on a general upper bound for the number of automorphisms of X of range n in terms of word complexity, which may be …