Related papers: On two reversible cellular automata with two parti…
We conjecture that for a wide class of interacting particle systems evolving in discrete time, namely conservative cellular automata with piecewise linear flow diagram, relaxation to the limit set follows the same power law at critical…
We discuss a general procedure to construct an integrable real-time trotterization of interacting lattice models. As an illustrative example we consider a spin-$1/2$ chain, with continuous time dynamics described by the isotropic ($XXX$)…
Dynamical PDEs that have a spatial divergence form possess conservation laws that involve an arbitrary function of time. In one spatial dimension, such conservation laws are shown to describe the presence of an $x$-independent source/sink;…
Deterministic synchronous systems consisting of two finite automata running in opposite directions on a shared read-only input are studied with respect to their ability to perform reversible computations, which means that the automata are…
A synopsis is offered of the properties of discrete and integer-valued, hence "natural", cellular automata (CA). A particular class comprises the "Hamiltonian CA" with discrete updating rules that resemble Hamilton's equations. The…
We study a two-dimensional semi-totalistic binary cell-state cellular automaton, which imitates a reversible precipitation in an abstract chemical medium. The systems exhibits a non-trivial growth and nucleation. We demonstrate how basic…
We study spontaneous symmetry breaking in a system of spinless fermions in the Honeycomb lattice paying special emphasis to the role of an enlarged unit cell on time reversal symmetry broken phases. We use a tight binding model with nearest…
We study one-dimensional reversible and number-conserving cellular automata (RNCCA) that have both properties of reversibility and number-conservation. In the case of 2-neighbor RNCCA, Garc\'ia-Ramos proved that every RNCCA shows trivial…
A binary fluid mixture in contact with lateral particle reservoirs is considered. By imposing different particle concentrations in these reservoirs, the system can be maintained under controlled non-equilibrium conditions. Previous…
Reversible Cellular Automata (RCA) are a particular kind of shift-invariant transformations characterized by a dynamics composed only of disjoint cycles. They have many applications in the simulation of physical systems, cryptography and…
Classical Cellular Automata (CCAs) are a powerful computational framework for modeling global spatio-temporal dynamics with local interactions. While CCAs have been applied across numerous scientific fields, identifying the local rule that…
Quantum cellular automata are alternative quantum-computing paradigms to quantum Turing machines and quantum circuits. Their working mechanisms are inherently automated, therefore measurement free, and they act in a translation invariant…
This paper presents a novel approach to the description and understanding of two-dimensional binary cellular automata with the Moore neighborhood that preserve the number of active cells. Such dynamical systems are known to successfully…
While one-dimensional cellular automata have been well studied, there are relatively few results about multidimensional cellular automata; the investigation of cellular automata defined on Cayley trees constitutes an intermediate class.…
We study two-dimensional cellular automata, each cell takes three states: resting, excited and refractory. A resting cell excites if number of excited neighbours lies in a certain interval (excitation interval). An excited cell become…
We classify Hermitian tight-binding models describing noninteracting electrons on a one-dimensional periodic lattice with two energy bands. To do this, we write a generalized Rice-Mele model with two orbitals per unit cell, including all…
Local rearrangements are the elements of plastic deformation in an amorphous solid. In oscillatory shear, they can switch reversibly between two distinct configurations. While these repeating relaxations are typically considered in the…
In this paper we present an individual-based mechanical model that describes the dynamics of two contiguous cell populations with different proliferative and mechanical characteristics. An off-lattice modelling approach is considered…
Cellular automata (CA) have been found as an attractive modeling tool for various applications, such as, pattern recognition, image processing, data compression, encryption, and specially for VLSI design & test. For such applications,…
The density classification problem is one of the simplest yet non-trivial computing tasks which seem to be ideally suitable for cellular automata (CA). Unfortunately, there exists no one-dimensional two-state CA which classifies binary…