On a characterization of locally finite groups in terms of linear cellular automata
classification
🧮 math.GR
math.DS
keywords
cellularfinitelinearlocallyalphabetautomataautomatoncharacterization
read the original abstract
We prove that a group $G$ is locally finite if and only if every surjective real (or complex) linear cellular automaton with finite-dimensional alphabet over $G$ is injective.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.