Related papers: A strongly universal cellular automaton with four …
The quantum $H_4$ integrable system is a 4D system with rational potential related to the non-crystallographic root system $H_4$ with 600-cell symmetry. It is shown that the gauge-rotated $H_4$ Hamiltonian as well as one of the integrals,…
In this article we consider semigroups of transformations of cellular automata which act on a fixed shift space. In particular, we are interested in two properties of these semigroups which relate to "largeness". The first property is ID…
Classical $(1+1)D$ cellular automata, as for instance Domany-Kinzel cellular automata, are paradigmatic systems for the study of non-equilibrium phenomena. Such systems evolve in discrete time-steps, and are thus free of time-discretisation…
We give a new example of an automata group of intermediate growth. It is generated by an automaton with 4 states on an alphabet with 8 letters. This automata group has exponential activity and its limit space is not simply connected.
Discrete dynamical systems can exhibit complex behaviour from the iterative application of straightforward local rules. A famous example are cellular automata whose global dynamics are notoriously challenging to analyze. To address this, we…
We consider dual unitary operators and their multi-leg generalizations that have appeared at various places in the literature. These objects can be related to multi-party quantum states with special entanglement patterns: the sites are…
The spatial structure, fluctuations as well as all state probabilities of self-organized (steady) states of cellular automata can be found (almost) exactly and {\em explicitly} from their Markovian dynamics. The method is shown on an…
An additive cellular automaton is a linear map on the set of infinite multidimensional arrays of elements in a finite cyclic group $\mathbb{Z}/m\mathbb{Z}$. In this paper, we consider simplices appearing in the orbits generated from…
We construct an exactly solvable Hamiltonian acting on a 3-dimensional lattice of spin-$\frac 1 2$ systems that exhibits topological quantum order. The ground state is a string-net and a membrane-net condensate. Excitations appear in the…
Let $X=S^G$ where $G$ is a countable group and $S$ is a finite set. A cellular automaton (CA) is an endomorphism $T : X \to X$ (continuous, commuting with the action of $G$). Shereshevsky (1993) proved that for $G=Z^d$ with $d>1$ no CA can…
Probabilistic cellular automata describe the dynamics of classical spin models, which, for sufficiently small temperature $T$, can serve as classical memory capable of storing information even in the presence of nonzero external magnetic…
Gauge-invariance is a fundamental concept in physics---known to provide the mathematical justification for all four fundamental forces. In this paper, we provide discrete counterparts to the main gauge theoretical concepts, directly in…
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…
We investigate the mean dimension of a cellular automaton (CA for short) with a compact non-discrete space of states. A formula for the mean dimension is established for (near) strongly permutative, permutative algebraic and unit…
We study transformations of 2-, 4- and 6-bit numbers in interactions between traveling and stationary localizations in the Spiral Rule reaction-diffusion cellular automaton. The Spiral Rule automaton is a hexagonal ternary-state…
Cellular automata (CA) have been utilized for decades as discrete models of many physical, mathematical, chemical, biological, and computing systems. The most widely known form of CA, the elementary cellular automaton (ECA), has been…
We present a new Life-like cellular automaton (CA) capable of logic universality -- the X-rule. The CA is 2D, binary, with a Moore neighborhood and $\lambda$ parameter similar to the game-of-Life, but is not based on birth/survival and is…
Cellular automata are discrete dynamical systems and a model of computation. The limit set of a cellular automaton consists of the configurations having an infinite sequence of preimages. It is well known that these always contain a…
Certain fermionic quantum field theories are equivalent to probabilistic cellular automata, with fermionic occupation numbers associated to bits. We construct an automaton that represents a discrete model of spinor gravity in four…
Cellular automata are often used to model systems in physics, social sciences, biology that are inherently asynchronous. Over the past 20 years, studies have demonstrated that the behavior of cellular automata drastically changed under…