paper

An efficient algorithm for finding a basis of the fixed point subgroup of an automorphism of a free group

arXiv:1204.6728

Abstract

We prove that for any automorphism of a free group F of finite rank, one can efficiently compute a basis of the fixed point subgroup Fix(α).

68 pages, 23 figures. Added: Splitting Lemma in Section 11, and an algorithm for finding of normal verices in Section 7