5 citations · 13 across the 12 of their papers we have counts for
Showing 2022Show all
3 papers · 1 filter
math.DS2022
Measure-Theoretically Mixing Subshifts of Minimal Word Complexity
Darren Creutz
We resolve a long-standing open question on the relationship between measure-theoretic dynamical complexity and symbolic complexity by establishing the exact word complexity at whi…
math.DS2022★ 1 cited
Word Complexity of (Measure-Theoretically) Weakly Mixing Rank-One Subshifts
Darren Creutz
We exhibit subshifts admitting weakly mixing (probability) measures, for arbitrary , with word complexity satisfying . For arbitrary $f(…
math.DS2022
Measure-Theoretically Mixing Subshifts with Low Complexity
Darren Creutz, Ronnie Pavlov, Shaun Rodock
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 :…