Distance in the curve graph

From MaRDI portal
Publication:2439338



Abstract: We estimate the distance in the curve graph of a surface S of finite type using Teichmueller geodesics and assuming to be able to detect curves of distance at least three.


Let \(S\) be an oriented surface of genus \(g\geq 0\) with \(m\geq 0\) punctures satisfying \(3g-3+m\geq 2\). The curve graph of \(S\) is the geodesic metric graph whose vertices are isotopy classes of essential simple closed curves on \(S\) and where two vertices are connected by an edge of length one if and only if curves corresponding to the vertices can be realized disjointly. In this paper, the author shows that the distance between two points in the curve graph can be estimated up to a fixed multiplicative constant by considering pairs of \(\delta\)-wide simple closed curves of distance at least three for the unit cotangent line of a Teichmüller geodesic.











This page was built for publication: Distance in the curve graph

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