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
A blueprint for the formalization of norm-variation of multiple ergodic averages for commuting transformations
Floris van Doorn, Polona Durcik, Joris Roos et al.
On some aspects of discrete groups acting ergodically on the boundary
Subhadip Dey, Mikołaj Frączyk, Sebastian Hurtado
A Structural Theory of Admissible Transitions in Biological Reaction Networks
Stephan Peter, Bashar Ibrahim
Sequential and distributive dual futile cycle: Hopf bifurcation can occur under parameter-rich kinetics but cannot occur under mass action kinetics
Nicola Vassena
Rigidity on the two-torus and Sarnak's conjecture
Yinshan Chang, Jian Wang, Junchang Zhou
Linear response for random systems with a cusp
Davrbek Oltiboev, Karim Rakhimov, Marks Ruziboev