No weakly factor-universal cellular automaton
Abstract
Hochman asked whether there exists a cellular automaton F such that every cellular automaton is a factor of F 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 F weakly factors onto the radius-zero q-clock automaton Cq(k), then every periodic point of F has period divisible by q. For a cellular automaton F:A Zd A Zd, define F:A A by F( a)=F(a), and let gF be the greatest common divisor of the cycle lengths of F. We prove that if Cq(k) is a weak factor of F, then q gF holds. It follows that the action of F on constant configurations yields an explicit divisibility obstruction to clock weak factors.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.