An efficient algorithm for finding a basis of the fixed point subgroup of an automorphism of a free group
Group Theory
2014-01-16 v6
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(\alpha).
Keywords
Cite
@article{arxiv.1204.6728,
title = {An efficient algorithm for finding a basis of the fixed point subgroup of an automorphism of a free group},
author = {Oleg Bogopolski and Olga Maslakova},
journal= {arXiv preprint arXiv:1204.6728},
year = {2014}
}
Comments
68 pages, 23 figures. Added: Splitting Lemma in Section 11, and an algorithm for finding of normal verices in Section 7