Tightness and computing distances in the curve complex

Details Tightness and computing distances in the curve complex Tightness and computing distances in the curve complex

2004-12-03

arxiv.org/abs/math/0412078v3

Mathematics

Geometric Topology

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

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Tightness and computing distances in the curve complex does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Tightness and computing distances in the curve complex, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Tightness and computing distances in the curve complex will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-403235