The conjugacy problem in automaton groups is not solvable
Group Theory
2012-05-14 v3
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.
Cite
@article{arxiv.1010.1993,
title = {The conjugacy problem in automaton groups is not solvable},
author = {Zoran Sunic and Enric Ventura},
journal= {arXiv preprint arXiv:1010.1993},
year = {2012}
}