Skip to main content
×
Home
    • Aa
    • Aa

THE CONJUGACY PROBLEM IS SOLVABLE IN FREE-BY-CYCLIC GROUPS

  • O. BOGOPOLSKI (a1), A. MARTINO (a2), O. MASLAKOVA (a3) and E. VENTURA (a4)
Abstract

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 subgroups 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. We also solve the power conjugacy problem, and give an algorithm to recognize whether two given elements of a finitely generated free group are twisted conjugated to each other with respect to a given automorphism.

Copyright
Recommend this journal

Email your librarian or administrator to recommend adding this journal to your organisation's collection.

Bulletin of the London Mathematical Society
  • ISSN: 0024-6093
  • EISSN: 1469-2120
  • URL: /core/journals/bulletin-of-the-london-mathematical-society
Please enter your name
Please enter a valid email address
Who would you like to send this to? *
×

Metrics

Full text views

Total number of HTML views: 0
Total number of PDF views: 5 *
Loading metrics...

Abstract views

Total abstract views: 259 *
Loading metrics...

* Views captured on Cambridge Core between September 2016 - 21st October 2017. This data will be updated every 24 hours.