Algorithmic detectability of iwip automorphisms

Ilya Kapovich

doi:10.1112/blms/bdt093

Algorithmic detectability of iwip automorphisms

Ilya Kapovich

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

Abstract

We produce an algorithm that, given, φ ∈ out(F_N), where N ≥ 2 decides whether or not φ is an irreducible with irreducible powers ('fully irreducible') automorphism.

Original language	English (US)
Pages (from-to)	279-290
Number of pages	12
Journal	Bulletin of the London Mathematical Society
Volume	46
Issue number	2
DOIs	https://doi.org/10.1112/blms/bdt093
State	Published - Apr 2014
Externally published	Yes

ASJC Scopus subject areas

Mathematics(all)

Online availability

10.1112/blms/bdt093

Library availability

Discover UIUC Full Text

Cite this

@article{a18df134a08e45e2a0afa5220641384a,

title = "Algorithmic detectability of iwip automorphisms",

abstract = "We produce an algorithm that, given, φ ∈ out(FN), where N ≥ 2 decides whether or not φ is an irreducible with irreducible powers ('fully irreducible') automorphism.",

author = "Ilya Kapovich",

note = "Funding Information: Received 19 September 2012; revised 6 December 2012; published online 9 January 2014. 2010 Mathematics Subject Classification 20F65 (primary), 57M, 37B, 37D (secondary). The author was partially supported by the NSF grant DMS-0904200.",

year = "2014",

month = apr,

doi = "10.1112/blms/bdt093",

language = "English (US)",

volume = "46",

pages = "279--290",

journal = "Bulletin of the London Mathematical Society",

issn = "0024-6093",

publisher = "Oxford University Press",

number = "2",

}

TY - JOUR

T1 - Algorithmic detectability of iwip automorphisms

AU - Kapovich, Ilya

N1 - Funding Information: Received 19 September 2012; revised 6 December 2012; published online 9 January 2014. 2010 Mathematics Subject Classification 20F65 (primary), 57M, 37B, 37D (secondary). The author was partially supported by the NSF grant DMS-0904200.

PY - 2014/4

Y1 - 2014/4

N2 - We produce an algorithm that, given, φ ∈ out(FN), where N ≥ 2 decides whether or not φ is an irreducible with irreducible powers ('fully irreducible') automorphism.

AB - We produce an algorithm that, given, φ ∈ out(FN), where N ≥ 2 decides whether or not φ is an irreducible with irreducible powers ('fully irreducible') automorphism.

UR - http://www.scopus.com/inward/record.url?scp=84896982155&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84896982155&partnerID=8YFLogxK

U2 - 10.1112/blms/bdt093

DO - 10.1112/blms/bdt093

M3 - Article

AN - SCOPUS:84896982155

SN - 0024-6093

VL - 46

SP - 279

EP - 290

JO - Bulletin of the London Mathematical Society

JF - Bulletin of the London Mathematical Society

IS - 2

ER -

Algorithmic detectability of iwip automorphisms

Abstract

ASJC Scopus subject areas

Online availability

Library availability

Related links

Cite this