An algorithm for finding parameters of tunnels

Cho and McCullough gave a numerical parameterization of the collection of all tunnels of all tunnel number 1 knots and links in the $3$ –sphere. Here we give an algorithm for finding the parameter of a given tunnel by using its Heegaard diagram.

PDF Access Denied

Warning: We have not been able to recognize your IP address 47.88.87.18 as that of a subscriber to this journal. Online access to the content of recent issues is by subscription, or purchase of single articles.

Please contact your institution's librarian suggesting a subscription, for example by using our journal-recommendation form.

Or, visit our subscription page for instructions on purchasing a subscription. You may also contact us at contact@msp.org or by using our contact form.

Or, you may purchase this single article for USD 29.95:

Keywords

unknotting tunnel, Heegaard diagram, parameter of tunnel

Mathematical Subject Classification 2000

Primary: 57M25

Secondary: 57N10

References

Publication

Received: 17 November 2009

Revised: 17 May 2011

Accepted: 30 May 2011

Published: 29 July 2011

Authors

Kai Ishihara
Department of Mathematics Imperial College London London SW7 2AZ UK

Volume 11, issue 4 (2011)

Kai Ishihara

Abstract