2024-03-28T19:47:58Zhttps://upcommons.upc.edu/oai/requestoai:upcommons.upc.edu:2117/799852020-07-23T21:29:22Zcom_2117_15797com_2117_28577com_2117_3917com_2117_28579com_2117_3546com_2117_28581col_2117_3055col_2117_3919col_2117_79986openAccess
The conjugacy problem for free-by-cyclic groups
Martino, Armando
Ventura Capell, Enric
Universitat Politècnica de Catalunya. Departament de Matemàtiques
Universitat Politècnica de Catalunya. MD - Matemàtica Discreta
Àrees temàtiques de la UPC::Matemàtiques i estadística::Àlgebra
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 and give an algorithm to rec-
ognize if two given elements of a finitely generated free group are
Reidemeister equivalent with respect to a given automorphism.
External research report
Martino, A., Ventura, E. "The conjugacy problem for free-by-cyclic groups". 2004.
http://hdl.handle.net/2117/79985
eng
CRM
http://creativecommons.org/licenses/by-nc-nd/3.0/es/
Open Access
http://hdl.handle.net/2117/79985
http://hdl.handle.net/2117/79985
2004-04