English
Related papers

Related papers: Irrational eigenvalues of almost expansive cellula…

200 papers

In this paper we consider invertible one-dimensional linear cellular automata (CA hereafter) defined on a finite alphabet of cardinality $p^k$, i.e. the maps $T_{f[l,r]}:\mathbb{Z}^{\mathbb{Z}}_{p^k}\to\mathbb{Z}^{\mathbb{Z}}_{p^k}$ which…

Dynamical Systems · Mathematics 2009-02-24 Hasan Akin

Two simple Cellular Automata, which mimic the Collatz-Ulam iterated map (3x+1 map), are introduced. These Cellular Automata allow to test efficiently the Collatz conjecture for very large numbers.

Cellular Automata and Lattice Gases · Physics 2007-05-23 M. Bruschi

Generalising the recent method of Andreatta, Iovita, and Pilloni for cuspidal forms, we construct an eigenvariety for symplectic and unitary groups that parametrises systems of eigenvalues of overconvergent and locally analytic $p$-adic…

Number Theory · Mathematics 2018-06-20 Riccardo Brasca , Giovanni Rosso

In this paper, we mainly study linear one-dimensional and two-dimensional elementary cellular automata that generate symmetrical spatio-temporal patterns. For spatio-temporal patterns of cellular automata from the single site seed, we…

Cellular Automata and Lattice Gases · Physics 2022-07-20 Akane Kawaharada

In this paper, following the way opened by a previous paper deposited on arXiv, we give an upper bound to the number of states for a hyperbolic cellular automaton in the pentagrid. Indeed, we prove that there is a hyperbolic cellular…

Formal Languages and Automata Theory · Computer Science 2010-06-18 Maurice Margenstern

We conduct a brief survey on Wolfram's classification, in particular related to the computing capabilities of Cellular Automata (CA) in Wolfram's classes III and IV. We formulate and shed light on the question of whether Class III systems…

Cellular Automata and Lattice Gases · Physics 2012-08-31 Genaro J. Martinez , J. C. Seck-Tuoh-Mora , Hector Zenil

We prove that if a group generated by a bireversible Mealy automaton contains an element of infinite order, its growth blows up and is necessarily exponential. As a direct consequence, no infinite virtually nilpotent group can be generated…

Formal Languages and Automata Theory · Computer Science 2017-09-05 Ines Klimann

Cellular automata have been useful artificial models for exploring how relatively simple rules combined with spatial memory can give rise to complex emergent patterns. Moreover, studying the dynamics of how rules emerge under artificial…

Cellular Automata and Lattice Gases · Physics 2014-07-11 Theodore P. Pavlic , Alyssa M. Adams , Paul C. W. Davies , Sara Imari Walker

On the one hand, we prove that almost surely, for large dimension, there is no eigenvalue of a Hermitian polynomial in independent Wigner and deterministic matrices, in any interval lying at some distance from the supports of a sequence of…

Probability · Mathematics 2017-09-20 Serban Belinschi , Mireille Capitaine

One-dimensional quantum cellular automata (QCA) consist in a line of identical, finite dimensional quantum systems. These evolve in discrete time steps according to a local, shift-invariant unitary evolution. By local we mean that no…

Quantum Physics · Physics 2008-04-15 Pablo Arrighi , Vincent Nesme , Reinhard Werner

Using FSA and the construction algorithm, we generated a list of surjective span 6 cellular automata as a modest sample for our FDense program. We wanted to experimentally quantify Mike Boyle's conjecture which states that the jointly…

Formal Languages and Automata Theory · Computer Science 2023-06-13 Hung Anh Vu , Nate Schnitzer , Ethan Ewing

Number-conserving cellular automata (NCCA) are particularly interesting, both because of their natural appearance as models of real systems, and because of the strong restrictions that number-conservation implies. Here we extend the…

Cellular Automata and Lattice Gases · Physics 2007-05-23 Andres Moreira

Based on computer simulations Wolfram presented in several papers conjectured classifications of cellular automata into 4 types. He distinguishes the 4 classes of cellular automata by the evolution of the pattern generated by applying a…

Logic · Mathematics 2016-09-07 John T. Baldwin , Saharon Shelah

We show that the automorphism group of a one-dimensional full shift (the group of reversible cellular automata) does not satisfy the Tits alternative. That is, we construct a finitely-generated subgroup which is not virtually solvable yet…

Dynamical Systems · Mathematics 2019-01-30 Ville Salo

This paper presents a classification of Cellular Automata rules based on its properties at the nth iteration. Elaborate computer program has been designed to get the nth iteration for arbitrary 1-D or 2-D CA rules. Studies indicate that the…

Gauge-invariance is a fundamental concept in physics---known to provide the mathematical justification for all four fundamental forces. In this paper, we provide discrete counterparts to the main gauge theoretical concepts, directly in…

Formal Languages and Automata Theory · Computer Science 2018-07-03 Pablo Arrighi , Giuseppe Di Molfetta , Nathanaël Eon

We study self-similarity in one-dimensional probabilistic cellular automata (PCA) using the renormalization technique. We introduce a general framework for algebraic construction of renormalization groups (RG) on cellular automata and apply…

Statistical Mechanics · Physics 2011-08-22 Erik Edlund , Martin Nilsson Jacobi

We derive bounds on the location of non-embedded eigenvalues of Dirac operators on the half-line with non-Hermitian $L^1$-potentials. The results are sharp in the non-relativistic or weak-coupling limit. In the massless case, the absence of…

Spectral Theory · Mathematics 2013-11-27 Jean-Claude Cuenin

We study a non-ergodic one-dimensional probabilistic cellular automata, where each component can assume the states $\+$ and $\-.$ We obtained the limit distribution for a set of measures on $\{\+,\-\}^\Z.$ Also, we show that for certain…

Mathematical Physics · Physics 2014-12-15 A. D. Ramos

This study focuses on an extended model of a standard cellular automaton (CA) that includes an extra index consisting of a radius that defines a perception area for each cell in addition to the radius defined by the CA rule. Extended…

Computational Complexity · Computer Science 2015-12-22 Yoshihiko Kayama