The conjugacy problem in automaton groups is not solvable
classification
🧮 math.GR
keywords
conjugacyconstructedgroupsproblemself-similaralongautomatonautomorphisms
read the original abstract
(Free-abelian)-by-free, self-similar groups generated by finite self-similar sets of tree automorphisms and having unsolvable conjugacy problem are constructed. Along the way, orbit undecidable, free subgroups of GL_d(Z), for d > 5, and Aut(F_d), for d > 4, are constructed as well.
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.