7,153 research outputs found

    A Max-Plus Model of Asynchronous Cellular Automata

    Full text link
    This paper presents a new framework for asynchrony. This has its origins in our attempts to better harness the internal decision making process of cellular automata (CA). Thus, we show that a max-plus algebraic model of asynchrony arises naturally from the CA requirement that a cell receives the state of each neighbour before updating. The significant result is the existence of a bijective mapping between the asynchronous system and the synchronous system classically used to update cellular automata. Consequently, although the CA outputs look qualitatively different, when surveyed on "contours" of real time, the asynchronous CA replicates the synchronous CA. Moreover, this type of asynchrony is simple - it is characterised by the underlying network structure of the cells, and long-term behaviour is deterministic and periodic due to the linearity of max-plus algebra. The findings lead us to proffer max-plus algebra as: (i) a more accurate and efficient underlying timing mechanism for models of patterns seen in nature, and (ii) a foundation for promising extensions and applications.Comment: in Complex Systems (Complex Systems Publications Inc), Volume 23, Issue 4, 201

    Dynamical Algebraic Combinatorics, Asynchronous Cellular Automata, and Toggling Independent Sets

    Get PDF
    Though iterated maps and dynamical systems are not new to combinatorics, they have enjoyed a renewed prominence over the past decade through the elevation of the subfield that has become known as dynamical algebraic combinatorics. Some of the problems that have gained popularity can also be cast and analyzed as finite asynchronous cellular automata (CA). However, these two fields are fairly separate, and while there are some individuals who work in both, that is the exception rather than the norm. In this article, we will describe our ongoing work on toggling independent sets on graphs. This will be preceded by an overview of how this project arose from new combinatorial problems involving homomesy, toggling, and resonance. Though the techniques that we explore are directly applicable to ECA rule 1, many of them can be generalized to other cellular automata. Moreover, some of the ideas that we borrow from cellular automata can be adapted to problems in dynamical algebraic combinatorics. It is our hope that this article will inspire new problems in both fields and connections between them

    Right-Permutative Cellular Automata on Topological Markov Chains

    Full text link
    In this paper we consider cellular automata (G,Φ)(\mathfrak{G},\Phi) with algebraic local rules and such that G\mathfrak{G} is a topological Markov chain which has a structure compatible to this local rule. We characterize such cellular automata and study the convergence of the Ces\`aro mean distribution of the iterates of any probability measure with complete connections and summable decay.Comment: 16 pages, 2 figure. A new version with improved redaction of Theorem 6.3(i)) to clearify its consequence

    On injective endomorphisms of symbolic schemes

    Full text link
    Building on the seminal work of Gromov on endomorphisms of symbolic algebraic varieties [10], we introduce a notion of cellular automata over schemes which generalize affine algebraic cellular automata in [7]. We extend known results to this more general setting. We also establish several new ones regarding the closed image property, surjunctivity, reversibility, and invertibility for cellular automata over algebraic varieties with coefficients in an algebraically closed field. As a byproduct, we obtain a negative answer to a question raised in [7] on the existence of a bijective complex affine algebraic cellular automaton τ ⁣:AZAZ\tau \colon A^{\mathbb Z} \to A^{\mathbb Z} whose inverse is not algebraic

    Exploring the concept of interaction computing through the discrete algebraic analysis of the Belousov–Zhabotinsky reaction

    Get PDF
    Interaction computing (IC) aims to map the properties of integrable low-dimensional non-linear dynamical systems to the discrete domain of finite-state automata in an attempt to reproduce in software the self-organizing and dynamically stable properties of sub-cellular biochemical systems. As the work reported in this paper is still at the early stages of theory development it focuses on the analysis of a particularly simple chemical oscillator, the Belousov-Zhabotinsky (BZ) reaction. After retracing the rationale for IC developed over the past several years from the physical, biological, mathematical, and computer science points of view, the paper presents an elementary discussion of the Krohn-Rhodes decomposition of finite-state automata, including the holonomy decomposition of a simple automaton, and of its interpretation as an abstract positional number system. The method is then applied to the analysis of the algebraic properties of discrete finite-state automata derived from a simplified Petri net model of the BZ reaction. In the simplest possible and symmetrical case the corresponding automaton is, not surprisingly, found to contain exclusively cyclic groups. In a second, asymmetrical case, the decomposition is much more complex and includes five different simple non-abelian groups whose potential relevance arises from their ability to encode functionally complete algebras. The possible computational relevance of these findings is discussed and possible conclusions are drawn

    On algebraic cellular automata

    Full text link
    We investigate some general properties of algebraic cellular automata, i.e., cellular automata over groups whose alphabets are affine algebraic sets and which are locally defined by regular maps. When the ground field is assumed to be uncountable and algebraically closed, we prove that such cellular automata always have a closed image with respect to the prodiscrete topology on the space of configurations and that they are reversible as soon as they are bijective
    corecore