Related papers: Some remarks on A_1^{(1)} soliton cellular automat…
A two-state, three-dimensional, deterministic, reversible cellular automaton is shown to be capable of approximately circular orbits, wavelike undulations, and particle-like configurations that decay in accordance with a half-life law.
Several cellular automata (CA) models have been developed to simulate self-organization of multiple levels of structures. However, they do not obey microscopic reversibility and conservation laws. In this paper, we describe the construction…
A cellular automaton that is a generalization of the box-ball system with either many kinds of balls or finite carrier capacity is proposed and studied through two discrete integrable systems: nonautonomous discrete KP lattice and…
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…
In this paper, linear Cellular Automta (CA) rules are recursively generated using a binary tree rooted at "0". Some mathematical results on linear as well as non-linear CA rules are derived. Integers associated with linear CA rules are…
We study charge fluctuations of a family of stochastic charged cellular automata away from the deterministic single-file limit and obtain the exact typical charge probability distributions, known to be anomalous, using hydrodynamics. The…
We propose a characteristic representation ofone-dimensional and 2-state, 3-neighbor cellular automaton rules, which describes an effective form of each rule after many time steps. Simulated results of the representation show that complex…
A family of modified Kadomtsev-Petviashvili equations (mKP) in 2+1 dimensions is studied. This family includes the integrable mKP equation when the coefficients of the nonlinear terms and the transverse dispersion term satisfy an algebraic…
The theory of cellular automata in operational probabilistic theories is developed. We start introducing the composition of infinitely many elementary systems, and then use this notion to define update rules for such infinite composite…
Cellular automata, CA for short are continuous maps defined on the set of configurations over a finite alphabet A that commutes with the shift. They are characterized by the existence of local function which determine by local behavior the…
We report the discovery of a partial conservation law obeyed by a schematic Hamiltonian of two protons and two neutrons in a j shell. In our Hamiltonian the interaction matrix element of two nucleons with combined angular momentum J is…
A cellular automaton is a parallel synchronous computing model, which consists in a juxtaposition of finite automata whose state evolves according to that of their neighbors. It induces a dynamical system on the set of configurations, i.e.…
Central to the artificial life endeavour is the creation of artificial systems spontaneously generating properties found in the living world such as autopoiesis, self-replication, evolution and open-endedness. While numerous models and…
The topological charges of the \an affine Toda solitons are considered. A general formula is presented for the number of charges associated with each soliton, as well as an expression for the charges themselves. For each soliton the charges…
We investigate conservation laws of diffusion-convection equations to construct first-order potential systems corresponding to these equations. We do two iterations of the construction procedure, looking, in the second step, for the…
Motivated by an attempt to develop a method for solving initial value problems in a class of one dimensional periodic cellular automata (CA) associated with crystal bases and soliton equations, we consider a generalization of a simple…
The methods of abstract simplicial homology and cohomology are reviewed and applied to the topology of electrical networks. Kirchhoffs laws of electrical circuits are shown to be manifestly homological in their origins. Since they are based…
A model for 1D traffic flow is developed, which is discrete in space and time. Like the cellular automaton model by Nagel and Schreckenberg [J. Phys. I France 2, 2221 (1992)], it is simple, fast, and can describe stop-and-go traffic. Due to…
Within the framework of the Inverse-Scattering formalism and the Hirota algorithm, soliton solutions of evolution equations are images of {\tau}-functions. Typically, the latter are expressed in terms of exponentials, the arguments of which…
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…