English
Related papers

Related papers: Invariant measures for bipermutative cellular auto…

200 papers

The paper formalizes and extends the idea of local structure approximation for cellular automata originally proposed by Gutowitz et. al. We start with a review of the construction of a probability measure on the set of bi-infinite strings…

Cellular Automata and Lattice Gases · Physics 2017-01-13 Henryk Fukś

Since first introduced by John von Neumann, the notion of cellular automaton has grown into a key concept in computer science, physics and theoretical biology. In its classical setting, a cellular automaton is a transformation of the set of…

Group Theory · Mathematics 2017-01-24 Alonso Castillo-Ramirez , Maximilien Gadouleau

We will consider a family of cellular automata $\Phi: \{1,2,...,r\}^\mathbb{N}\circlearrowright$ that are not of algebraic type. Our first goal is to determine conditions that result in the identification of probabilities that are at the…

Dynamical Systems · Mathematics 2024-07-08 Artur O. Lopes , Elismar R. Oliveira , Marcelo Sobottka

For a class of one-dimensional cellular automata, we review and complete the characterization of the invariant measures (in particular, all invariant phase separation measures), the rate of convergence to equilibrium, and the derivation of…

Probability · Mathematics 2011-11-10 Vladimir Belitsky , Pablo A. Ferrari

Cellular automata (CA) consist of an array of identical cells, each of which may take one of a finite number of possible states. The entire array evolves in discrete time steps by iterating a global evolution G. Further, this global…

Discrete Mathematics · Computer Science 2015-03-18 Pablo Arrighi , Renan Fargetton , Vincent Nesme , Eric Thierry

Gauge-invariance is a fundamental concept in Physics -- known to provide mathematical justification for the fundamental forces. In this paper, we provide discrete counterparts to the main gauge theoretical concepts directly in terms of…

Formal Languages and Automata Theory · Computer Science 2022-01-25 Pablo Arrighi , Giuseppe Di Molfetta , Nathanaël Eon

Let $G$ be a group and let $A$ be a finite set with at least two elements. A cellular automaton (CA) over $A^G$ is a function $\tau : A^G \to A^G$ defined via a finite memory set $S \subseteq G$ and a local function $\mu :A^S \to A$. The…

Group Theory · Mathematics 2023-10-10 A. Castillo-Ramirez , M. Sanchez-Alvarez , A. Vazquez-Aceves , A. Zaldivar-Corichi

In this article we study a class of shift-invariant and positive rate probabilistic cellular automata (PCA) on rooted d-regular trees $\mathbb{T}^d$. In a first result we extend the results of [10] on trees, namely we prove that to every…

Cellular Automata and Lattice Gases · Physics 2019-02-01 Bruno Kimura , Wioletta Ruszel , Cristian Spitoni

We give new sufficient ergodicity conditions for two-state probabilistic cellular automata (PCA) of any dimension and any radius. The proof of this result is based on an extended version of the duality concept. Under these assumptions, in…

Dynamical Systems · Mathematics 2012-06-28 Cristian Coletti , Pierre Tisseur

We show that a cellular automaton (or shift-endomorphism) on a transitive subshift is either almost equicontinuous or sensitive. On the other hand, we construct a cellular automaton on a full-shift (hence a transitive subshift) that is…

Dynamical Systems · Mathematics 2023-06-22 Luguis de los Santos Baños , Felipe García-Ramos

We prove that the group of reversible cellular automata (RCA), on any alphabet $A$, contains a subgroup generated by three involutions which contains an isomorphic copy of every finitely generated group of RCA on any alphabet $B$. This…

Group Theory · Mathematics 2023-05-09 Ville Salo

In this note we show that if $G$ is a solvable group acting on the line, and if there is $T\in G$ having no fixed points, then there is a Radon measure $\mu$ on the line quasi-invariant under $G$. In fact, our method allows for the same…

Dynamical Systems · Mathematics 2018-03-16 Nancy Guelman , Cristóbal Rivas

In this paper we initiate the study of cellular automata on racks. A rack $R$ is a set with a self-distributive binary operation. The rack $R$ acts on the set $A^R$ of configurations from $R$ to a set $A$. We define the cellular automaton…

Group Theory · Mathematics 2018-08-01 Naqeeb ur Rehman , Muhammad Khuram Shahzad

For non-uniform cellular automata (NUCA) with finite memory over an arbitrary universe with multiple local transition rules, we show that pointwise nilpotency, pointwise periodicity, and pointwise eventual periodicity properties are…

Dynamical Systems · Mathematics 2022-10-04 Xuan Kien Phung

We consider a left permutive cellular automaton Phi, with no memory and positive anticipation, defined on the space of all doubly infinite sequences with entries from a finite alphabet. For each such automaton that is not one-to-one, there…

Dynamical Systems · Mathematics 2007-05-23 Ethan M. Coven , Marcus Pivato , Reem Yassawi , .

One-dimensional quantum cellular automata (QCA) consist in a line of identical, finite dimensional quantum systems. These evolve in discrete time steps according to a local, shift-invariant unitary evolution. By local we mean that no…

Quantum Physics · Physics 2008-04-15 Pablo Arrighi , Vincent Nesme , Reinhard Werner

A one-dimensional cellular automaton $\tau : A^\mathbb{Z} \to A^\mathbb{Z}$ is a transformation of the full shift defined via a finite neighborhood $S \subset \mathbb{Z}$ and a local function $\mu : A^S \to A$. We study the family of…

Cellular Automata and Lattice Gases · Physics 2026-04-22 Alonso Castillo-Ramirez , Maria G. Magaña-Chavez , Luguis de los Santos Baños

Let $\mathbb{K}$ be a finite commutative ring, and let $\mathbb{L}$ be a commutative $\mathbb{K}$-algebra. Let $A$ and $B$ be two $n \times n$-matrices over $\mathbb{L}$ that have the same characteristic polynomial. The main result of this…

Commutative Algebra · Mathematics 2020-06-09 Alberto Dennunzio , Enrico Formenti , Darij Grinberg , Luciano Margara

Let L:=Z^D be a D-dimensional lattice. Let A^L be the Cantor space of L-indexed configurations in a finite alphabet A, with the natural L-action by shifts. A `cellular automaton' is a continuous, shift-commuting self-map F:A^L-->A^L. An…

Dynamical Systems · Mathematics 2009-09-29 Marcus Pivato

In this paper we investigate the following questions. Let $\mu, \nu$ be two regular Borel measures of finite total variation. When do we have a constant $C$ satisfying $$\int f d\nu \le C \int f d\mu$$ whenever $f$ is a continuous…

Functional Analysis · Mathematics 2019-04-22 Marcell Gaál , Szilárd Gy. Révész