Carregant...
Carregant...

Vés al contingut (premeu Retorn)

The conjugacy problem in automaton groups is not solvable

Autor
Šunic, Z.; Ventura, E.
Tipus d'activitat
Article en revista
Revista
Journal of algebra
Data de publicació
2012-08-15
Volum
364
Pàgina inicial
148
Pàgina final
154
DOI
https://doi.org/10.1016/j.jalgebra.2012.04.014 Obrir en finestra nova
Repositori
http://hdl.handle.net/2117/16507 Obrir en finestra nova
Resum
(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.
Citació
Šunic, Z.; Ventura, E. The conjugacy problem in automaton groups is not solvable. "Journal of algebra", 15 Agost 2012, vol. 364, p. 148-154.
Paraules clau
(Free abelian)-by-free groups, Automaton groups, Conjugacy problem, Orbit decidability
Grup de recerca
GAPCOMB - Geometric, Algebraic and Probabilistic Combinatorics

Participants

Arxius