Constructing knot tunnels using giant steps
| dc.creator | Cho, Sangbum | |
| dc.creator | McCullough, Darryl | |
| dc.date | 2008-12-07 | |
| dc.date.accessioned | 2026-07-07T12:10:08Z | |
| dc.date.available | 2026-07-07T12:10:08Z | |
| dc.description | This is the first of three papers that refine and extend portions of our earlier preprint, "Depth of a knot tunnel." Together, they rework the entire preprint. H. Goda, M. Scharlemann, and A. Thompson described a general construction of all tunnels of all tunnel number 1 knots using "tunnel moves". We apply the theory that we introduced in "The tree of knot tunnels" to study this construction. In particular, we use it to calculate the number of distinct minimal sequences of tunnel 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. | |
| dc.description | 10 pages, 5 figures | |
| dc.identifier | https://arxiv.org/abs/0812.1382 | |
| dc.identifier | http://arxiv.org/abs/0812.1382 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/209853 | |
| dc.subject | Geometric Topology | |
| dc.subject | 57M25 | |
| dc.title | Constructing knot tunnels using giant steps | |
| dc.type | text |