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 such that every cellular automaton is a factor of 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 weakly factors onto the radius-zero -clock automaton , then every periodic point of has period divisible by . For a cellular automaton , define by , and let be the greatest common divisor of the cycle lengths of . We prove that if is a weak factor of , then holds. It follows that the action of 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}
}