Table of Contents
Fetching ...

Further results on generalized cellular automata

Alonso Castillo-Ramirez, Luguis de los Santos Baños

TL;DR

This work generalizes cellular automata from a single group action to φ-cellular automata between configuration spaces $A^G$ and $A^H$, with emphasis on continuity and $\phi$-equivariance. It develops a robust algebraic framework: a canonical decomposition $\mathcal{T}=\phi^*\circ\tau$, a monoid structure under composition, and a criterion based on the infinite difference set $\Delta(\phi,\psi)$ for the unique homomorphism property (UHP). The paper then extends GCAs to quotient groups, establishing a commuting diagram and a monoid-homomorphism when $N$ is fully invariant, and finally studies induction and restriction, characterizing injectivity/bijectivity transfer to restricted and induced GCAs while highlighting open questions about surjectivity transfer. Overall, it broadens the toolkit for analyzing group-symmetric discrete dynamics across group extensions, quotients, and subgroup relations, via precise algebraic and topological constructions. $GCA$ theory thus connects symbolic dynamics with deeper group-theoretic properties such as Hopfianity and surjunctivity.$

Abstract

Given a finite set $A$ and a group homomorphism $φ: H \to G$, a $φ$-cellular automaton is a function $\mathcal{T} : A^G \to A^H$ that is continuous with respect to the prodiscrete topologies and $φ$-equivariant in the sense that $h \cdot \mathcal{T}(x) = \mathcal{T}( φ(h) \cdot x)$, for all $x \in A^G, h \in H$, where $\cdot$ denotes the shift actions of $G$ and $H$ on $A^G$ and $A^H$, respectively. When $G=H$ and $φ= \text{id}$, the definition of $\text{id}$-cellular automata coincides with the classical definition of cellular automata. The purpose of this paper is to expand the theory of $φ$-cellular automata by focusing on the differences and similarities with their classical counterparts. After discussing some basic results, we introduce the following definition: a $φ$-cellular automaton $\mathcal{T} : A^G \to A^H$ has the unique homomorphism property (UHP) if $\mathcal{T}$ is not $ψ$-equivariant for any group homomorphism $ψ: H \to G$, $ψ\neq φ$. We show that if the difference set $Δ(φ, ψ)$ is infinite, then $\mathcal{T}$ is not $ψ$-equivariant; it follows that when $G$ is torsion-free abelian, every non-constant $\mathcal{T}$ has the UHP. Furthermore, inspired by the theory of classical cellular automata, we study $φ$-cellular automata over quotient groups, as well as their restriction and induction to subgroups and supergroups, respectively.

Further results on generalized cellular automata

TL;DR

This work generalizes cellular automata from a single group action to φ-cellular automata between configuration spaces and , with emphasis on continuity and -equivariance. It develops a robust algebraic framework: a canonical decomposition , a monoid structure under composition, and a criterion based on the infinite difference set for the unique homomorphism property (UHP). The paper then extends GCAs to quotient groups, establishing a commuting diagram and a monoid-homomorphism when is fully invariant, and finally studies induction and restriction, characterizing injectivity/bijectivity transfer to restricted and induced GCAs while highlighting open questions about surjectivity transfer. Overall, it broadens the toolkit for analyzing group-symmetric discrete dynamics across group extensions, quotients, and subgroup relations, via precise algebraic and topological constructions. theory thus connects symbolic dynamics with deeper group-theoretic properties such as Hopfianity and surjunctivity.$

Abstract

Given a finite set and a group homomorphism , a -cellular automaton is a function that is continuous with respect to the prodiscrete topologies and -equivariant in the sense that , for all , where denotes the shift actions of and on and , respectively. When and , the definition of -cellular automata coincides with the classical definition of cellular automata. The purpose of this paper is to expand the theory of -cellular automata by focusing on the differences and similarities with their classical counterparts. After discussing some basic results, we introduce the following definition: a -cellular automaton has the unique homomorphism property (UHP) if is not -equivariant for any group homomorphism , . We show that if the difference set is infinite, then is not -equivariant; it follows that when is torsion-free abelian, every non-constant has the UHP. Furthermore, inspired by the theory of classical cellular automata, we study -cellular automata over quotient groups, as well as their restriction and induction to subgroups and supergroups, respectively.
Paper Structure (5 sections, 30 theorems, 54 equations)

This paper contains 5 sections, 30 theorems, 54 equations.

Key Result

Theorem 1

If the difference set between $\phi$ and $\psi$, defined by is infinite, then $\phi^* \circ \tau \neq \psi^* \circ \tau$ for every non-constant $\mathrm{id}$-cellular automaton $\tau : A^G \to A^G$. Hence, if $G$ is a torsion-free abelian group, then every non-constant $\phi$-cellular automaton $\mathcal{T} : A^G \to A^H$ has the UHP.

Theorems & Definitions (61)

  • Theorem 1
  • Theorem 2
  • Theorem 3
  • Lemma 1
  • Lemma 2
  • proof
  • Lemma 3
  • proof
  • Lemma 4
  • proof
  • ...and 51 more