Computing fixed closures in free groups

Details Computing fixed closures in free groups Computing fixed closures in free groups

2009-10-05

arxiv.org/abs/0910.0713v1

Mathematics

Group Theory

10 pages

Scientific paper

Let $F$ be a finitely generated free group. We present an algorithm such
that, given a subgroup $H\leqslant F$, decides whether $H$ is the fixed
subgroup of some family of automorphisms, or family of endomorphisms of $F$
and, in the affirmative case, finds such a family. The algorithm combines both
combinatorial and geometric methods.

Affiliated with

Also associated with

No associations

Rating

Computing fixed closures in free groups does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Computing fixed closures in free groups, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Computing fixed closures in free groups will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-9605