2016
DOI: 10.1112/jlms/jdw065
|View full text |Cite
|
Sign up to set email alerts
|

The augmented marking complex of a surface

Abstract: We build an augmentation of the Masur-Minsky marking complex by Groves-Manning combinatorial horoballs to obtain a graph we call the augmented marking complex, AM(S). Adapting work of Masur-Minsky, we show that this augmented marking complex is quasiisometric to Teichmüller space with the Teichmüller metric. A similar construction was independently discovered by Eskin-Masur-Rafi. We also completely integrate the Masur-Minsky hierarchy machinery to AM(S) to build flexible families of uniform quasigeodesics in T… Show more

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
37
0

Year Published

2016
2016
2020
2020

Publication Types

Select...
4
1

Relationship

0
5

Authors

Journals

citations
Cited by 16 publications
(37 citation statements)
references
References 27 publications
0
37
0
Order By: Relevance
“…A direct proof for the augmented marking complex is given in [D1]. Given that these spaces are quasi-isometric [Ra,D1] these statements are equivalent, and both are equivalent to the corresponding statement for the decorated marking complex as we have described it. We note that another proof of this distance estimate can be found in [BeHS2].…”
Section: The Median Constructionmentioning
confidence: 93%
See 4 more Smart Citations
“…A direct proof for the augmented marking complex is given in [D1]. Given that these spaces are quasi-isometric [Ra,D1] these statements are equivalent, and both are equivalent to the corresponding statement for the decorated marking complex as we have described it. We note that another proof of this distance estimate can be found in [BeHS2].…”
Section: The Median Constructionmentioning
confidence: 93%
“…The construction of the 'augmented marking graph' in [14] fits (more or less) into this picture. There, the marking graph M is taken to be the marking graph as defined in [23].…”
Section: A Combinatorial Modelmentioning
confidence: 94%
See 3 more Smart Citations