Tuesday, October 13th, 15:30, CRM Small Room
Speaker: Enric Ventura (UPC)
Title: 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 in 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.
