Related papers: Some remarks on A_1^{(1)} soliton cellular automat…

An introduction to cellular automata (both deterministic and probabilistic) with examples. Definition of deterministic automata, dynamical properties, damage spreading and Lyapunov exponents; probabilistic automata and Markov processes,…

Consider $ A^* $, the free monoid generated by the finite alphabet $A$ with the concatenation operation. Two words have the same commutative image when one is a permutation of the symbols of the other. The commutative closure of a set $ L…

Three reasonable hypotheses lead to the thesis that physical phenomena can be described and simulated with cellular automata. In this work, we attempt to describe the motion of a particle upon which a constant force is applied, with a…

Generic classically integrable boundary conditions for the $A_{n}^{(1)}$ affine Toda field theories (ATFT) are investigated. The present analysis rests primarily on the underlying algebra, defined by the classical version of the reflection…

Attraction between atoms in a Bose-Einstein-Condensate renders the condensate unstable to collapse. Confinement in an atom trap, however, can stabilize the condensate for a limited number of atoms, as was observed with 7Li, but beyond this…

We present an elementary derivation of the soliton-like solutions in the $A_n^{(1)}$ Toda models which is alternative to the previously used Hirota method. The solutions of the underlying linear problem corresponding to the N-solitons are…

This note recalls the representation of regular theories T in terms of set-valued functors on models given by Makkai(1990), and explicitly states the representation theorem for the classifying topos Set[T] in terms of filtered colimit…

There are many different models--both continuous and discrete--used to describe gene mutation fixation. In particular, the Moran process, the Kimura equation and the replicator dynamics are all well known models, that might lead to…

In this article a stochastic cellular automata model is examined, which has been developed to study a "small" world, where local changes may noticeably alter global characteristics. This is applied to a climate model, where global…

This article offers a comprehensive survey of results obtained for solitons and complex nonlinear wave patterns supported by purely nonlinear lattices (NLs), which represent a spatially periodic modulation of the local strength and sign of…

Let L:=Z^D be a D-dimensional lattice. Let A^L be the Cantor space of L-indexed configurations in a finite alphabet A, with the natural L-action by shifts. A `cellular automaton' is a continuous, shift-commuting self-map F:A^L-->A^L. An…

Precipitation/dissolution reactions coupled with solute transport are modelled as a cellular automaton in which solute molecules perform a random walk on a regular lattice and react according to a local probabilistic rule. Stationary solid…

State-of-the-art review of cellular automata, cellular automata for partial differential equations, differential equations for cellular automata and pattern formation in biology and engineering.

Within a strong coupling expansion, we construct local quasi-conserved operators for a class of Hamiltonians that includes both integrable and non-integrable models. We explicitly show that at the lowest orders of perturbation theory the…

Cellular automata have recently attracted a lot of attention as testbeds to explore the emergence of many-body quantum chaos and hydrodynamics. We consider the Rule 54 model, one of the simplest interacting integrable models featuring two…

We study time-independent radially symmetric first-order solitons in a CP(2) model interacting with an Abelian gauge field whose dynamics is controlled by the usual Maxwell term. In this sense, we develop a consistent first-order framework…

Currently there is great interest in computational models consisting of underlying regular computational environments, and built on them distributed computational structures. Examples of such models are cellular automata, spatial…

Artificial organisms are computer programs that self-replicate, mutate, compete and evolve. How do these lifelike information-processing behaviours could arise in diverse far-from-equilibrium physical systems remains an open question. Here,…

Cellular automata are widely used to model natural or artificial systems. Classically they are run with perfect synchrony, i.e., the local rule is applied to each cell at each time step. A possible modification of the updating scheme…

We say that a Cellular Automata (CA) is coalescing when its execution on two distinct (random) initial configurations in the same asynchronous mode (the same cells are updated in each configuration at each time step) makes both…