Tightness and computing distances in the curve complex

2004/12/03 by Kenneth J. Shackleton, Shackleton, Kenneth J.
Mathematics · #FOS: Mathematics #Geometric Topology (math.GT) #math.GT

paper · pdf · doi:10.48550/arxiv.math/0412078

11 pages, no figures. v3: Corrected typos, updated references

arxiv created 2005/04/14 · arxiv updated 2009/12/01

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.

Related

• Intersection numbers in the curve complex via subsurface projections
• Intersection numbers in the curve graph with a uniform constant
• Uniform local finiteness of the curve graph via subsurface projections
• Efficient geodesics and an effective algorithm for distance in the\n complex of curves
• Combinatorics of tight geodesics and stable lengths