Whitehead algorithm for automorphisms of generalized Baumslag-Solitar groups
Abstract
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 ∈ G, decides whether there exists a special factor H < G such that g ∈ H. This algorithm is analogous to an algorithm by Whitehead for free groups. Furthermore we prove that given g ∈ G there exists a unique minimal special factor containing g and give an algorithm which finds it.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.