Tightness and computing distances in the curve complex
| dc.creator | Shackleton, Kenneth J. | |
| dc.date | 2004-12-03 | |
| dc.date | 2005-04-14 | |
| dc.date.accessioned | 2026-07-07T05:14:56Z | |
| dc.date.available | 2026-07-07T05:14:56Z | |
| dc.description | 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. | |
| dc.description | 11 pages, no figures. v3: Corrected typos, updated references | |
| dc.identifier | https://arxiv.org/abs/math/0412078 | |
| dc.identifier | http://arxiv.org/abs/math/0412078 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/73474 | |
| dc.subject | Geometric Topology | |
| dc.title | Tightness and computing distances in the curve complex | |
| dc.type | text |