On a characterization of locally finite groups in terms of linear cellular automata
Tullio Ceccherini-Silberstein, Michel Coornaert

TL;DR
This paper characterizes locally finite groups by showing that for such groups, every surjective linear cellular automaton with finite-dimensional alphabet is also injective, establishing a precise algebraic-automaton correspondence.
Contribution
It provides a new characterization of locally finite groups through the properties of linear cellular automata, linking group theory and automata theory.
Findings
Surjective linear cellular automata over locally finite groups are injective.
The characterization holds for automata over real or complex finite-dimensional alphabets.
Provides a necessary and sufficient condition for local finiteness in terms of cellular automata.
Abstract
We prove that a group is locally finite if and only if every surjective real (or complex) linear cellular automaton with finite-dimensional alphabet over is injective.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCellular Automata and Applications · Advanced Operator Algebra Research · Digital Image Processing Techniques
