Abstract
Let $F$ be a finitely generated free group. We present an algorithm such that, given a subgroup $H\leq 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.
Citation
Enric Ventura. "Computing fixed closures in free groups." Illinois J. Math. 54 (1) 175 - 186, Spring 2010. https://doi.org/10.1215/ijm/1299679744
Information
