Loading…

Constructing knot tunnels using giant steps

In 2000, Goda, Scharlemann, and Thompson described a general construction of all tunnels of tunnel number 1 knots using ``tunnel moves''. The theory of tunnels introduced by Cho and McCullough provides a combinatorial approach to understanding tunnel moves. We use it to calculate the numbe...

Full description

Saved in:
Bibliographic Details
Published in:Proceedings of the American Mathematical Society 2010-01, Vol.138 (1), p.375-384
Main Authors: CHO, SANGBUM, MCCULLOUGH, DARRYL
Format: Article
Language:English
Subjects:
Citations: Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:In 2000, Goda, Scharlemann, and Thompson described a general construction of all tunnels of tunnel number 1 knots using ``tunnel moves''. The theory of tunnels introduced by Cho and McCullough provides a combinatorial approach to understanding tunnel moves. We use it to calculate the number of distinct minimal sequences of such moves that can produce a given tunnel. As a consequence, we see that for a sparse infinite set of tunnels, the minimal sequence is unique, but generically a tunnel will have many such constructions. Finally, we give a characterization of the tunnels with a unique minimal sequence.
ISSN:0002-9939
1088-6826
DOI:10.1090/S0002-9939-09-10069-2