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

preprint2014arXivOpen access

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(α).

Explore this paper’s authors, topics and related work.

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Write a reviewWrite

No reviews yet.

Add a commentWrite

No comments yet.

Abstract