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

Matt Clay; Johanna Mangahas; Alexandra Pettet

doi:10.1307/mmj/1434731924

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

Matt Clay
, Johanna Mangahas
, Alexandra Pettet

Mathematics

University of Arkansas, Fayetteville
University of British Columbia

Research output: Contribution to journal › Article › peer-review

3 Scopus citations

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

Original language	English
Pages (from-to)	279-292
Number of pages	14
Journal	Michigan Mathematical Journal
Volume	64
Issue number	2
DOIs	https://doi.org/10.1307/mmj/1434731924
State	Published - Jun 1 2015

Access to Document

10.1307/mmj/1434731924

Cite this

@article{d3136b963c2d4d5f9309aabf1cc42de1,

title = "An algorithm to detect full irreducibility by bounding the volume of periodic free factors",

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

author = "Matt Clay and Johanna Mangahas and Alexandra Pettet",

year = "2015",

month = jun,

day = "1",

doi = "10.1307/mmj/1434731924",

language = "English",

volume = "64",

pages = "279--292",

journal = "Michigan Mathematical Journal",

issn = "0026-2285",

publisher = "University of Michigan",

number = "2",

}

TY - JOUR

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

AU - Clay, Matt

AU - Mangahas, Johanna

AU - Pettet, Alexandra

PY - 2015/6/1

Y1 - 2015/6/1

N2 - 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.

AB - 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.

UR - https://www.scopus.com/pages/publications/84933041678

U2 - 10.1307/mmj/1434731924

DO - 10.1307/mmj/1434731924

M3 - Article

AN - SCOPUS:84933041678

SN - 0026-2285

VL - 64

SP - 279

EP - 292

JO - Michigan Mathematical Journal

JF - Michigan Mathematical Journal

IS - 2

ER -

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

Abstract

Access to Document

Other files and links

Fingerprint

Cite this