相关论文: Multiplicative Cellular Automata on Nilpotent Grou…

Let G be a non-abelian group and let Z(G) be the center of G. Associate a graph {\Gamma}G (called non-commuting graph of G) as follows: Take G\Z(G) as the vertices of {\Gamma}G and join x and y, whenever $xy \not= yx$. In this paper, we…

Cellular automata can show well known features of quantum mechanics, such as a linear rule according to which they evolve and which resembles a discretized version of the Schroedinger equation. This includes corresponding conservation laws.…

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…

This paper explores cellular automata (CA) constructed from Yang-Baxter maps over finite fields $F_{2^n}$. We define $R$-matrices using a map $f$ on $F_{2^n}$ and establish necessary and sufficient conditions for $f$ to satisfy the…

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…

In this paper, we study linear cellular automata (CAs) on Cayley tree of order 2 over the field $\mathbb F_p$ (the set of prime numbers modulo $p$). We construct the rule matrix corresponding to finite cellular automata on Cayley tree.…

The multiple scattering method T-matrix (MSTMM) can be used to solve the electromagnetic response of systems consisting of many compact scatterers, retaining a good level of accuracy while using relatively few degrees of freedom, largely…

Gliders in one-dimensional cellular automata are compact groups of non-quiescent and non-ether patterns (ether represents a periodic background) translating along automaton lattice. They are cellular-automaton analogous of localizations or…

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…

Properties of a given symmetry group G are very important in investigation of a physical system invariant under its action. In the case of finite spin systems (magnetic rings, some planar macromolecules) the symmetry group is isomorphic…

Let $\sigma$ denote an endomorphism of a smooth algebraic group $G$ over the algebraic closure of a finite field, and assume all iterates of $\sigma$ have finitely many fixed points. Steinberg gave a formula for the number of fixed points…

For a group $G$ and a finite set $A$, a cellular automaton is a transformation of the configuration space $A^G$ defined via a finite neighborhood and a local map. Although neighborhoods are not unique, every CA admits a unique minimal…

Cellular automata are interacting classical bits that display diverse emergent behaviors, from fractals to random-number generators to Turing-complete computation. We discover that quantum cellular automata (QCA) can exhibit complexity in…

Given a $k$-graph $\Lambda $ we construct a Markov space $M_\Lambda $, and a collection of $k$ pairwise commuting cellular automata on $M_\Lambda $, providing for a factorization of Markov's shift. Iterating these maps we obtain an action…

Motivated by possible applications to meromorphic dynamics, and generalising known properties of difference-closed fields, this paper studies the theory CCMA of compact complex manifolds with a generic automorphism. It is shown that while…

We introduce cellular automata whose cell spaces are left homogeneous spaces and prove a uniform as well as a topological variant of the Curtis-Hedlund-Lyndon theorem. Examples of left homogeneous spaces are spheres, Euclidean spaces, as…

We provide microscopic diagrammatic derivations of the the Molecular Coherent Potential Approximation (MCA) and Dynamical Cluster Approximation (DCA) and show that both are Phi-derivable. The MCA (DCA) maps the lattice onto a…

We prove that topologically isomorphic linear cellular automaton shifts are algebraically isomorphic. Using this, we show that two distinct such shifts cannot be isomorphic. We conclude that the automorphism group of a linear cellular…

We present a preliminary study of a new class of two-input cellular automata called eventually number-conserving cellular automata characterized by the property of evolving after a finite number of time steps to states whose number of…

The Microbial Fuel Cell (MFC) is a bio-electrochemical transducer converting waste products into electricity using microbial communities. Cellular Automaton (CA) is a uniform array of finite-state machines that update their states in…