Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
126 tokens/sec
GPT-4o
47 tokens/sec
Gemini 2.5 Pro Pro
43 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
47 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Reduction of behavior of additive cellular automata on groups (1004.4361v1)

Published 25 Apr 2010 in nlin.CG and cs.NE

Abstract: A class of additive cellular automata (ACA) on a finite group is defined by an index-group $\m g$ and a finite field $\m F_p$ for a prime modulus $p$ \cite{Bul_arch_1}. This paper deals mainly with ACA on infinite commutative groups and direct products of them with some non commutative $p$-groups. It appears that for all abelian groups, the rules and initial states with finite supports define behaviors which being restricted to some infinite regular series of time moments become significantly simplified. In particular, for free abelian groups with $n$ generators states $V{[t]}$ of ACA with a rule $R$ at time moments $t=pk,k>k_0,$ can be viewed as $||R||$ copies of initial state $V{[0]}$ moving through an $n$-dimensional Euclidean space. That is the behavior is similar to gliders from J.Conway's automaton {\sl Life}. For some other special infinite series of time moments the automata states approximate self-similar structures and the approximation becomes better with time. An infinite class $\mathrm{DHC}(\mbf S,\theta)$ of non-commutative $p$-groups is described which in particular includes quaternion and dihedral $p$-groups. It is shown that the simplification of behaviors takes place as well for direct products of non-commutative groups from the class $\mathrm{DHC}(\mbf S,\theta)$ with commutative groups. Finally, an automaton on a non-commutative group is constructed such that its behavior at time moments $2k,k\ge2,$ is similar to a glider gun. It is concluded that ACA on non-commutative groups demonstrate more diverse variety of behaviors comparing to ACA on commutative groups.

Summary

We haven't generated a summary for this paper yet.