Tightness and computing distances in the curve complex

DOI10.1007/S10711-011-9680-2MaRDI QIDQ715178zbMATH OpenOpenAlexFDO

Authors Kenneth J. Shackleton

Publication date 2 November 2012

Published in Geometriae Dedicata (Search for Journal in Brave)

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

zbMATH Keywords

algorithmscombinatorial geometrycurve complexmapping class groupsTeichmüller theory

Mathematics Subject Classification ID

Distance in graphs (05C12) General geometric structures on low-dimensional manifolds (57M50)

Abstract: We give explicit bounds on the intersection number between any curve on a tight multigeodesic and the two ending curves. We use this to construct all tight multigeodesics and so conclude that distances in the curve graph are computable. The algorithm applies to all surfaces. We recover the finiteness result of Masur-Minsky for tight goedesics. The central argument makes no use of the geometric limit arguments seen in the recent work of Masur-Minsky (2000) and of Bowditch (2003), and is enough to deduce a computable version of the acylindricity theorem of Bowditch.

Review text

The author computes effective bounds on certain intersection numbers among curves lying on a natural family of geodesics (called tight geodesics) in the curve graph of an exceptional surface. He also gives a finite time algorithm for constructing all tight geodesics between any two curves. The main Theorem of the paper is as follows: Theorem: Let \(\Sigma\) be any non-exceptional surface. There exists a computable function \(F : \mathbb{N} \rightarrow \mathbb{N}\) such that, for any tight geodesic \((\alpha_0, \cdots,\alpha_n)\) in the curve graph of \(\Sigma\), both the intersection numbers \(i(\alpha_0, \alpha_j)\) and \(i(\alpha_j, \alpha_n)\) are at most \(F(i(\alpha_0, \alpha_n))\) for each index \(j\). From this, the author recovers Masur-Minsky's Theorem about the existence of finitely many tight multigeodesics between any two vertices of the curve graph of a non-exceptional surface.

Recommendations

• Efficient geodesics and an effective algorithm for distance in the complex of curves
• Intersection numbers in the curve complex via subsurface projections
• Combinatorics of tight geodesics and stable lengths
• Polygon decompositions of a surface and tight geodesics
• Intersection numbers and the hyperbolicity of the curve complex

Cites work

• 3-manifolds as viewed from the curve complex
• A primer on mapping class groups
• A representation of orientable combinatorial 3-manifolds
• An acylindricity theorem for the mapping class group
• Automorphisms of complexes of curves on punctured spheres and on punctured tori
• Automorphisms of the complex of curves
• Bounded cohomology of subgroups of mapping class groups
• Compact Riemann surfaces. An introduction to contemporary mathematics
• Geometry of the complex of curves. I: Hyperbolicity
• Geometry of the complex of curves. II: Hierarchical structure
• Homotopic Arcs are Isotopic
• Homotopic Curves on Surfaces
• scientific article; zbMATH DE number 4031953 (Why is no real title available?)
• scientific article; zbMATH DE number 3721247 (Why is no real title available?)
• scientific article; zbMATH DE number 193437 (Why is no real title available?)
• scientific article; zbMATH DE number 1089297 (Why is no real title available?)
• Intersection numbers and the hyperbolicity of the curve complex
• Lectures on hyperbolic geometry
• On the Classification of Noncompact Surfaces
• Sur les groupes hyperboliques d'après Mikhael Gromov. (On the hyperbolic groups à la M. Gromov)
• The classification of Kleinian surface groups. I: Models and bounds
• The classification of Kleinian surface groups. II: The Ending lamination conjecture
• The virtual cohomological dimension of the mapping class group of an orientable surface
• Tight geodesics in the curve complex

Cited in

(28)

• Homotopic Fréchet distance between curves or, walking your dog in the woods in polynomial time
• Hyperbolicity of the genus two Hatcher-Thurston complex.
• Algorithms detecting stability and Morseness for finitely generated groups
• On the finiteness property of hyperbolic simplicial actions: the right-angled Artin groups and their extension graphs
• Distance 4 curves on closed surfaces of arbitrary genus
• On translation lengths of Anosov maps on the curve graph of the torus
• Distinct distances on curves via rigidity
• Distances of Heegaard splittings
• Critical levels and Jacobi fields in a complex of cycles
• Distance in the curve graph
• Tight geodesics in the curve complex
• Distance and intersection number in the curve graph of a surface
• Intersection numbers in the curve graph with a uniform constant
• Polygon decompositions of a surface and tight geodesics
• ALGORITHMS FOR DISTANCE PROBLEMS IN PLANAR COMPLEXES OF GLOBAL NONPOSITIVE CURVATURE
• Combinatorics of tight geodesics and stable lengths
• Efficient geodesics and an effective algorithm for distance in the complex of curves
• Bounding and estimating the Hausdorff distance between real space algebraic curves
• scientific article; zbMATH DE number 6850316 (Why is no real title available?)
• The geometry of the disk complex
• Infima of length functions and dual cube complexes
• Intersection numbers in the curve complex via subsurface projections
• The restriction of efficient geodesics to the nonseparating complex of curves
• Uniformly polynomial-time classification of surface homeomorphisms
• Translation lengths in crossing and contact graphs of quasi-median graphs
• Dehn-Thurston coordinates for curves on surfaces
• MICC: a tool for computing short distances in the curve complex
• Proximity in the curve complex: boundary reduction and bicompressible surfaces

This page was built for publication: Tightness and computing distances in the curve complex

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