相关论文: Limit Measures for Affine Cellular Automata, II

A cellular automaton named Rule 184++C is proposed as a meta-model to investigate the flow of various complex particles. In this model, unlike the granular pipe flow and the traffic flow, not only the free-jam phase transition but also the…

We present a class of random cellular automata with multiple invariant measures which are all non-Gibbsian. The automata have configuration space {0,1}^{Z^d}, with d > 1, and they are noisy versions of automata with the "eroder property".…

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…

For a group $G$ and a finite set $A$, a cellular automaton (CA) is a transformation $\tau : A^G \to A^G$ defined via a finite memory set $S \subseteq G$ and a local map $\mu : A^S \to A$. Although memory sets are not unique, every CA admits…

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…

Let Gamma be a lattice in a simply-connected solvable Lie group. We construct a Q-defined algebraic group A such that the abstract commensurator of Gamma is isomorphic to A(Q) and Aut(Gamma) is commensurable with A(Z). Our proof uses the…

We study uniform and non-uniform model sets in arbitrary locally compact second countable (lcsc) groups, which provide a natural generalization of uniform model sets in locally compact abelian groups as defined by Meyer and used as…

We consider the typical asymptotic behaviour of cellular automata of higher dimension (greater than 2). That is, we take an initial configuration at random according to a Bernoulli (i.i.d) probability measure, iterate some cellular…

We discuss the action principle and resulting Hamiltonian equations of motion for a class of integer-valued cellular automata introduced recently [1]. Employing sampling theory, these deterministic finite-difference equations are mapped…

Cellular automata (CA) are dynamical systems defined by a finite local rule but they are studied for their global dynamics. They can exhibit a wide range of complex behaviours and a celebrated result is the existence of (intrinsically)…

Cellular automata (CAs) are fully-discrete dynamical models that have received much attention due to the fact that their relatively simple setup can nonetheless express highly complex phenomena. Despite the model's theoretical maturity and…

The cellular automaton (CA) pulsing model (arXiv:1806.06416) described the surprising phenomenon of spontaneous, sustained and robust rhythmic oscillations, pulsing dynamics, when random wiring is applied to a 2D `glider' rule running in a…

We define a new version of $\mathbb A^1$-homology, called cellular $\mathbb A^1$-homology, for smooth schemes over a field that admit an increasing filtration by open subschemes with cohomologically trivial closed strata. We provide several…

We show that a cellular automaton on a one-dimensional two-sided mixing subshift of finite type is a von Neumann regular element in the semigroup of cellular automata if and only if it is split epic onto its image in the category of sofic…

Let $G$ be a group and let $X$ be an algebraic variety over an algebraically closed field $k$ of characteristic zero. Denote $A=X(k)$ the set of rational points of $X$. We investigate invertible algebraic cellular automata $\tau \colon A^G…

Let $X$ be a countable discrete Abelian group containing no elements of order 2, $\alpha$ be an automorphism of $X$, $\xi_1$ and $\xi_2$ be independent random variables with values in the group $X$ and distributions $\mu_1$ and $\mu_2$. The…

Cellular automata, CA for short are continuous maps defined on the set of configurations over a finite alphabet A that commutes with the shift. They are characterized by the existence of local function which determine by local behavior the…

For linear non-uniform cellular automata (NUCA) which are local perturbations of linear CA over a group universe $G$ and a finite-dimensional vector space alphabet $V$ over an arbitrary field $k$, we investigate their Dedekind finiteness…

Let $d > 1$, and let $(X,\alpha)$ and $(Y,\beta)$ be two zero-entropy ${\mathbb{Z}}^d$-actions on compact abelian groups by $d$ commuting automorphisms. We show that if all lower rank subactions of $\alpha$ and $\beta$ have completely…

We show that if $A$ is a simple (not necessarily unital) tracially $\mathcal{Z}$-absorbing C*-algebra and $\alpha \colon G \to \mathrm{Aut} (A)$ is an action of a finite group $G$ on $A$ with the weak tracial Rokhlin property, then the…