Computing centralizers in [f.g. free]-by-cyclic groups

2023/10/12 by Carvalho, André
#FOS: Mathematics #Group Theory (math.GR)

paper · doi:10.48550/arxiv.2310.08723

Abstract

We prove that centralizers of elements in [f.g. free]-by-cyclic groups are computable. As a corollary we get that, given two conjugate elements in a [f.g. free]-by-cyclic group, the set of conjugators can be computed and that the conjugacy problem with context-free constraints is decidable. In the end, we pose several problems arising naturally from this work.

Related

• Free-by-cyclic groups have solvable conjugacy problem
• Note on the conjugacy classes of elements and their centralizers for the free product of two groups
• Conjugacy classes and centralisers in wreath products
• Computation of Centralizers in Braid groups and Garside Groups
• On the conjugacy problem for cyclic extensions of free groups