跳到正文
研踪PaperTrail
← 研踪 PaperTrail

arXiv:2611.22365 · v1

Strong Transitivity of Group Cellular Automata: Characterization and Decidability

首次提交 2026-11-17 16:20
版本更新 2026-11-17 16:20
雷达观测 2026-11-18 19:42
arXiv ↗PDF ↗

摘要

A discrete-time dynamical system is strongly transitive if every point can be reached, in finitely many steps, from every non-empty open set. We study this property for group cellular automata, \ie cellular automata over a finite group alphabet whose global map is a group endomorphism, in every dimension d≥1d\geq1. We prove that no group cellular automaton over a non-abelian group is strongly transitive, and we develop a decomposition of group cellular automata over abelian groups, via quotients by power subgroups, which preserves strong transitivity. For linear cellular automata over (Z/pZ)n(\mathbb Z/p\mathbb Z)^n we use Pontryagin duality to characterize strong transitivity in terms of the characteristic polynomial χAχ_A of the associated matrix AA of Laurent polynomials: the automaton is strongly transitive if and only if det⁡(A)≠0\det(A)\neq0 and no irreducible factor of χAχ_A has an invertible constant term. Combining these results, we obtain that strong transitivity is decidable for group cellular automata in every dimension. For every fixed dimension dd, we give an explicit decision procedure whose running time is polynomial in the group size NN, the number kk of neighbours, and the neighbourhood radius ϱ\varrho.

AI 论文解读

基于摘要 · 非全文审阅

此版本尚未生成 AI 解读。解读由后台任务生成并按论文版本保存,登录后共享已有结果。

版本差异

目前只收录了一个版本。收录下一版后,可以对照标题、作者、分类和摘要。

观测到的版本

相邻记录可能跳过中间版本;首次发现 v2 及以上也会标为版本更新。

v1 · 2026-11-17 16:20 · 最新观测版本

Strong Transitivity of Group Cellular Automata: Characterization and Decidability

A discrete-time dynamical system is strongly transitive if every point can be reached, in finitely many steps, from every non-empty open set. We study this property for group cellular automata, \ie cellular automata over a finite group alphabet whose global map is a group endomorphism, in every dimension d≥1d\geq1. We prove that no group cellular automaton over a non-abelian group is strongly transitive, and we develop a decomposition of group cellular automata over abelian groups, via quotients by power subgroups, which preserves strong transitivity. For linear cellular automata over (Z/pZ)n(\mathbb Z/p\mathbb Z)^n we use Pontryagin duality to characterize strong transitivity in terms of the characteristic polynomial χAχ_A of the associated matrix AA of Laurent polynomials: the automaton is strongly transitive if and only if det⁡(A)≠0\det(A)\neq0 and no irreducible factor of χAχ_A has an invertible constant term. Combining these results, we obtain that strong transitivity is decidable for group cellular automata in every dimension. For every fixed dimension dd, we give an explicit decision procedure whose running time is polynomial in the group size NN, the number kk of neighbours, and the neighbourhood radius ϱ\varrho.

查看此版本解读 →查看此版本原文 ↗