Distance 4 curves on closed surfaces of arbitrary genus
The \textit{curve graph} is a combinatorial object capturing the intersection patterns of (isotopy classes of) essential simple closed curves on a surface. It has proved remarkably successful in the study of mapping class groups, 3-manifolds and many other areas. While it is known that the curve graph has infinite diameter [\textit{H. A. Masur} and \textit{Y. N. Minsky}, Geom. Funct. Anal. 10, No. 4, 902--974 (2000; Zbl 0972.32011)], drawing explicit examples of vertices of even distance \(4\) is surprisingly challenging. In particular, it is not known what the minimal number of intersection points between two curves of distance \(4\) in a genus \(g\) surface is in general (see [\textit{T. Aougab} and \textit{S. Huang}, Algebr. Geom. Topol. 15, No. 2, 903--932 (2015; Zbl 1334.57013)] for asymptotic behaviour). In this article, the authors construct pairs of curves on genus \(g\) surfaces of curve graph distance \(4\) and intersection number \((2g-1)^2\).
- 1-slim triangles and uniform hyperbolicity for arc graphs and curve graphs
- A note on acylindrical hyperbolicity of mapping class groups
- Combinatorics of tight geodesics and stable lengths
- Efficient geodesics and an effective algorithm for distance in the complex of curves
- Geometry of the complex of curves. I: Hyperbolicity
- Geometry of the complex of curves. II: Hierarchical structure
- scientific article; zbMATH DE number 3721247 (Why is no real title available?)
- scientific article; zbMATH DE number 5057434 (Why is no real title available?)
- Intersection numbers in the curve graph with a uniform constant
- MICC: a tool for computing short distances in the curve complex
- Minimally intersecting filling pairs on surfaces
- Small intersection numbers in the curve graph
- Tightness and computing distances in the curve complex
- Uniform hyperbolicity of the curve graph via surgery sequences
- Uniform hyperbolicity of the curve graphs
- Uniform hyperbolicity of the graphs of curves
- Distance in the curve graph
- Distance and intersection number in the curve graph of a surface
- Distance of edges in the curve complex of a surface
- Small intersection numbers in the curve graph
- Distance 5 curves in the curve graph of closed surfaces
- MICC: a tool for computing short distances in the curve complex
This page was built for publication: Distance 4 curves on closed surfaces of arbitrary genus
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2140640)