2013
DOI: 10.48550/arxiv.1302.2378
|View full text |Cite
Preprint
|
Sign up to set email alerts
|

Subgroup decomposition in Out(F_n), Part I: Geometric Models

Michael Handel,
Lee Mosher

Abstract: This is the first in a series of four papers, announced in [HM13a], that together develop a decomposition theory for subgroups of Out(F n ).In this paper we develop further the theory of geometric EG strata of relative train track maps originally introduced in [BFH00] Section 5, with our focus trained on certain 2-dimensional models of such strata called "geometric models" and on the interesting properties of these models. A secondary purpose of this paper is to serve as a central reference for the whole serie… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

1
35
0

Year Published

2013
2013
2019
2019

Publication Types

Select...
3
2

Relationship

3
2

Authors

Journals

citations
Cited by 7 publications
(36 citation statements)
references
References 20 publications
1
35
0
Order By: Relevance
“…The meet operation on pairs extends to a well-defined operation on any set of free factor systems. To each marked graph G and subgraph K there corresponds a free factor system denoted F(K) or [K], by taking the conjugacy classes of the subgroups of π 1 (G) ≈ F n corresponding to the noncontractible components of K. See Section 2.6 of [BFH00], and Sections 1.1.2 and 3.1 of [HM13c].…”
Section: Subgroup Systems Carrying and Meet (⊏ And ∧) The Conjugacy C...mentioning
confidence: 99%
See 4 more Smart Citations
“…The meet operation on pairs extends to a well-defined operation on any set of free factor systems. To each marked graph G and subgraph K there corresponds a free factor system denoted F(K) or [K], by taking the conjugacy classes of the subgroups of π 1 (G) ≈ F n corresponding to the noncontractible components of K. See Section 2.6 of [BFH00], and Sections 1.1.2 and 3.1 of [HM13c].…”
Section: Subgroup Systems Carrying and Meet (⊏ And ∧) The Conjugacy C...mentioning
confidence: 99%
“…A set of lines fills F n if its free factor support is {[F n ]}. For each subgraph K of a marked graph G the free factor system F(K) is the free factor support of the set of conjugacy classes represented by circuits in K. See Section 2.6 of [BFH00] or Section 2.5 of [FH11] or Sections 1.1.2 and 1.2.2 of [HM13c].…”
Section: Subgroup Systems Carrying and Meet (⊏ And ∧) The Conjugacy C...mentioning
confidence: 99%
See 3 more Smart Citations