Abstract
Abstract
We prove that centralisers of elements in [finitely generated free]-by-cyclic groups are computable. As a corollary, given two conjugate elements in a [finitely generated free]-by-cyclic group, the set of conjugators can be computed and the conjugacy problem with context-free constraints is decidable. We pose several problems arising naturally from this work.
Publisher
Cambridge University Press (CUP)
Reference19 articles.
1. The algorithmic theory of polycyclic-by-finite groups
2. On a kind of Fatou property of context-free groups
3. [16] Logan, A. D. , ‘The conjugacy problem for ascending HNN-extensions of free groups’, Preprint, 2022, arXiv:2209.04357.