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

preprint2014arXivOpen access

Abstract

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 which can be checked for periodic proper free factors.

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

Building this map preview

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

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.