arXiv Analytics

Sign in

arXiv:2107.12805 [math.GR]AbstractReferencesReviewsResources

Whitehead algorithm for automorphisms of generalized Baumslag-Solitar groups

ChloƩ Papin

Published 2021-07-27Version 1

In analogy with the free factors of a free group we define special factors of Generalized Baumslag-Solitar (GBS) groups as non-cyclic subgroups which appear in splittings over infinite cyclic groups. We give an algorithm which, given a GBS group $G$ and an element $g \in G$, decides whether there exists a special factor $H < G$ such that $g \in H$. This algorithm is analogous to an algorithm by Whitehead for free groups. Furthermore we prove that given $g \in G$ there exists a unique minimal special factor containing $g$ and give an algorithm which finds it.

Related articles: Most relevant | Search more
arXiv:1306.6035 [math.GR] (Published 2013-06-25)
Several remarks on groups of automorphisms of free groups
arXiv:0910.3192 [math.GR] (Published 2009-10-16)
Fractal trees for irreducible automorphisms of free groups
arXiv:0810.1509 [math.GR] (Published 2008-10-08, updated 2010-10-18)
The fully residually F quotients of F*<x,y>