Related papers: Limit Measures for Affine Cellular Automata
Cellular automata are discrete dynamical systems that consist of patterns of symbols on a grid, which change according to a locally determined transition rule. In this paper, we will consider cellular automata that arise from polynomial…
We provide algebraic criteria for the unitarity of linear quantum cellular automata, i.e. one dimensional quantum cellular automata. We derive these both by direct combinatorial arguments, and by adding constraints into the model which do…
The Majority (or Density Classification) Problem in Cellular Automata (CA) aims to converge a string of cells to a final homogeneous state which reflects the majority of states present in the initial configuration. The problem is…
In this paper we consider cellular automata $(\mathfrak{G},\Phi)$ with algebraic local rules and such that $\mathfrak{G}$ is a topological Markov chain which has a structure compatible to this local rule. We characterize such cellular…
Consider an infinite graph with nodes initially labeled by independent Bernoulli random variables of parameter p. We address the density classification problem, that is, we want to design a (probabilistic or deterministic) cellular…
Cellular automata are both computational and dynamical systems. We give a complete classification of the dynamic behaviour of elementary cellular automata (ECA) in terms of fundamental dynamic system notions such as sensitivity and…
The generic limit set of a cellular automaton is a topologically dened set of congurations that intends to capture the asymptotic behaviours while avoiding atypical ones. It was dened by Milnor then studied by Djenaoui and Guillon rst, and…
Let $\tau: I=[0, 1]\to [0, 1]$ be a piecewise convex map with countably infinite number of branches. In \cite{GIR}, the existence of absolutely continuous invariant measure (ACIM) $\mu$ for $\tau$ and the exactness of the system $(\tau,…
Cellular automata are dynamical systems defined on lattices and commuting with the Bernoulli shift. In this work, we focus on the spectral properties of D-dimensional cellular automata. We give a characterization of their spectrum from both…
We show that for certain classes of actions of Z^d, d >= 2, by automorphisms of the torus any measurable conjugacy has to be affine, hence measurable conjugacy implies algebraic conjugacy; similarly any measurable factor is algebraic, and…
In this paper we introduce a new quantum computation model, the linear quantum cellular automaton. Well-formedness is an essential property for any quantum computing device since it enables us to define the probability of a configuration in…
This paper generalizes the results of [13] and then provides an interesting example. We construct a family of $W$-like maps $\{W_a\}$ with a turning fixed point having slope $s_1$ on one side and $-s_2$ on the other. Each $W_a$ has an…
In this paper we study in complete generality the family of two-state, deterministic, monotone, local, homogeneous cellular automata in $\mathbb{Z}^d$ with random initial configurations. Formally, we are given a set…
We show that a wide variety of non-linear cellular automata (CAs) can be decomposed into a quasidirect product of linear ones. These CAs can be predicted by parallel circuits of depth O(log^2 t) using gates with binary inputs, or O(log t)…
We study a probabilistic cellular automaton obtained as a mixture of the additive elementary rules 60 and 102. We prove that, for any finite periodic lattice and for mixing parameter $\lambda=1/2$, the system almost surely reaches the…
We study qualitative properties of two-dimensional freezing cellular automata with a binary state set initialized on a random configuration. If the automaton is also monotone, the setting is equivalent to bootstrap percolation. We explore…
Linear quantum cellular automata were introduced recently as one of the models of quantum computing. A basic postulate of quantum mechanics imposes a strong constraint on any quantum machine: it has to be unitary, that is its time evolution…
We study two categories of cellular automata. First, for any group $G$, we consider the category $\mathcal{CA}(G)$ whose objects are configuration spaces of the form $A^G$, where $A$ is a set, and whose morphisms are cellular automata of…
The main aim of the paper is to introduce a new class of (semigroup-valued) measures that are ultrahomogeneous on the Boolean algebra of all clopen subsets of the Cantor space and to study their automorphism groups. A characterisation, in…
Suppose $G$ is a compact semisimple Lie group, $\mu$ is the normalized Haar measure on $G$, and $A, A^2 \subseteq G$ are measurable. We show that $$\mu(A^2)\geq \min\{1, 2\mu(A)+\eta\mu(A)(1-2\mu(A))\}$$ with the absolute constant $\eta>0$…