Constructing knot tunnels using giant steps

From MaRDI portal
Publication:3402191

DOI10.1090/S0002-9939-09-10069-2zbMATH Open1192.57004arXiv0812.1382MaRDI QIDQ3402191FDOQ3402191

Darryl McCullough, Sangbum Cho

Publication date: 2 February 2010

Published in: Proceedings of the American Mathematical Society (Search for Journal in Brave)

Abstract: 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.


Full work available at URL: https://arxiv.org/abs/0812.1382





Cites Work


Cited In (7)


   Recommendations





This page was built for publication: Constructing knot tunnels using giant steps

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3402191)