Skip Navigation


Proceedings of the London Mathematical Society Advance Access originally published online on July 18, 2008
Proceedings of the London Mathematical Society 2009 98(2):325-364; doi:10.1112/plms/pdn033
This Article
Right arrow Full Text (PDF)
Right arrow All Versions of this Article:
98/2/325    most recent
pdn033v1
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Futer, D.
Right arrow Articles by Guéritaud, F.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

© 2008 London Mathematical Society

Angled decompositions of arborescent link complements

David Futer

Mathematics Department
Temple University
Philadelphia, PA 19122
USA

François Guéritaud

Laboratoire de mathématiques
Université de Paris–Sud
91405 Orsay cedex
France
Francois.Gueritaud@normalesup.org

Received 18 December 2006. Revision received 24 January 2008.

This paper describes a way to subdivide a 3-manifold into angled blocks, namely polyhedral pieces that need not be simply connected. When the individual blocks carry dihedral angles that fit together in a consistent fashion, we prove that a manifold constructed from these blocks must be hyperbolic. The main application is a new proof of a classical, unpublished theorem of Bonahon and Siebenmann: that all arborescent links, except for three simple families of exceptions, have hyperbolic complements.

2000 Mathematics Subject Classification 57M25, 57M50.

Futer is partially supported by NSF grant DMS-0353717 (RTG), and Guéritaud is partially supported by NSF grant DMS-0103511.


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer: Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.