Show simple item record

dc.contributor.authorMartino, Armando
dc.contributor.authorVentura Capell, Enric
dc.contributor.otherUniversitat Politècnica de Catalunya. Departament de Matemàtiques
dc.date.accessioned2015-11-26T18:18:08Z
dc.date.available2015-11-26T18:18:08Z
dc.date.issued2004-04
dc.identifier.citationMartino, A., Ventura, E. "The conjugacy problem for free-by-cyclic groups". 2004.
dc.identifier.urihttp://hdl.handle.net/2117/79985
dc.description.abstractWe 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.
dc.format.extent8 p.
dc.language.isoeng
dc.rights.urihttp://creativecommons.org/licenses/by-nc-nd/3.0/es/
dc.subjectÀrees temàtiques de la UPC::Matemàtiques i estadística::Àlgebra
dc.subject.lcshFree groups
dc.subject.lcshGroup theory
dc.titleThe conjugacy problem for free-by-cyclic groups
dc.typeExternal research report
dc.subject.lemacGrups, Teoria de
dc.contributor.groupUniversitat Politècnica de Catalunya. MD - Matemàtica Discreta
dc.relation.publisherversionCRM
dc.rights.accessOpen Access
local.identifier.drac17255664
dc.description.versionPreprint
local.citation.authorMartino, A.; Ventura, E.


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record