MICC: a tool for computing short distances in the curve complex

DOI10.1016/j.jsc.2016.03.010zbMath1347.57020arXiv1408.4134OpenAlexW1518515315MaRDI QIDQ739622

Kayla Morrell, William W. Menasco, Matthew J. Morse, Paul G. Glenn

Publication date: 18 August 2016

Published in: Journal of Symbolic Computation (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1408.4134

zbMATH Keywords

distancegeodesicmapping class groupcurve complex

Mathematics Subject Classification ID

General low-dimensional topology (57M99) Geodesics in global differential geometry (53C22)

Related Items (5)

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 ⋮ Origami edge-paths in the curve graph ⋮ MICC

Uses Software

• CPLEX

Cites Work

• Unnamed Item
• Unnamed Item
• Uniform hyperbolicity of the graphs of curves
• Uniform hyperbolicity of the curve graphs
• Tightness and computing distances in the curve complex
• Geometry of the complex of curves. II: Hierarchical structure
• Geometry of the complex of curves. I: Hyperbolicity
• 1-slim triangles and uniform hyperbolicity for arc graphs and curve graphs
• Minimally intersecting filling pairs on surfaces
• Heegaard splittings of distance exactly \(n\)
• Small intersection numbers in the curve graph
• Graph Algorithms
• Relatively hyperbolic groups
• 3-manifolds as viewed from the curve complex

This page was built for publication: MICC: a tool for computing short distances in the curve complex