English

No weakly factor-universal cellular automaton

Dynamical Systems 2026-03-26 v1 Formal Languages and Automata Theory

Abstract

Hochman asked whether there exists a cellular automaton FF such that every cellular automaton is a factor of FF in the dynamical sense. In particular, we do not require the factor map to commute with the spatial shifts. We show that no such cellular automaton exists. More generally, if FF weakly factors onto the radius-zero qq-clock automaton Cq(k)C_q^{(k)}, then every periodic point of FF has period divisible by qq. For a cellular automaton F:AZdAZdF:A^{\mathbb Z^d}\to A^{\mathbb Z^d}, define φF:AA\varphi_F:A\to A by F(a)=φF(a)F(\underline a)=\underline{\varphi_F(a)}, and let gFg_F be the greatest common divisor of the cycle lengths of φF\varphi_F. We prove that if Cq(k)C_q^{(k)} is a weak factor of FF, then qgFq\mid g_F holds. It follows that the action of FF on constant configurations yields an explicit divisibility obstruction to clock weak factors.

Cite

@article{arxiv.2603.23570,
  title  = {No weakly factor-universal cellular automaton},
  author = {Maja Gwozdz},
  journal= {arXiv preprint arXiv:2603.23570},
  year   = {2026}
}
R2 v1 2026-07-01T11:36:04.489Z