(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, finitely generated, orbit undecidable, free subgroups of GLd(Z), for d⩾6, and Aut(Fd), for d⩾5, are constructed as well.
CitationŠunic, Z.; Ventura, E. The conjugacy problem in automaton groups is not solvable. "Journal of algebra", 15 Agost 2012, vol. 364, p. 148-154.
All rights reserved. This work is protected by the corresponding intellectual and industrial property rights. Without prejudice to any existing legal exemptions, reproduction, distribution, public communication or transformation of this work are prohibited without permission of the copyright holder. If you wish to make any use of the work not provided for in the law, please contact: email@example.com