Abstract
In 2000, Goda, Scharlemann, and Thompson described a general construction of all tunnels of number 1 knots using tunnel The theory of tunnels introduced by Cho and McCullough provides a combinatorial approach to understanding 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 will have many such constructions. Finally, we give a characterization of the tunnels with a unique minimal sequence.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
