Carregant...
Carregant...

Vés al contingut (premeu Retorn)

The conjugacy problem for free-by-cyclic groups

Autor
Martino, A.; Ventura, E.
Tipus d'activitat
Document cientificotècnic
Data
2004-04
Codi
CMR Centre de Recerca Matemàtica - Preprint núm. 574
Repositori
http://hdl.handle.net/2117/79985 Obrir en finestra nova
URL
http://www.crm.cat/en/Publications/Publications/2004/Preprints/pr574.pdf Obrir en finestra nova
Resum
We show that the conjugacy problem is solvable in [finitely generated free]-by-cyclic groups, by using a result of O. Maslakova that one can algorithmically find generating sets for the fixed sub- groups of free group automorphisms, and one of P. Brinkmann that one can determine whether two cyclic words in a free group are mapped to each other by some power of a given automorphism. The algorithm effectively computes a conjugating element, if it exists. We also solve the power conjugacy problem ...
Citació
Martino, A., Ventura, E. "The conjugacy problem for free-by-cyclic groups". 2004.
Grup de recerca
MD - Matemàtica Discreta

Participants

Arxius