arXiv Analytics

Sign in

arXiv:1012.3267 [math.GR]AbstractReferencesReviewsResources

Explicit computation of the index of a positive outer automorphism of the free group

Yann Jullian

Published 2010-12-15, updated 2012-02-28Version 2

We give an algorithm for finding the index of a positive outer automorphism of the free group, and prove the algorithm exits in a finite time.

Comments: 31 pages, 2 figures. v2: small error in steps (3.1.3) and (3.1.4) of the algorithm corrected. Paragraph and examples added in section 3.2.1
Categories: math.GR, math.DS
Subjects: 20E05, 20D45, 37B10, 20F65, 20E08
Related articles: Most relevant | Search more
arXiv:0910.3192 [math.GR] (Published 2009-10-16)
Fractal trees for irreducible automorphisms of free groups
arXiv:math/0601231 [math.GR] (Published 2006-01-10, updated 2006-03-10)
On a free group of transformations defined by an automaton
arXiv:1212.6749 [math.GR] (Published 2012-12-30, updated 2015-02-05)
Bounding the gap between a free group (outer) automorphism and its inverse

Links

Toolbox