Related papers: A new weakly universal cellular automaton in the 3…
We examine a system of three-bosons confined to two dimensions in the presence of a perpendicular magnetic field within the framework of the adiabatic hyperspherical method. For the case of zero-range, regularized pseudo-potential…
Many dynamical systems can be naturally represented as `Bratteli-Vershik' (or `adic') systems, which provide an appealing combinatorial description of their dynamics. If an adic system X satisfies two technical conditions (`focus' and…
This paper proposes several algorithms and their Cellular Automata Machine (CAM) for drawing the State Transition Diagram (STD) of an arbitrary Cellular Automata (CA) Rule (any neighborhood, uniform/ hybrid and null/ periodic boundary) and…
We present an extension of the cell-construction method for the flat-band ferromagnetism. In a rather general setting, we construct Hubbard models with highly degenerate single-electron ground states and obtain a formal representation of…
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…
In this paper, we investigate some ergodic properties of $Z^{2}$-actions $T_{p,n}$ generated by an additive cellular automata and shift acting on the space of all doubly -infinitive sequences taking values in $Z_{m}$.
The notions of universality and completeness are central in the theories of computation and computational complexity. However, proving lower bounds and necessary conditions remains hard in most of the cases. In this article, we introduce…
Gravitational clustering of a random distribution of point masses is dominated by the effective short-range interactions due to large-scale isotropy. We introduce a one-dimensional cellular automaton to reproduce this effect in the most…
We propose a correspondence between certain multiband linear cellular automata - models of computation widely used in the description of physical phenomena - and endomorphisms of certain algebraic unipotent groups over finite fields. The…
Cellular automata on the triangular grid are here referred to as Triangular Automata (TA). This paper focuses on the simplest class of TA, called Elementary Triangular Automata (ETA). They are argued to be the two-dimensional counterpart of…
Materials with the ability to self-classify their own shape have the potential to advance a wide range of engineering applications and industries. Biological systems possess the ability not only to self-reconfigure but also to self-classify…
This paper has been withdrawn by the authors due to a mistake in the proof and a corresponding incorrect result. A correct rigorous analysis of a similar model is presented in ``Spiral Model: a cellular automaton with a discontinuous glass…
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…
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…
Cellular automata are a fundamental computational model with applications in mathematics, computer science, and physics. In this work, we explore the study of cellular automata to cases where the universe is a group, introducing the concept…
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…
Rule 22 elementary cellular automaton (ECA) has a 3--cell neighborhood, binary cell states, where a cell takes state `1' if there is exactly one neighbor, including the cell itself, in state `1'. In Boolean terms the cell-state transition…
Cellular Automata (CA) are a class of discrete dynamical systems that have been widely used to model complex systems in which the dynamics is specified at local cell-scale. Classically, CA are run on a regular lattice and with perfect…
We review and generalize the recent progress in a soliton cellular automaton known as the periodic box-ball system. It has the extended affine Weyl group symmetry and admits the commuting transfer matrix method and the Bethe ansatz at q=0.…
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…