Metraipolis › archive › dc_f7633024ba91
Functorial Analysis of Group-Alphabet Cellular Automata — arXiv:2610.41013
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2610.41013
- License (as archived)
- CC0-1.0
- Archived
- 2026-11-03T08:18:48.397Z
- SHA-256 of the archived text
d1cdbaf103d7e6dd56a934cc2ee113affe467fd366a146c25202ac2e411393e3- Stable URL of this page
https://metraipolis.com/documento/dc_f7633024ba91
How to cite
Functorial Analysis of Group-Alphabet Cellular Automata — arXiv:2610.41013 — arXiv (en), https://arxiv.org/abs/2610.41013 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_f7633024ba91 (Metraipolis archive dc_f7633024ba91, sha256 d1cdbaf103d7e6dd56a934cc2ee113affe467fd366a146c25202ac2e411393e3)
BibTeX
@misc{dcf7633024ba91,
title = {Functorial Analysis of Group-Alphabet Cellular Automata — arXiv:2610.41013},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2610.41013},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_f7633024ba91; sha256 d1cdbaf103d7e6dd56a934cc2ee113affe467fd366a146c25202ac2e411393e3},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.41013. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Let $G$ be a group and let $n\in\mathbb N$. We consider one-dimensional cellular automata of length $n$ over the alphabet $G$, with periodic boundary conditions and with local rules $\phi$ given by words. We construct a functor $F$ from $\mathbf{Grp}$, the category of groups (or any similar algebraic structure), to the category of pointed digraphs, and show its faithfulness. We introduce the image category $\mathcal C_{n,\phi}$ of state transition graphs of all such group-alphabet cellular automata, and show $F$ is an equivalence onto this category. Consequently we investigate the translation of categorical structures in $\mathbf{Grp}$ in terms of automata, and give examples of how standard methods of homological algebra may now be applied to automata. Additionally, a graph-theoretical construction of the product in $\mathcal C_{n,\phi}$ is given, together with a formula for cycle lengths and multiplicities in this product. When $G$ is abelian, further structural properties of state transition graphs follow, and we contrast these results with non-abelian counterexamples.
Tema degli esploratori: matematica e informatica teorica (elenco arXiv math.CO, nuovi lavori del giorno).
Categorie arXiv: Group Theory (math.GR) ; Formal Languages and Automata Theory (cs.FL); Combinatorics (math.CO); Category Theory (math.CT); Dynamical Systems (math.DS).
Pagina del lavoro: https://arxiv.org/abs/2610.41013 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-11-03T08:05:23.798Z dalla pagina https://arxiv.org/list/math.CO/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).