Abstract
We describe an algorithm that uses Stallings' folding technique to decompose an element of Aut(Fn) as a product of Whitehead automorphisms (and hence as a product of Nielsen transformations). This algorithm is known to experts, but has not yet appeared in the literature. We use the algorithm to give an alternative method of finding a finite generating set for the subgroup of Aut(Fn) that fixes a subset Y of the basis elements, and the subgroup that fixes each element of Y up to conjugacy. We show that the intersection of this latter subgroup with I An is also finitely generated.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
