Invariant measures for bipermutative cellular automata
Marcus Pivato
Abstract
A `right-sided, nearest neighbour cellular automaton' (RNNCA) is a continuous transformation F:AZ-->AZ determined by a local rule f:A0,1-->A so that, for any a in AZ and any z in Z, F(a)z = f(az,az+1) . We say that F is `bipermutative' if, for any choice of a in A, the map g:A-->A defined by g(b) = f(a,b) is bijective, and also, for any choice of b in A, the map h:A-->A defined by h(a)=f(a,b) is bijective. We characterize the invariant measures of bipermutative RNNCA. First we introduce the equivalent notion of a `quasigroup CA', to expedite the construction of examples. Then we characterize F-invariant measures when A is a (nonabelian) group, and f(a,b) = a*b. Then we show that, if F is any bipermutative RNNCA, and mu is F-invariant, then F must be mu-almost everywhere K-to-1, for some constant K . We use this to characterize invariant measures when AZ is a `group shift' and F is an `endomorphic CA'.
Create a lesson
Related papers
Physical and emergent nonpairwise interactions in oscillator networks: from higher-order phase reduction to coupling design
Riccardo Muolo, Hiroya Nakao, Christian Bick
Degree Growth of Iterates of Curves and Likely Intersections
Sina Saleh, Jit Wu Yap
Infinite prime sumsets in structured and Uk(Φ)-uniform sets
Felipe Hernández, Tristán Radić
Long-Lived Carpet-Like Transients in Time-Dependent Modular Discrete Laplacian Dynamics
Małgorzata Nowak-Kępczyk
SIPHy: Sparse identification of port-Hamiltonian systems from noisy data
Håkon Noren Myhr, Sølve Eidnes, J. Nathan Kutz
Extended dynamic mode decomposition with Fourier dictionaries: Error bounds and fast implementation
Felix Bartel, Sandra Ritter, Manuel Schaller et al.