Computing centralizers in [f.g. free]-by-cyclic groups
Group Theory
2023-10-16 v1
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.
Cite
@article{arxiv.2310.08723,
title = {Computing centralizers in [f.g. free]-by-cyclic groups},
author = {André Carvalho},
journal= {arXiv preprint arXiv:2310.08723},
year = {2023}
}