English
Related papers

Related papers: Limit Measures for Affine Cellular Automata, II

200 papers

Let L be a Lie group and Lambda a lattice in L. Suppose G is a non-compact simple Lie group realized as a Lie subgroup of L, and the image of G on L/Lambda is dense. Let c be a diagonalizable element of G not contained in a compact…

Representation Theory · Mathematics 2007-05-23 Nimish A. Shah

Lattice gas cellular automata (Lgca) are particular cellular automata that imitate the behavior of par- ticles moving on a lattice. We used a particular set of Lgca rules, called hpp, to mix bits in data blocks and obtain a symmetric…

Cryptography and Security · Computer Science 2013-06-07 Laurent Signac

We investigate the density classification task (DCT) -- determining the majority bit in a one-dimensional binary lattice -- within a quantum cellular automaton (CA) framework. While there is no one-dimensional two-state, radius $r \geq 1$,…

Quantum Physics · Physics 2025-10-09 Pedro C. S. Costa , Yuval R. Sanders , Pedro Paulo Balbi , Gavin K. Brennen

In this paper, we study a class of cellular automata (CA) called stable cellular automata (SCA) that preserve stability by reflection, modulo-recurrent, and richness. After applying these automata to Sturmian words, we determine some of…

Combinatorics · Mathematics 2026-01-14 Moussa Barro , K. Ernest Bognini , Boucaré Kientéga

We investigate one-dimensional elementary probabilistic cellular automata (PCA) whose dynamics in first-order mean-field approximation yields discrete logisticlike growth models for a single-species unstructured population with…

Statistical Mechanics · Physics 2017-05-24 J. Ricardo G. Mendonça , Yeva Gevorgyan

We introduce a new class of cellular automata to model reaction-diffusion systems in a quantitatively correct way. The construction of the CA from the reaction-diffusion equation relies on a moving average procedure to implement diffusion,…

comp-gas · Physics 2016-08-14 Jörg R. Weimar , Jean-Pierre Boon

We consider the group structure of quantum cellular automata (QCA) modulo circuits and show that it is abelian even without assuming the presence of ancillas, at least for most reasonable choices of control space; this is a corollary of a…

Quantum Physics · Physics 2022-04-21 Michael Freedman , Jeongwan Haah , Matthew B. Hastings

In addition to the $\lambda$ parameter, we have found another parameter which characterize the class III, class II and class IV patterns more quantitatively. It explains why the different classes of patterns coexist at the same $\lambda$.…

Cellular Automata and Lattice Gases · Physics 2007-05-23 Sunao Sakai , Megumi Kanno

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…

Dynamical Systems · Mathematics 2024-04-22 Jakub Byszewski , Gunther Cornelissen

Internal Diffusion Limited Aggregation is an interacting particle system that describes the growth of a random cluster governed by the boundary harmonic measure seen from an internal point. Our paper studies IDLA in $\mathbb{Z}^d$ driven by…

Probability · Mathematics 2025-10-16 Amine Asselah , Vittoria Silvestri , Lorenzo Taggi

This paper studies complexity of recognition of classes of bounded configurations by a generalization of conventional cellular automata (CA) -- finite dynamic cellular automata (FDCA). Inspired by the CA-based models of biological and…

Computational Complexity · Computer Science 2007-05-23 Maxim Makatchev

This study presents a semi-nonparametric Latent Class Choice Model (LCCM) with a flexible class membership component. The proposed model formulates the latent classes using mixture models as an alternative approach to the traditional random…

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…

Strongly Correlated Electrons · Physics 2009-11-07 Th. A. Maier , M. Jarrell

Since first introduced by John von Neumann, the notion of cellular automaton has grown into a key concept in computer science, physics and theoretical biology. In its classical setting, a cellular automaton is a transformation of the set of…

Group Theory · Mathematics 2017-01-24 Alonso Castillo-Ramirez , Maximilien Gadouleau

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…

Exactly Solvable and Integrable Systems · Physics 2026-02-20 Aoi Araoka , Tetsuji Tokihiro

We prove that the restriction of a probability measure invariant under a nonhyperbolic, ergodic and totally irreducible automorphism of a compact connected abelian group to the leaves of the central foliation is severely restricted. We also…

Dynamical Systems · Mathematics 2007-05-23 Elon Lindenstrauss , Klaus Schmidt

We propose an interacting many-body space-time-discrete Markov chain model, which is composed of an integrable deterministic and reversible cellular automaton (the rule 54 of [Bobenko et al, CMP 158, 127 (1993)]) on a finite one-dimensional…

Statistical Mechanics · Physics 2016-05-04 Tomaz Prosen , Carlos Mejia-Monasterio

A $(K,\Lambda)$ shift-modulation invariant space is a subspace of $L^2(G)$, that is invariant by translations along elements in $K$ and modulations by elements in $\Lambda$. Here $G$ is a locally compact abelian group, and $K$ and $\Lambda$…

Classical Analysis and ODEs · Mathematics 2012-06-06 Carlos Cabrelli , Victoria Paternostro

Let $\Cal S$ be an abelian group of automorphisms of a probability space $(X, {\Cal A}, \mu)$ with a finite system of generators $(A_1, ..., A_d)$. Let $A^{\el}$ denote $A_1^{\ell_1} ... A_d^{\ell_d}$, for ${\el}= (\ell_1, ..., \ell_d)$. If…

Probability · Mathematics 2014-11-14 Jean-Pierre Conze , Guy Cohen

Quantum Cellular Automaton (QCA) is a model for universal quantum computation and a natural candidate for digital quantum simulation of relativistic quantum fields. Here we introduce the first photonic platform for implementing…