Related papers: Periodic cellular automata and Bethe ansatz
We study the dynamics of (synchronous) one-dimensional cellular automata with cyclical boundary conditions that evolve according to the majority rule with radius $ r $. We introduce a notion that we term cell stability with which we express…
The cellular automata discrete dynamical system is considered as the two-stage process: the majority rule for the change in the automata state and the rule for the change in topological relations between automata. The influence of changing…
We propose a correspondence between certain multiband linear cellular automata - models of computation widely used in the description of physical phenomena - and endomorphisms of certain algebraic unipotent groups over finite fields. The…
In this paper, the algebraic Bethe ansatz with periodic boundary conditions is used to investigate trigonometric vertex models associated with the fundamental representations of the non-exceptional Lie algebras. This formulation allow us to…
We apply a recently proposed dynamically driven renormalization group scheme to probabilistic cellular automata having one absorbing state. We have found just one unstable fixed point with one relevant direction. In the limit of small…
A new kind of cellular automaton (CA) for the study of the dynamics of urban systems is proposed. The state of a cell is not described using a finite set, but by means of continuum variables. A population sector is included, taking into…
Quantum cellular automata consist in arrays of identical finite-dimensional quantum systems, evolving in discrete-time steps by iterating a unitary operator G. Moreover the global evolution G is required to be causal (it propagates…
In this paper we study the statistical properties of a reversible cellular automaton in two out-of-equilibrium settings. In the first part we consider two instances of the initial value problem, corresponding to the inhomogeneous quench and…
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…
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.…
We extend the usual definition of cellular automaton on a group in order to deal with a new kind of cellular automata, like cellular automata in the hyperbolic plane and we explore some properties of these cellular automata. This definition…
Cellular automata are discrete dynamical systems that consist of patterns of symbols on a grid, which change according to a locally determined transition rule. In this paper, we will consider cellular automata that arise from polynomial…
We consider the case of an integrable quantum spin chain with "soliton non-peserving" boundary conditions. This is the first time that such boundary conditions have been considered in the spin chain framework. We construct the transfer…
A coarse-grained cellular automaton is proposed to simulate traffic systems. There, cells represent road sections. A cell can be in two states: jammed or passable. Numerical calculations are performed for a piece of square lattice with open…
We analyze a stochastic 5-neighbor cellular automaton with several conserved quantities, including the particle density. By examining the eigenvalue problem of the associated transition matrix, we derive an explicit formula for the…
We study cellular automata with randomly selected rules. Our setting are two-neighbor rules with a large number $n$ of states. The main quantity we analyze is the asymptotic probability, as $n \to \infty$, that the random rule has a…
We use the Bethe Ansatz technique to study dissipative systems experiencing loss. The method allows us to exactly calculate the Liouvillian spectrum. This opens the possibility of analytically calculating the dynamics of a wide range of…
We investigate subshifts with a general algebraic structure and cellular automata on them, with an emphasis on (order-theoretic) lattices. Our main results concern the characterization of Boolean algebraic subshifts, conditions for…
The transport and chemical reactions of solutes are modelled as a cellular automaton in which molecules of different species perform a random walk on a regular lattice and react according to a local probabilistic rule. The model describes…
An integrable version of the supersymmetric t-J model which is quantum group invariant as well as periodic is introduced and analysed in detail. The model is solved through the algebraic nested Bethe ansatz method.