Efficient geodesics and an effective algorithm for distance in the complex of curves
From MaRDI portal
Publication:343172
DOI10.1007/S00208-015-1357-YzbMath1350.05022arXiv1408.4133OpenAlexW2320234702MaRDI QIDQ343172
Dan Margalit, Joan S. Birman, William W. Menasco
Publication date: 25 November 2016
Published in: Mathematische Annalen (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1408.4133
Moduli of Riemann surfaces, Teichmüller theory (complex-analytic aspects in several variables) (32G15) Distance in graphs (05C12) Hyperbolic and Kobayashi hyperbolic manifolds (32Q45)
Related Items (8)
Intersection numbers in the curve complex via subsurface projections ⋮ Distance 4 curves on closed surfaces of arbitrary genus ⋮ Efficient geodesics and an effective algorithm for distance in the complex of curves ⋮ Distance and intersection number in the curve graph of a surface ⋮ Contractible, hyperbolic but non-CAT(0) complexes ⋮ Determining the finite subgraphs of curve graphs ⋮ Algorithms detecting stability and Morseness for finitely generated groups ⋮ Origami edge-paths in the curve graph
Uses Software
Cites Work
- Efficient geodesics and an effective algorithm for distance in the complex of curves
- Uniform hyperbolicity of the graphs of curves
- Uniform hyperbolicity of the curve graphs
- Uniform hyperbolicity of the curve graph via surgery sequences
- Tightness and computing distances in the curve complex
- MICC: a tool for computing short distances in the curve complex
- Geometry of the complex of curves. II: Hierarchical structure
- Geometry of the complex of curves. I: Hyperbolicity
- A note on acylindrical hyperbolicity of mapping class groups
- 1-slim triangles and uniform hyperbolicity for arc graphs and curve graphs
- Symmetry, isotopy, and irregular covers
- On isotopies of homeomorphisms of Riemann surfaces
- Small intersection numbers in the curve graph
- Combinatorics of tight geodesics and stable lengths
- Unnamed Item
This page was built for publication: Efficient geodesics and an effective algorithm for distance in the complex of curves
