加载中…
2010-10-11
The conjugacy problem in automaton groups is not solvable
Zoran SunicEnric Ventura
文献摘要
(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.
讨论
0讲解博客
生成讲解博客的中文版本
AI智能校验
生成AI智能校验的中文版本