Related papers: A Language for Particle Interactions in One-dimens…
This paper studies directional dynamics in cellular automata, a formalism previously introduced by the third author. The central idea is to study the dynamical behaviour of a cellular automaton through the conjoint action of its global rule…
We investigate the steady-state organisation of active particles residing on an interface. Particle activity induces interface deformations, while the local shape of the interface guides particle movement. We consider multiple species of…
Using Rule 126 elementary cellular automaton (ECA) we demonstrate that a chaotic discrete system --- when enriched with memory -- hence exhibits complex dynamics where such space exploits on an ample universe of periodic patterns induced…
It is common in the study of a dizzying array of soft matter systems to perform agent-based simulations of particles interacting via conservative and often short-ranged forces. In this context, well-established algorithms for efficiently…
We systematically study the boundaries of one-dimensional, 2-color cellular automata depending on 4 cells, begun from simple initial conditions. We determine the exact growth rates of the boundaries that appear to be reducible. Morphic…
The charge and potential distributions for insulating particles approaching a substrate with regular insulating structures are studied by particle-in-cell numerical simulations. An elongated particle and substrate with elongated structures…
A discrete system constituted of particles interacting by means of a centroid-based law is numerically investigated. The elements of the system move in the plane, and the range of the interaction can be varied from a more local form…
We describe a new electrostatic Particle-In-Cell (PIC) code in curvilinear geometry called Curvilinear PIC (CPIC). The code models the microscopic (kinetic) evolution of a plasma with the PIC method, coupled with an adaptive computational…
This paper studies complexity of recognition of classes of bounded configurations by a generalization of conventional cellular automata (CA) -- finite dynamic cellular automata (FDCA). Inspired by the CA-based models of biological and…
A simple relation of the order of $n$ abstract objects generates an $n-2$ dimensional basis of three dimensional vectors. A cellular automaton-like model of evolution of this system is postulated. During this evolution, some quantities…
We consider a model of the classical spinning particle in which the coadjoint orbits of the Poincare group are parametrized by two pairs of canonically conjugate four vectors, one representing the standard position and momentum variables…
Studies of quantum computer implementations suggest cellular quantum computer architectures. These architectures can simulate the evolution of quantum cellular automata, which can possibly simulate both quantum and classical physical…
A classical local cellular automaton can describe an interacting quantum field theory for fermions. We construct a simple classical automaton for a particular version of the Thirring model with imaginary coupling. This interacting fermionic…
We investigate algorithmic control of a large swarm of mobile particles (such as robots, sensors, or building material) that move in a 2D workspace using a global input signal (such as gravity or a magnetic field). We show that a maze of…
We consider random boolean cellular automata on the integer lattice, i.e., the cells are identified with the integers from 1 to $N$. The behaviour of the automaton is mainly determined by the support of the random variable that selects one…
We study a two-dimensional cellular automaton (CA), called Diffusion Rule (DR), which exhibits diffusion-like dynamics of propagating patterns. In computational experiments we discover a wide range of mobile and stationary localizations…
We report on a study of a classical, finite system of confined particles in two dimensions with a two-body repulsive interaction. We first develop a simple analytical method to obtain equilibrium configurations and energies for few…
We extend Cellular Automata to time-varying discrete geometries. In other words we formalize, and prove theorems about, the intuitive idea of a discrete manifold which evolves in time, subject to two natural constraints: the evolution does…
It is shown that for the N-neighbor and K-state cellular automata, the class II, class III and class IV patterns coexist at least in the range $\frac{1}{K} \le \lambda \le 1-\frac{1}{K} $. The mechanism which determines the difference…
The object of the present article is a 1d lattice-gas system comprised of soft-particles, wherein particles interact only if they occupy the same or a neighboring site, as a simple representation of penetrable particles of soft condensed…