Related papers: Factorization, reduction and embedding in integrab…
How do cellular automata behave in the limit of a very large number of cells? Is there a continuum limit with simple properties? We attack this problem by mapping certain classes of automata to quantum field theories for which powerful…
Cellular automata can show well known features of quantum mechanics, such as a linear rule according to which they evolve and which resembles a discretized version of the Schroedinger equation. This includes corresponding conservation laws.…
We prove that many dynamical properties of group cellular automata (i.e., cellular automata defined on any finite group and with global rule which is an endomorphism), including surjectivity, injectivity, sensitivity to initial conditions,…
A universal map is derived for all deterministic 1D cellular automata (CA) containing no freely adjustable parameters. The map can be extended to an arbitrary number of dimensions and topologies and its invariances allow to classify all CA…
This paper studies two kinds of simulation between cellular automata: simulations based on factor and simulations based on sub-automaton. We show that these two kinds of simulation behave in two opposite ways with respect to the complexity…
We consider discrete dynamical systems and lattice models in statistical mechanics from the point of view of their symmetry groups. We describe a C program for symmetry analysis of discrete systems. Among other features, the program…
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…
In the 1980's Stallings showed that every finitely generated subgroup of a free group is canonically represented by a finite minimal immersion of a bouquet of circles. In terms of the theory of automata, this is a minimal finite inverse…
This note is a survey of examples and results about cellular automata with the purpose of recalling that there is no 'universal' way of being computationally universal. In particular, we show how some cellular automata can embed efficient…
Algorithms for embedding certain types of nilpotent subalgebras in maximal subalgebras of the same type are developed, using methods of real algebraic groups. These algorithms are applied to determine non-conjugate subalgebras of the…
We investigate a soliton cellular automaton (Box-Ball system) with periodic boundary conditions. Since the cellular automaton is a deterministic dynamical system that takes only a finite number of states, it will exhibit periodic motion. We…
Using a group-theoretic approach, a method for determining the equivalence classes (also called orbits) of the set of rules of one-dimensional cellular automata induced by the symmetry operations of reflection and permutation and their…
We study discrete dynamical systems through the topological concepts of limit set, which consists of all points that can be reached arbitrarily late, and asymptotic set, which consists of all adhering values of orbits. In particular, we…
This article introduces new tools to study self-organisation in a family of simple cellular automata which contain some particle-like objects with good collision properties (coalescence) in their time evolution. We draw an initial…
We propose a box and ball system with a periodic boundary condition (pBBS). The time evolution rule of the pBBS is represented as a Boolean recurrence formula, an inverse ultradiscretization of which is shown to be equivalent with the…
Cellular automata are a set of computational models in discrete space that have a discrete time evolution defined by neighbourhood rules. They are used to simulate many complex systems in physics and science in general. In this work,…
We employ the exact factorization of a multi-component wavefunction to analyze the dynamics of interacting photons, electrons and nuclei. We consider physical situations emerging in the regime of strong coupling between light excitations…
We present a quantum electronic embedding method derived from the exact factorization approach to calculate static properties of a many-electron system. The method is exact in principle but the practical power lies in utilizing input from a…
We classify quantum cellular automata whose cells are qubits, on hypercubic lattices $\mathbb Z^s$, with the von Neumann neighborhood scheme, in terms of realizability as finite-depth quantum circuits. We show the most general structure of…
A method for studying the qualitative dynamical properties of abstract computing machines based on the approximation of their program-size complexity using a general lossless compression algorithm is presented. It is shown that the…