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

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

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…