Asymptotic Randomization of Sofic Shifts by Linear Cellular Automata
Marcus Pivato, Reem Yassawi
Abstract
Let M=ZD be a D-dimensional lattice, and let A be an abelian group. AM is then a compact abelian group; a `linear cellular automaton' (LCA) is a topological group endomorphism Φ:AM --> AM that commutes with all shift maps. Suppose μis a probability measure on AM whose support is a subshift of finite type or sofic shift. We provide sufficient conditions (on Φand μ) under which Φ`asymptotically randomizes' μ, meaning that wk*limJ j --> oo Φj μ= η, where ηis the Haar measure on AM, and J has Cesaro density 1. In the case when Φ=1+σ, we provide a condition on μthat is both necessary and sufficient. We then use this to construct an example of a zero-entropy measure which is asymptotically randomized by 1+σ(all previously known examples had positive entropy).
Create a lesson
Related papers
Limit cycles of singular algebraic foliations on the real projective plane
Tianwei Gan, Hongjin He, Dongmei Xiao
Quadratic Hubbard trees, automata, and ray connections
Eduardo Ventilari Sodré
Algorithmic Non-dimensionalisation of Polynomial Dynamical Systems with CRNNondim
Georgio Hawi, Martin Wechselberger
Statistical Stability and Linear Response for Suspension Measures under Base and Roof Perturbations
Aparna Rajput
Generating Forbidden Words and Measures of Maximal Entropy for Subshifts
Xinxing Wu, Xu Zhang
Large deviation of preimages of points under the dynamics of a holomorphic correspondence
Bharath Krishna Seshadri, Shrihari Sridharan