Invariant measures for bipermutative cellular automata (original) (raw)
2005, Discrete and Continuous Dynamical Systems
https://doi.org/10.3934/DCDS.2005.12.723
Sign up for access to the world's latest research
checkGet notified about relevant papers
checkSave papers to use in your research
checkJoin the discussion with peers
checkTrack your impact
Abstract
A right-sided, nearest neighbour cellular automaton (RNNCA) is a continuous transformation Φ : A Z −→A Z determined by a local rule φ : A {0,1} −→A so that, for any a ∈ A Z and any z ∈ Z, Φ(a)z = φ(az, a z+1 ). We say that Φ is
Related papers
Some ergodic properties of invertible cellular automata
In this paper we consider invertible one-dimensional linear cellular automata (CA hereafter) defined on a finite alphabet of cardinality p k , i.e. the maps T f [l,r] : Z Z p k → Z Z p k which are given by T f [l,r] (x) = (yn) ∞ n=−∞ , yn = f (x n+l ,. .. , x n+r) = r P i=l λ i x n+i (mod p k), x = (xn) ∞ n=−∞ ∈ Z Z p k and f : Z r−l+1 p k → Z p k , over the ring Z p k (k ≥ 2 and p is a prime number), where gcd(p, λr) = 1 and p|λ i for all i = r (or gcd(p, λ l) = 1 and p|λ i for all i = l). Under some assumptions we prove that any right (left) permutative, invertible one-dimensional linear CA T f [l,r] and its inverse are strong mixing. We also prove that any right(left) permutative, invertible one-dimensional linear CA is Bernoulli automorphism without making use of the natural extension previously used in the literature.
Further results on generalized cellular automata
arXiv (Cornell University), 2023
Given a finite set A and a group homomorphism φ : H → G, a φ-cellular automaton is a function T : A G → A H that is continuous with respect to the prodiscrete topologies and φ-equivariant in the sense that h • T (x) = T (φ(h) • x), for all x ∈ A G , h ∈ H, where • denotes the shift actions of G and H on A G and A H , respectively. When G = H and φ = id, the definition of id-cellular automata coincides with the classical definition of cellular automata. The purpose of this paper is to expand the theory of φ-cellular automata by focusing on the differences and similarities with their classical counterparts. After discussing some basic results, we introduce the following definition: a φ-cellular automaton T : A G → A H has the unique homomorphism property (UHP) if T is not ψ-equivariant for any group homomorphism ψ : H → G, ψ = φ. We show that if the difference set ∆(φ, ψ) is infinite, then T is not ψ-equivariant; it follows that when G is torsion-free abelian, every non-constant T has the UHP. Furthermore, inspired by the theory of classical cellular automata, we study φ-cellular automata over quotient groups, as well as their restriction and induction to subgroups and supergroups, respectively.
On strong mixing property of cellular automata with respect to Markov measures
In this paper we study mixing properties of one-dimensional linear cellular automata over the ring Z m , a particular class of dynamical systems, determined by right (left) permutative local rule F with respect to the uniform Markov measure induced by doubly stochastic matrix P = p (i,j) and the probability vector π. We prove that one-dimensional linear cellular automata associated to right (resp. left) permutative local rule F = F [l, r], 0 < l < r (resp. l < r < 0), is strong mixing with respect to the uniform Markov measure. We also show that Z × N-actions generated by the one-dimensional linear cellular automata determined by bipermutative local rule F = F [l, r] and shift map is strong mixing with respect to the uniform Markov measure.
A non-ergodic probabilistic cellular automaton with a unique invariant measure
Stochastic Processes and their Applications, 2011
We exhibit a Probabilistic Cellular Automaton (PCA) on {0, 1} Z with a neighborhood of size 2 which is non-ergodic although it has a unique invariant measure. This answers by the negative an old open question on whether uniqueness of the invariant measure implies ergodicity for a PCA.
Ergodicity, transitivity, and regularity for linear cellular automata over Zm
Theoretical Computer Science, 2000
We study the dynamical behavior of D-dimensional linear cellular automata over Zm. We provide an easy-to-check necessary and sufficient condition for a D-dimensional linear cellular automata over Zm to be ergodic and topologically transitive. As a byproduct, we get that for linear cellular automata ergodicity is equivalent to topological transitivity. Finally, we prove that for 1-dimensional linear cellular automata over
Ergodicity, transitivity, and regularity for linear cellular automata over Z
Theoretical Computer Science, 2000
We study the dynamical behavior of D-dimensional linear cellular automata over Zm. We provide an easy-to-check necessary and su cient condition for a D-dimensional linear cellular automata over Z m to be ergodic and topologically transitive. As a byproduct, we get that for linear cellular automata ergodicity is equivalent to topological transitivity. Finally, we prove that for 1-dimensional linear cellular automata over Z m, regularity (denseness of periodic orbits) is equivalent to surjectivity. : S 0 3 0 4 -3 9 7 5 ( 9 8 ) 0 0 0 0 5 -X
1997
The algebraic conditions under which two one-dimensional cellular automata can commute is studied. It is shown that if either rule is permutive, that is, one-to-one in its leftmost and rightmost inputs, then the other rule can be written in terms of it; if either rule is a group, then the other is linear in it; and if either is permutive and affine, that is, linear up to a constant, then the other must also be affine. We also prove some simple results regarding the existence of identities, idempotents (quiescent states), and zeroes (absorbing states).
Remark on cellular automata and shift preserving maps
Applied Mathematics Letters, 2006
The main goal of this work is to show an extension of well known Hedlund's theorem which states that in the Cantor topology the cellular automata are the continuous shift preserving maps. This extension maintains the topological structure and uses the concept of barriers of Set Theory to generalize the notion of local rule in the definition of cellular automata.
Loading Preview
Sorry, preview is currently unavailable. You can download the paper by clicking the button above.
References (13)
- Bernard Host, Alejandro Maass and Servet Martínez. Uniform Bernoulli measure in dynamics of permutative cellular automata with algebraic local rules. Discrete & Continuous Dynamical Systems, 9(6):1423-1446, 2003.
- David S. Dummit and Richard M. Foote. Abstract Algebra. Prentice-Hall, Englewood Cliffs, NJ, 1991.
- F. Blanchard and A. Maass. Dynamical properties of expansive one-sided cellular automata. Isreal J. Math., 99:149-174, 1997.
- G. Hedlund. Endomorphisms and automorphisms of the shift dynamical systems. Mathemat- ical System Theory, 3:320-375, 1969.
- J. Dénes and A.D. Keedwell. Latin squares and their applications. Academic Press, New York, 1974.
- Bruce Kitchens. Expansive dynamics in zero-dimensional groups. Ergodic Theory & Dynam- ical Systems, 7:249-261, 1987.
- Rune Kleveland. Mixing properties of one-dimensional cellular automata. Proceedings of the AMS, 125(6):1755-1766, June 1997.
- A. Maass, S. Martínez, M. Pivato, and R. Yassawi. Asymptotic randomization of subgroup shifts by linear cellular automata. (submitted), 2004.
- Cris Moore. Quasi-linear cellular automata. Physica D, 103:100-132, 1997.
- Karl Petersen. Ergodic Theory. Cambridge University Press, New York, 1989.
- Hala O. Pflugfelder. Quasigroups and Loops: Introduction, volume 7 of Sigma Series in Pure Math B. Heldermann Verlag, Berlin, 1990.
- M. Pivato. Multiplicative cellular automata on nilpotent groups: Structure, entropy, and asymptotics. Journal of Statistical Physics, 110(1/2):247-267, January 2003.
- Laurent Schwartz. Lectures on disintegration of measures. Tata Institute of Fundamental Research, Bombay, 1975.
Related papers
Right-permutative cellular automata on topological Markov chains
Discrete and Continuous Dynamical Systems, 2008
In this paper we consider cellular automata (G, Φ) with algebraic local rules and such that G is a topological Markov chain which has a structure compatible to this local rule. We characterize such cellular automata and study the convergence of the Cesàro mean distribution of the iterates of any probability measure with complete connections and summable decay.
Conservation of some dynamical properties for operations on cellular automata
Theoretical Computer Science, 2009
We consider the family of all the Cellular Automata (CA) sharing the same local rule but having different memory. This family contains also all the CA with memory m ≤ 0 (one-sided CA) which can act both on A Z and on A N . We study several set theoretical and topological properties for these classes. In particular, we investigate if the properties of a given CA are preserved when considering the CA obtained by changing the memory of the original one (shifting operation). Furthermore, we focus our attention to the one-sided CA acting on A Z starting from the one-sided CA acting on A N and having the same local rule (lifting operation). As a particular consequence of these investigations, we prove that the long-standing conjecture [Surjectivity ⇒ Dense Periodic Orbits (DPO)] can be restated in several different (but equivalent) ways. Furthermore, we give some results on properties conserved under iteration of the CA global map.
On the quantitative behavior of the linear cellular automata
2013
In this paper, we study the quantitative behavior of one-dimensional linear cellular automata T f [−r,r] , defined by local rule f (x −r , . . . , xr) = r i=−r λ i x i (mod m), acting on the space of all doubly infinite sequences with values in a finite ring Zm, m ≥ 2. Once generalize the formulas given by Ban et al. [J. Cellular Automata 6 (2011) 385-397] for measure-theoretic entropy and topological pressure of one-dimensional cellular automata, we calculate the measure entropy and the topological pressure of the linear cellular automata with respect to the Bernoulli measure on the set Z Z m . Also, it is shown that the uniform Bernoulli measure is the unique equilibrium measure for linear cellular automata. We compare values of topological entropy and topological directional entropy by using the formula obtained by Akın [J. Computation and Appl. Math. 225 (2) (2009) 459-466]. The topological directional entropy is interpreted by means of figures. As an application, we demonstrate that the Hausdorff of the limit set of a linear cellular automaton is the unique root of Bowen's equation. Some open problems remain to be of interest.
Complex Systems, 2016
Commutative cellular automata are a class of cellular automata that portray certain characteristics of commutative behavior. We develop the notion of neighborhood partitions and neighborhood equivalence classes to analyze and enumerate these automata.
Shifting and Lifting of Cellular Automata
Lecture Notes in Computer Science, 2007
We consider the family of all the Cellular Automata (CA) sharing the same local rule but have different memory. This family contains also all the CA with memory m ≤ 0 (one-sided CA) which can act both on A Z and on A N . We study several set theoretical and topological properties for these classes. In particular we investigate if the properties of a given CA are preserved when we consider the CA obtained by changing the memory of the original one (shifting operation). Furthermore we focus our attention to the one-sided CA acting on A Z starting from the one-sided CA acting on A N and having the same local rule (lifting operation). As a particular consequence of these investigations, we prove that the long-standing conjecture [Surjectivity ⇒ Density of the Periodic Orbits (DPO)] is equivalent to the conjecture [Topological Mixing ⇒ DPO].
On the Bernoulli Automorphism of Reversible Linear Cellular Automata
This investigation studies the ergodic properties of reversible linear cellular automata over Zm for m ∈ N. We show that a reversible linear cellular automaton is either a Bernoulli automorphism or non-ergodic. This gives an affirmative answer to an open problem proposed in [Pivato, Ergodc theory of cellular automata, Encyclopedia of Complexity and Systems Science, 2009, pp. 2980-3015] for the case of reversible linear cellular automata.
The Complexity of Permutive Cellular Automata
Journal of cellular automata
This paper studies cellular automata in two aspects: Ergodic and topological behavior. For ergodic aspect, the formulae of measure-theoretic entropy, topological entropy and topological pressure are given in closed forms and Parry measure is demonstrated to be an equilibrium measure for some potential function. For topological aspect, an example is examined to show that the exhibition of snap-back repellers for a cellular automaton infers Li-Yorke chaos. In addition, bipermutive cellular automata are optimized for the exhibition of snap-back repellers in permutive cellular automata whenever two-sided shift space is considered.
On Ergodic Linear Cellular Automata over Zm
Symposium on Theoretical Aspects of Computer Science, 1997
We study the ergodic behavior of linear cellular automata over Zm. The main contribution of this paper is an easy-to-check necessary and sufficient condition for a linear cellular automaton over Zm to be ergodic. We prove that, for general cellular automata, ergodicity is equivalent to topological chaos (transitivity and sensitivity to initial conditions). Finally we prove that linear CA over
The Topological Directional Entropy of Z^2-actions Generated by Linear Cellular Automata
2008
In this paper we study the topological and metric directional entropy of Z^2-actions by generated additive cellular automata (CA hereafter), defined by a local rule f[l, r], l, r∈Z, l≤ r, i.e. the maps T_f[l, r]: Z^Z_m→Z^Z_m which are given by T_f[l, r](x) =(y_n)_ -∞^∞, y_n = f(x_n+l, ..., x_n+r) = ∑_i=l^rλ_ix_i+n(mod m), x=(x_n)_ n=-∞^∞∈Z^Z_m, and f: Z_m^r-l+1→Z_m, over the ring Z_m (m ≥ 2), and the shift map acting on compact metric space Z^Z_m, where m (m ≥2) is a positive integer. Our main aim is to give an algorithm for computing the topological directional entropy of the Z^2-actions generated by the additive CA and the shift map. Thus, we ask to give a closed formula for the topological directional entropy of Z^2-action generated by the pair (T_f[l, r], σ) in the direction θ that can be efficiently and rightly computed by means of the coefficients of the local rule f as similar to [Theor. Comput. Sci. 290 (2003) 1629-1646]. We generalize the results obtained by Akı n [The topo...