MICC: A tool for computing short distances in the curve complex. (January 2017)

• Record Type: Journal Article
• Authors: Glenn, Paul; Menasco, William W.; Morrell, Kayla; Morse, Matthew J.
• Is Part Of: Journal of symbolic computation. Volume 78(2017)
• Page Start: 115
• Page End: 132
• Publication Date: 2017-01
• Subjects: Mapping class group -- Curve complex -- Distance -- Geodesic; Mathematics -- Data processing -- Periodicals; Numerical analysis -- Data processing -- Periodicals; Automatic programming (Computer science) -- Periodicals; Mathématiques -- Informatique -- Périodiques; Analyse numérique -- Informatique -- Périodiques; Programmation automatique -- Périodiques; Automatic programming (Computer science); Mathematics -- Data processing; Numerical analysis -- Data processing; Periodicals; Electronic journals; 510.285
• DOI: 10.1016/j.jsc.2016.03.010
• Languages: English
• ISSNs: 0747-7171

Abstract

Abstract: The complex of curves C ( S g ) of a closed orientable surface of genus g ≥ 2 is the simplicial complex whose vertices, C 0 ( S g ), are isotopy classes of essential simple closed curves in S g . Two vertices co-bound an edge of the 1-skeleton, C 1 ( S g ), if there are disjoint representatives in S g . A metric is obtained on C 0 ( S g ) by assigning unit length to each edge of 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 C 1 ( S g ) . InBirman et al. (2016), the authors introduced the concept of efficient geodesics in 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 ( Metric in the Curve Complex ), a partial implementation of the efficient geodesic algorithm. We discuss the mathematics underlying MICC and give applications. In particular, up to an action of an element of the mapping class group, we give a calculation which produces all distance 4 vertex pairs for g = 2 that intersect 12 times, the minimal number of intersections needed for this distance and genus.