Related papers: Level Set Structure of an Integrable Cellular Auto…
We study discrete dynamical systems through the topological concepts of limit set, which consists of all points that can be reached arbitrarily late, and asymptotic set, which consists of all adhering values of orbits. In particular, we…
We present a derivation of a formula that gives dynamics of an integrable cellular automaton associated with crystal bases. This automaton is related to type D affine Lie algebra and contains usual box-ball systems as a special case. The…
Cellular automata are discrete dynamical systems and a model of computation. The limit set of a cellular automaton consists of the configurations having an infinite sequence of preimages. It is well known that these always contain a…
We define and study a few properties of a class of random automata networks. While regular finite one-dimensional cellular automata are defined on periodic lattices, these automata networks, called randomized cellular automata, are defined…
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 set of action-angle variables for a soliton cellular automaton is obtained. It is identified with the rigged configuration, a well-known object in Bethe ansatz. Regarding it as the set of scattering data an inverse scattering method to…
We study an integrable vertex model with a periodic boundary condition associated with U_q(A_n^{(1)}) at the crystallizing point q=0. It is an (n+1)-state cellular automaton describing the factorized scattering of solitons. The dynamics…
Cellular automata are both computational and dynamical systems. We give a complete classification of the dynamic behaviour of elementary cellular automata (ECA) in terms of fundamental dynamic system notions such as sensitivity and…
The U_q(\hat{sl}_2) vertex model at q=0 with periodic boundary condition is an integrable cellular automaton in one-dimension. By the combinatorial Bethe ansatz, the initial value problem is solved for arbitrary states in terms of an…
We consider discrete dynamical systems and lattice models in statistical mechanics from the point of view of their symmetry groups. We describe a C program for symmetry analysis of discrete systems. Among other features, the program…
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.…
Cellular Automata (CA) are discrete dynamical systems and an abstract model of parallel computation. The limit set of a cellular automaton is its maximal topological attractor. A well know result, due to Kari, says that all nontrivial…
The box-ball system is an integrable cellular automaton on one dimensional lattice. It arises from either quantum or classical integrable systems by the procedures called crystallization and ultradiscretization, respectively. The double…
One-dimensional cellular automata are discrete dynamical systems that operate on an infinite lattice of sites and are characterized by the locality and uniformity of their update rule. Permutations of the state set and isometric…
A cellular automaton is a deterministic and exactly computable dynamical system which mimics certain fundamental aspects of physical dynamics such as spatial locality and finite entropy. CA systems can be constructed which have additional…
Cellular automata are a set of computational models in discrete space that have a discrete time evolution defined by neighbourhood rules. They are used to simulate many complex systems in physics and science in general. In this work,…
Cellular automata (CA) are discrete-time dynamical systems with local update rules on a lattice. Despite their elementary definition, CA support a wide spectrum of macroscopic phenomena central to statistical physics: equilibrium and…
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.…
The fixed point construction is a method for designing tile sets and cellular automata with highly nontrivial dynamical and computational properties. It produces an infinite hierarchy of systems where each layer simulates the next one. The…
We say that a finite asynchronous cellular automaton (or more generally, any sequential dynamical system) is pi-independent if its set of periodic points are independent of the order that the local functions are applied. In this case, the…