An algorithm to detect full irreducibility by bounding the volume of periodic free factors

@article{Clay2014AnAT,
  title={An algorithm to detect full irreducibility by bounding the volume of periodic free factors},
  author={Matt Clay and Johanna Mangahas and Alexandra Pettet},
  journal={Michigan Mathematical Journal},
  year={2014},
  volume={64},
  pages={279-292}
}
We provide an effective algorithm for determining whether an element φ of the outer automorphism group of a free group is fully irreducible. Our method produces a finite list that can be checked for periodic proper free factors. 

Patterson-Sullivan currents, generic stretching factors and the asymmetric Lipschitz metric for Outer space

We quantitatively relate the Patterson-Sullivant currents and generic stretching factors for free group automorphisms to the asymmetric Lipschitz metric on Outer space and to Guirardel's intersection

Algorithmic constructions of relative train track maps and CTs

Every rotationless outer automorphism of a finite rank free group is represented by a particularly useful relative train track map called a CT. The main result of this paper is that the constructions

Effective Algebraic Detection of the Nielsen–Thurston Classification of Mapping Classes

In this paper, we propose two algorithms for determining the Nielsen–Thurston classification of a mapping class ψ on a surface S. We start with a finite generating set X for the mapping class group

Detecting Fully Irreducible Automorphisms: A Polynomial Time Algorithm

This article produces an algorithm, for any fixed N ⩾ 3, an algorithm which, given a topological representative f of an element ϕ of , decides in polynomial time in terms of the “size” of f, whether or not ϕ is fully irreducible.

References

SHOWING 1-10 OF 35 REFERENCES

Automorphisms of Free Groups and Outer Space

This is a survey of recent results in the theory of automorphism groups of finitely-generated free groups, concentrating on results obtained by studying actions of these groups on Outer space and its

Growth of intersection numbers for free group automorphisms

For a fully irreducible automorphism ϕ of the free group Fk we compute the asymptotics of the intersection number n ↦ i(T, T′ϕn) for the trees T and T′ in Outer space. We also obtain qualitative

Algorithmic detectability of iwip automorphisms

We produce an algorithm that, given φ∈Out(FN) , where N⩾2 , decides whether or not φ is an irreducible with irreducible powers (‘fully irreducible’) automorphism.

Laminations, trees, and irreducible automorphisms of free groups

Abstract. We examine the action of Out(Fn) on the set of (irreducible) laminations. Consequences include a special case of the Tits alternative for Out(Fn), the discreteness of certain naturally

Fast Nielsen–Thurston classification of braids

We prove the existence of an algorithm which solves the reducibility problem in braid groups and runs in quadratic time with respect to the braid length for any fixed braid index.

The expansion factors of an outer automorphism and its inverse

A fully irreducible outer automorphism o of the free group F n of rank n has an expansion factor which often differs from the expansion factor of o -1 Nevertheless, we prove that the ratio between

Pseudo-Anosov Maps and Invariant Train Tracks in the Disc: A Finite Algorithm

  • J. Los
  • Mathematics, Computer Science
  • 1993
A finite algorithm is constructed which enables one to decide whether the class [f] contains a pseudo-Anosov element, which gives the minimal topological entropy of the isotropy class.

An algorithm for deciding reducibility

It is shown that a reducible mapping class fixes a maximal multicurve whose size is at most exponential in the word length, and deduce that determining if a mapping class is reducible is a problem in NP.

Strongly Contracting Geodesics in Outer Space

We study the Lipschitz metric on Outer Space and prove that fully irreducible elements of Out(F_n) act by hyperbolic isometries with axes which are strongly contracting. As a corollary, we prove that

Effective Algebraic Detection of the Nielsen–Thurston Classification of Mapping Classes

In this paper, we propose two algorithms for determining the Nielsen–Thurston classification of a mapping class ψ on a surface S. We start with a finite generating set X for the mapping class group