Asymptotic Randomization of Sofic Shifts by Linear Cellular Automata
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).
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.