Computing fixed closures in free groups
Abstract
Let F be a finitely generated free group. We present an algorithm such that, given a subgroup H≤slant F, decides whether H is the fixed subgroup of some family of automorphisms, or family of endomorphisms of F and, in the affirmative case, finds such a family. The algorithm combines both combinatorial and geometric methods.
0
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.