Tightness and computing distances in the curve complex
From MaRDI portal
Publication:715178
DOI10.1007/S10711-011-9680-2zbMATH Open1262.57020arXivmath/0412078OpenAlexW2033459032MaRDI QIDQ715178FDOQ715178
Publication date: 2 November 2012
Published in: Geometriae Dedicata (Search for Journal in Brave)
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.
Full work available at URL: https://arxiv.org/abs/math/0412078
algorithmsmapping class groupscombinatorial geometrycurve complex[https://portal.mardi4nfdi.de/w/index.php?title=+Special%3ASearch&search=Teichm%EF%BF%BD%EF%BF%BDller+theory&go=Go Teichm��ller theory]
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Sur les groupes hyperboliques d'après Mikhael Gromov. (On the hyperbolic groups à la M. Gromov)
- Geometry of the complex of curves. I: Hyperbolicity
- A representation of orientable combinatorial 3-manifolds
- Automorphisms of complexes of curves on punctured spheres and on punctured tori
- Geometry of the complex of curves. II: Hierarchical structure
- The virtual cohomological dimension of the mapping class group of an orientable surface
- On the Classification of Noncompact Surfaces
- 3-manifolds as viewed from the curve complex
- Tight geodesics in the curve complex
- The classification of Kleinian surface groups. II: The Ending lamination conjecture
- The classification of Kleinian surface groups. I: Models and bounds
- Bounded cohomology of subgroups of mapping class groups
- Lectures on hyperbolic geometry
- Intersection numbers and the hyperbolicity of the curve complex
- Compact Riemann surfaces. An introduction to contemporary mathematics
- Automorphisms of the complex of curves
- An acylindricity theorem for the mapping class group
- Homotopic Arcs are Isotopic
- Homotopic Curves on Surfaces
Cited In (21)
- On the finiteness property of hyperbolic simplicial actions: the right-angled Artin groups and their extension graphs
- Bounding and estimating the Hausdorff distance between real space algebraic curves
- Distance in the curve graph
- ALGORITHMS FOR DISTANCE PROBLEMS IN PLANAR COMPLEXES OF GLOBAL NONPOSITIVE CURVATURE
- Intersection numbers in the curve graph with a uniform constant
- Intersection numbers in the curve complex via subsurface projections
- On translation lengths of Anosov maps on the curve graph of the torus
- Polygon decompositions of a surface and tight geodesics
- Proximity in the curve complex: boundary reduction and bicompressible surfaces
- Distinct distances on curves via rigidity
- Distance 4 curves on closed surfaces of arbitrary genus
- Hyperbolicity of the genus two Hatcher-Thurston complex.
- Algorithms detecting stability and Morseness for finitely generated groups
- Efficient geodesics and an effective algorithm for distance in the complex of curves
- Title not available (Why is that?)
- MICC: a tool for computing short distances in the curve complex
- Tight geodesics in the curve complex
- Homotopic Fréchet distance between curves or, walking your dog in the woods in polynomial time
- Combinatorics of tight geodesics and stable lengths
- Distances of Heegaard splittings
- The geometry of the disk complex
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)