The domino problem on groups of polynomial growth
classification
🧮 math.GR
keywords
groupsdominofinitegrowthpolynomialproblemvirtuallycharacterize
read the original abstract
We characterize the virtually nilpotent finitely generated groups (or, equivalently by Gromov's theorem, groups of polynomial growth) for which the Domino Problem is decidable: These are the virtually free groups, i.e. finite groups, and those having $\Z$ as a subgroup of finite index.
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.