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

DOI10.1016/J.JSC.2016.03.010zbMATH Open1347.57020arXiv1408.4134OpenAlexW1518515315MaRDI QIDQ739622FDOQ739622

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

Publication date: 18 August 2016

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

Abstract: The complex of curves $mathcalC(S_g)$ of a closed orientable surface of genus $ggeq2$ is the simplicial complex having its vertices, $mathcal{C}^0(S_g)$, are isotopy classes of essential curves in $S_g$. Two vertices co-bound an edge of the $1$-skeleton, $mathcal{C}^1(S_g)$, if there are disjoint representatives in $S_g$. A metric is obtained on $mathcal{C}^0(S_g)$ by assigning unit length to each edge of $mathcal{C}^1(S_g)$. Thus, the distance between two vertices, $d(v,w)$, corresponds to the length of a geodesic---a shortest edge-path between $v$ and $w$ in $mathcal{C}^1(S_g)$. Recently, Birman, Margalit and the second author introduced the concept of {em initially efficient geodesics} in $mathcal{C}^1(S_g)$ and used them to give a new algorithm for computing the distance between vertices. In this note we introduce the software package MICC ({em Metric in the Curve Complex}), a partial implementation of the initially efficient geodesic algorithm. We discuss the mathematics underlying MICC and give applications. In particular, we give examples of distance four vertex pairs, for $g=2$ and 3. Previously, there was only one known example, in genus $2$, due to John Hempel.

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

zbMATH Keywords

distancegeodesiccurve complexmapping class group

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (6)

• The restriction of efficient geodesics to the nonseparating complex of curves
• Distance 4 curves on closed surfaces of arbitrary genus
• Origami edge-paths in the curve graph
• Distance and intersection number in the curve graph of a surface
• MICC
• Efficient geodesics and an effective algorithm for distance in the complex of curves

Uses Software

• CPLEX

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q739622)