Volume 5, issue 1 (2001)

Download this article
For printing
Recent Issues

Volume 20
Issue 4, 1807–2438
Issue 3, 1257–1806
Issue 2, 629–1255
Issue 1, 1–627

Volume 19, 6 issues

Volume 18, 5 issues

Volume 17, 5 issues

Volume 16, 4 issues

Volume 15, 4 issues

Volume 14, 5 issues

Volume 13, 5 issues

Volume 12, 5 issues

Volume 11, 4 issues

Volume 10, 4 issues

Volume 9, 4 issues

Volume 8, 3 issues

Volume 7, 2 issues

Volume 6, 2 issues

Volume 5, 2 issues

Volume 4, 1 issue

Volume 3, 1 issue

Volume 2, 1 issue

Volume 1, 1 issue

The Journal
About the Journal
Editorial Board
Editorial Interests
Editorial Procedure
Submission Guidelines
Submission Page
Subscriptions
Author Index
To Appear
Contacts
ISSN (electronic): 1364-0380
ISSN (print): 1465-3060
The size of triangulations supporting a given link

Simon A King

Geometry & Topology 5 (2001) 369–398

arXiv: math.GT/0007032

Abstract

Let T be a triangulation of S3 containing a link L in its 1–skeleton. We give an explicit lower bound for the number of tetrahedra of T in terms of the bridge number of L. Our proof is based on the theory of almost normal surfaces.

Keywords
link, triangulation, bridge number, Rubinstein–Thompson algorithm, normal surfaces
Mathematical Subject Classification 2000
Primary: 57M25, 57Q15
Secondary: 68Q25
References
Forward citations
Publication
Received: 12 September 2000
Accepted: 8 April 2001
Published: 20 April 2001
Proposed: Walter Neumann
Seconded: Cameron Gordon, David Gabai
Authors
Simon A King
Institut de Recherche Mathématique Avancée
Strasbourg
France