Tightness and computing distances in the curve complex

From MaRDI portal
Publication:715178

DOI10.1007/S10711-011-9680-2zbMATH Open1262.57020arXivmath/0412078OpenAlexW2033459032MaRDI QIDQ715178FDOQ715178

Kenneth J. Shackleton

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





Cites Work


Cited In (21)






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)