This paper was converted on www.awesomepapers.org from LaTeX by an anonymous user.
Want to know more? Visit the Converter page.

The tunnel number of all 11 and 12 crossing alternating knots

Felipe Castellano-Macías  and  Nicholas Owad Northeastern University
Boston, MA 02115, USA
and
Topology and Geometry of Manifolds Unit
Okinawa Institute of Science and Technology Graduate University
Okinawa, Japan 904-0495
castellanomacias.f@northeastern.edu Topology and Geometry of Manifolds Unit
Okinawa Institute of Science and Technology Graduate University
Okinawa, Japan 904-0495
and
Department of Mathematics
Hood College
Frederick, MD 21701, USA
owad@hood.edu
Abstract.

Using exhaustive techniques and results from Lackenby and many others, we compute the tunnel number of all 1655 alternating 11 and 12 crossing knots and of 881 non-alternating 11 and 12 crossing knots. We also find all 5525 Montesinos knots with 14 crossings or fewer.

2016 Mathematics Subject Classification. 57M25, 57M27

1. Introduction

Tunnel number is a knot invariant, first defined by Clark in 1980, [6]. The tunnel number t(K)t(K) can be realized as one less than the Heegaard genus of S3N(K)S^{3}\setminus N(K), or as the minimum number of properly embedded disjoint arcs αi\alpha_{i} required to make S3N(K{αi})S^{3}\setminus N(K\cup\{\alpha_{i}\}) a handlebody. Since it was defined, it has become a classical invariant with connections to the hyperbolic volume of knots [11], bridge number, and many others. It has interesting and unexpected properties under connected sum [22] and is a common tool used to investigate characteristics of knots and links. Because of this, it is useful to have explicit values for tunnel number to test conjectures against. For an overview of tunnel number, see Morimoto [21].

A paper by Morimoto, Sakuma, and Yokota [23] computed the tunnel number of all knots with 10 or fewer crossings, of which there are 250. This paper aims to extend this list of known values of tunnel numbers. The main source of values of tunnel numbers here is Lackenby’s paper [13], where he proves a conjecture of Sakuma and classifies all tunnel number one alternating knots. Briefly, the main theorem of Lackenby is as follows: KK is an alternating, tunnel number one knot if and only if KK is either a 2-bridge knot or a 3-bridge Montesinos knot with a clasp. A clasp is a rational tangle with corresponding rational number ±12\pm\frac{1}{2}.

We enumerate all possible examples of these knots with 11 and 12 crossings and use the program SnapPy [7], by Culler, Dunfield, Goerner, and Weeks, to identify them. We also use the data on bridge number of these knots, supplied by the online database Knotinfo [17], and are able to identify the tunnel number of every alternating 11 and 12 crossing knot, of which there are 1655 knots. For exactly two alternating knots, this first method does not work, but Moriah and Lustig’s result in [18] provides the tunnel number. These and other methods also give exact values and bounds for many non-alternating knots. There are 1073 non-alternating 11 and 12 crossing knots, and we have calculated the tunnel numbers of 881 of them. The remaining 192 knots have tunnel number one or two.

Theorem 1.1.

The tunnel number of all 1655 alternating 11 or 12 crossing knots has been calculated. The tunnel number of 881 non-alternating 11 or 12 crossing knots has also been calculated.

A list of these tunnel numbers can be found in Appendix A. In the process of this work, we have also enumerated all Montesinos knots with 14 crossings or fewer. The full list of all these results and the associated code can be found online for download at

https://github.com/fcastellanomacias/tunnel.

We will define the relevant terms in the next section and in Section 3 we give well-known relations between tunnel number and other invariants. Then in Section 4 we will discuss the algorithms used and finally, in Section 5, we prove our main result and provide summary tables which help explain the proof.

Acknowledgments

The first author would like to thank the Okinawa Institute of Science and Technology for their hospitality throughout their internship there. We also thank Nathan Dunfield for useful suggestions regarding symmetries of knots and Method 3.12, and Ken Baker for helpful comments.

2. Definitions

We assume the reader is familiar with the basics of knot theory, see [25] for background. Throughout this paper, we will assume all knots have a single component. The two main families of knots we will need to consider are rational knots and Montesinos knots; both are built from rational tangles, see [5, Chapter 12] for more details.

Throughout this paper, we adopt the following convention for continued fractions:

[a1,a2,,am]:=a1+1a2++1am1+1am.\left[a_{1},a_{2},\ldots,a_{m}\right]:=a_{1}+\frac{1}{a_{2}+\dots+\frac{1}{a_{m-1}+\frac{1}{a_{m}}}}.
Definition 2.1.

A rational tangle for (α,β)(\alpha,\beta) as illustrated in Figure 1 is defined by the continued fraction βα=[a1,a2,a3,,±am]\frac{\beta}{\alpha}=[a_{1},-a_{2},a_{3},\ldots,\pm a_{m}], aj=aj+aj′′a_{j}=a^{\prime}_{j}+a^{\prime\prime}_{j}, together with the conditions that α\alpha and β\beta are relatively prime and α>0\alpha>0.

a5a_{5}a4a^{\prime}_{4}a4′′a^{\prime\prime}_{4}a3a^{\prime}_{3}a3′′a^{\prime\prime}_{3}a2a^{\prime}_{2}a2′′a^{\prime\prime}_{2}a1a^{\prime}_{1}a1′′a^{\prime\prime}_{1}
Figure 1. A rational tangle for (181,297)(181,297), where 297181=[2,3,5,3,5]\frac{297}{181}=[2,-3,5,-3,5]. Note that aja_{j}^{\prime} and aj′′a_{j}^{\prime\prime} are the number of half-twists. The dashed line represents an unknotting tunnel.

Schubert defined the bridge number of a knot in 1954, [27].

Definition 2.2.

The bridge number of a diagram DD is the minimum number of local maxima of DD. The bridge number b(K)b(K) of a knot KK is the minimum number of the bridge numbers over all diagrams DD of KK.

Given a knot KK, b(K)=1b(K)=1 if and only if KK is the unknot. So, under this invariant, the first class of nontrivial knots are 2-bridge knots and Schubert completely classified these knots. Another name for 2-bridge knots is rational knots, named so because they are a composed of a single rational tangle with a numerator (or denominator) closure.

TTT1T_{1}T2T_{2}eeβ1/α1\beta_{1}/\alpha_{1}β2/α2\beta_{2}/\alpha_{2}βn/αn\beta_{n}/\alpha_{n}
Figure 2. A rational knot, with a numerator closure, on the left. In the middle, a clasp Montesinos link with e=0e=0, and on the right, a Montesinos link.

Montesinos knots are a generalization of rational knots, first introduced by Montesinos in 1973, [20].

Definition 2.3.

The Montesinos link M(e;β1/α1,β2/α2,,βr/αr)M(e;\beta_{1}/\alpha_{1},\beta_{2}/\alpha_{2},\ldots,\beta_{r}/\alpha_{r}) is a link admitting a diagram like that of Figure 2, where each box represents a rational tangle. Also, r3r\geq 3 and βi/αi\beta_{i}/\alpha_{i} is not an integer, otherwise MM would have a simpler diagram. If ee is left out of the notation, we assume e=0e=0.

For convenience, we will make a more specific class of Montesinos links that will be useful later. See Figure 2.

Definition 2.4.

A clasp Montesinos link is a Montesinos link where exactly one of the βi/αi=±1/2\beta_{i}/\alpha_{i}=\pm 1/2.

By [5, Theorem 12.29], Montesinos links are equivalent up to cyclic permutations of the fractions and up to the value of each fraction mod 1. This shows that our definition of clasp Montesinos link is well-defined.

And finally, we define the main invariant that we are considering in this paper.

Definition 2.5.

Given a knot KK, a tunnel is a properly embedded arc in S3N(K)S^{3}\setminus N(K), where N()N(\cdot) is an open regular neighborhood. The tunnel number t(K)t(K) of KK is the minimum number of disjoint tunnels αi\alpha_{i} required to make S3N(K{αi})S^{3}\setminus N(K\cup\{\alpha_{i}\}) a handlebody.

The dashed line in Figure 1 is a tunnel. Contract the tunnel to a point, creating a graph which, through ambient isotopy, allows all the crossings in the center of the tangle to be undone. Then the next innermost crossings can be undone, and so on, until we have a graph that is shaped like an “X”. For ease, we will refer to this process as collapsing a tangle to a point.

3. Bounds on tunnel number

We begin this section with a well-known proposition which relates the rank of the knot group, tunnel number, and bridge number.

Proposition 3.1 ([18]).

For any knot KK, we have that

rank(π1(S3K))1t(K)b(K)1.\operatorname{rank}(\pi_{1}(S^{3}\setminus K))-1\leq t(K)\leq b(K)-1.

In addition, the following theorem shows that a Montesinos knot with rr rational tangles has bridge number equal to rr.

Theorem 3.2 ([3, Theorem 1.1]).

Let KK be the Montesinos knot M(e;β1/α1,,βr/αr)M(e;\beta_{1}/\alpha_{1},\dots,\beta_{r}/\alpha_{r}), where αi1\alpha_{i}\neq 1 for all ii. Then b(K)=rb(K)=r.

Next, we generalize a lemma from Lackenby [13] which gives an upper bound for the tunnel number of clasp Montesinos knots.

Proposition 3.3.

Let KK be the clasp Montesinos knot M(e;β1/α1,,βr/αr)M(e;\beta_{1}/\alpha_{1},\dots,\beta_{r}/\alpha_{r}). Then t(K)r2t(K)\leq r-2.

Proof.

We follow an argument similar to [13]. Without loss of generality, we may assume that KK is of the form M(0;β1/α1,,βr2/αr2,1/2,βr/αr)M(0;\beta_{1}/\alpha_{1},\dots,\beta_{r-2}/\alpha_{r-2},1/2,\beta_{r}/\alpha_{r}). As shown in Figure 1, we can place a tunnel at the center of each rational tangle to collapse the tangle to a point. Thus, after placing a tunnel in each rational tangle βi/αi\beta_{i}/\alpha_{i}, for 1ir21\leq i\leq r-2, we obtain the diagram in the middle of Figure 3. In this diagram, we can now slide down the outermost arc from the top to the bottom vertex via ambient isotopy without altering the exterior, obtaining the diagram on the right of Figure 3. As shown by Lackenby in [13], we obtain that t(K)r2t(K)\leq r-2. Note that Lackenby’s proof also applies when KK is non-alternating.

Figure 3. On the left, a clasp Montesinos knot of the form M(0;β1/α1,,βr2/αr2,1/2,βr/αr)M(0;\beta_{1}/\alpha_{1},\dots,\beta_{r-2}/\alpha_{r-2},1/2,\beta_{r}/\alpha_{r}), where rational tangles are the gray circles and tunnels are represented by dashed lines. In the middle, the result of collapsing each tunnel. On the right, the diagram obtained by sliding the two outermost arcs from the top to the bottom vertex.

Corollary 3.4.

In particular, if KK is a clasp Montesinos knot and r=3r=3, then t(K)=1t(K)=1.

We also use part of Lustig and Moriah’s theorem which gives the tunnel number of certain Montesinos knots.

Theorem 3.5 ([18, Theorem 0.1]).

Let KK be the Montesinos knot M(e;β1/α1,,βr/αr)M(e;\beta_{1}/\alpha_{1},\dots,\beta_{r}/\alpha_{r}), and let α=gcd(α1,,αr)\alpha=\gcd(\alpha_{1},\dots,\alpha_{r}). If α1\alpha\neq 1, then t(K)=b(K)1=r1t(K)=b(K)-1=r-1.

Note that Theorem 3.5 does not contradict Proposition 3.3, since any clasp Montesinos knot with α1\alpha\not=1 will be a link with more than one component.

Now, we present Lackenby’s main result.

Theorem 3.6 ([13, Theorem 1]).

An alternating knot KK has tunnel number one if and only if KK is a 2-bridge knot or KK is a clasp Montesinos knot of the form M(e;±1/2,β1/α1,β2/α2)M(e;\pm 1/2,\beta_{1}/\alpha_{1},\beta_{2}/\alpha_{2}), where α1\alpha_{1} and α2\alpha_{2} are odd.

Combining Proposition 3.1 and Theorem 3.6, we can compute the tunnel numbers for all alternating 3-bridge knots. Similarly, Proposition 3.3 and Theorem 3.6 give us a way to compute the tunnel number of many alternating 4-bridge knots.

Corollary 3.7.

Let KK be an alternating knot.

  • If KK is 3-bridge and clasp Montesinos, then t(K)=1t(K)=1.

  • If KK is 3-bridge and not clasp Montesinos, then t(K)=2t(K)=2.

  • If KK is 4-bridge and clasp Montesinos, then t(K)=2t(K)=2.

In contrast with Theorem 3.6 and Corollary 3.7, which exclusively apply to alternating knots, we have the following result by Morimoto, Sakuma, and Yokota, which completely characterizes tunnel number one Montesinos knots.

Theorem 3.8 ([23, Theorem 2.2]).

The Montesinos knot111In this paper, we exclude rational knots from the class of Montesinos knots. However, in [23], rational knots are considered to be Montesinos knots, so this theorem has the additional condition that r=2r=2. M(e;β1/α1,β2/α2,,βr/αr)M(e;\beta_{1}/\alpha_{1},\beta_{2}/\alpha_{2},\ldots,\beta_{r}/\alpha_{r}) has tunnel number one if and only if one of the following conditions holds up to cyclic permutation of the indices:

  1. (1)

    r=3r=3, α1=2\alpha_{1}=2, and α2α31(mod 2)\alpha_{2}\equiv\alpha_{3}\equiv 1\ (\mathrm{mod}\ 2).

  2. (2)

    r=3r=3, β2/α2β3/α3/\beta_{2}/\alpha_{2}\equiv\beta_{3}/\alpha_{3}\in\mathbb{Q}/{\mathbb{Z}}, and

    ei=1rβi/αi=±1/(α1α2).e-\sum_{i=1}^{r}\beta_{i}/\alpha_{i}=\pm 1/(\alpha_{1}\alpha_{2}).

Furthermore, the symmetry type of a knot can give an obstruction for a knot to have tunnel number one.

Theorem 3.9 ([26, Section 2.1], [23, Theorem 1.2]).

Any tunnel number one knot admits a strong inversion.

Additionally, there is a connection between the Nakanishi index m(K)m(K) of a knot KK and its tunnel number t(K)t(K). The Nakanishi index m(K)m(K) can be defined to be the minimal number of generators of the Alexander module of KK [10]. We adopt the convention that knots with Alexander module isomorphic to [t,t1]{\mathbb{Z}}[t,t^{-1}] have Nakanishi index zero. As well, we have the following fact which appears as a footnote in Milnor’s paper [19]: any 2-generator knot has a cyclic Alexander module. This, combined with Proposition 3.1, directly implies the following:

Proposition 3.10.

Any knot KK with m(K)>1m(K)>1 has t(K)>1t(K)>1.

In [12], Kohno uses quantum invariants to give some estimates for tunnel number.

Theorem 3.11 ([12]).

Let KK be a knot and let VKV_{K} denote its Jones polynomial. If KK satisfies

|VK(e2π1/5)|>2.1489,\left\lvert V_{K}\left(e^{2\pi\sqrt{-1}/5}\right)\right\rvert>2.1489,

then t(K)2t(K)\geq 2.

Finally, we present a nondeterministic method suggested to us by Nathan Dunfield for determining if a knot has tunnel number one.

Method 3.12.

Given a knot KK, use SnapPy to find a presentation its knot group. Using Berge’s Heegaard program [1], check whether this presentation comes from a Heegaard splitting by using the is_realizable function. If this is the case and the knot group has two generators, then t(K)=1t(K)=1. We may randomly re-triangulate the 3-manifold S3N(K)S^{3}\setminus N(K) many times using the randomize function in SnapPy to obtain different knot group presentations.

4. Algorithms

All the algorithms in this section have been implemented in SnapPy by the first author. We will use RT()RT(\ell) to denote the set of all fractions representing all rational tangles with \ell crossings. Each of the fractions in RT()RT(\ell) is uniquely identified with a rational tangle. Step (1) of both algorithms lists all partitions which sum to \ell or nn, which is an easy exercise and we exclude it here.

Algorithm 4.1.

There exists an algorithm to identify all rational tangles with \ell crossings.

The algorithm is the following:

  1. (1)

    List all integer partitions of \ell, where each summand is a positive integer.

  2. (2)

    Each partition =a1+a2++am\ell=a_{1}+a_{2}+\dots+a_{m} has an associated fraction defined as

    pq=a1+1a2++1am1+1am.\frac{p}{q}=a_{1}+\frac{1}{a_{2}+\dots+\frac{1}{a_{m-1}+\frac{1}{a_{m}}}}.

    For each partition [a1,,an][a_{1},\dots,a_{n}], compute its associated fraction pq\frac{p}{q} and let XX denote the set of all fractions arising this way.

  3. (3)

    For each fraction in XX, also add the negation of the fraction to XX.

Every rational tangle has an alternating minimal diagram [9], and every alternating diagram of a rational tangle created as in Figure 1 is reduced and thus minimal [8, 24, 28], so we conclude that X=RT()X=RT(\ell).

Given a fraction pq\frac{p}{q}, we can use the function RationalTangle(p,q) from SnapPy to build its corresponding rational tangle.

Algorithm 4.2.

There exists an algorithm to identify all Montesinos knots with nn crossings.

The main idea is to identify all Montesinos knots with nn crossings and rr rational tangles. Observe that rr need be at most n/2\lfloor n/2\rfloor, since each rational tangle must have at least two crossings. The algorithm is as follows:

  1. (1)

    List all partitions of nn with rr summands.

  2. (2)

    For each partition n=n1++nrn=n_{1}+\dots+n_{r}, take the Cartesian product RT(n1)××RT(nr)RT(n_{1})\times\dots\times RT(n_{r}). Each element of this Cartesian product is an rr-tuple of rational numbers.

  3. (3)

    For each such rr-tuple, construct a Montesinos link by tangle summing together all rational tangles from the tuple in order, and then taking the numerator closure of the sum. That is, for each fraction piqi\frac{p_{i}}{q_{i}} in RT(ni)RT(n_{i}), form the Montesinos knot M(e;p1/q1,,pr/qr)M(e;p_{1}/q_{1},\dots,p_{r}/q_{r}).

  4. (4)

    From this list of Montesinos links, check the number of components of each link by using the function link_components from SnapPy and remove all links with more than one component.

  5. (5)

    Identify all Montesinos knots with nn crossings by repeating this process for all 3rn/23\leq r\leq\lfloor n/2\rfloor.

Notice that in a Montesinos knot M(e;p1/q1,,pr/qr)M(e;p_{1}/q_{1},\dots,p_{r}/q_{r}), we can add the half-twists from ee to any of the rational tangles representing each fraction. At the same time, by [5, Theorem 12.29], Montesinos knots with the same value of their fractions mod 1 are equivalent. Therefore, we may ignore ee in this algorithm.

We use the function identify from SnapPy to identify knots and we then remove any possible duplicates. In our work, every knot we created with this algorithm was identified by SnapPy.

As a particular case of Algorithm 4.2, we obtain the following result which will be later used to calculate tunnel numbers.

Corollary 4.3.

All 5525 Montesinos knots with 14 crossings or fewer have been identified. Moreover, all 2784 clasp Montesinos knots with 14 crossings or fewer have been identified.

The distribution of Montesinos knots per crossing number can be seen in Table 1.

Number of crossings Number of Montesinos knots Number of clasp Montesinos knots
Total Alternating Non-alternating Total Alternating Non-alternating
\leq 7 0 0 0 0 0 0
8 6 6 0 6 6 0
9 15 15 0 11 11 0
10 57 57 0 37 37 0
11 164 97 67 101 60 41
12 479 283 196 265 159 106
13 1308 778 530 675 403 272
14 3496 2076 1420 1689 1004 685
Total 5525 3312 2213 2784 1680 1104
Table 1. Number of Montesinos and clasp Montesinos knots per number of crossings.

At this moment, we are unable to list Montesinos knots with more than 14 crossings using our algorithm, since SnapPy is currently unable to identify knots with more than 14 crossings.

5. Tunnel numbers of 11 and 12 crossing knots

We use KnotInfo [17] to obtain the bridge number of all 11 or 12 crossing knots. Notice that the bridge number of all knots with 11 and 12 crossings is at most four.

Proposition 5.1.

The tunnel number of all 1655 alternating 11 or 12 crossing knots has been calculated.

Proof.

Choose one of the 11 or 12 crossing alternating knots from the list. Let KK be this knot. Using the bridge number data from KnotInfo [17], we have three cases.

Case 1: If b(K)=2b(K)=2, then t(K)=1t(K)=1 by Theorem 3.6.

Case 2: Assume b(K)=3b(K)=3. Using Corollary 4.3, we check if KK is a clasp Montesinos knot, and then we apply Corollary 3.7. If KK is a clasp Montesinos knot, then t(K)=1t(K)=1. Otherwise, we have t(K)=2t(K)=2.

Case 3: If b(K)=4b(K)=4, we again apply Corollary 4.3 to check whether KK is a clasp Montesinos knot. Every knot in this case is a Montesinos knot. If KK is a clasp Montesinos knot, then Corollary 3.7 implies that it must have tunnel number two. This leaves exactly two knots, 12a0554 and 12a0750, which are non-clasp Montesinos knots. We now apply Theorem 3.5. 12a0554 is the knot M(0;2/3,2/3,2/3,1/3)M(0;2/3,2/3,2/3,1/3) and 12a0750 is the knot M(0;2/3,1/3,1/3,1/3)M(0;2/3,1/3,1/3,1/3), both of which have α=3\alpha=3, hence, tunnel number three. ∎

We obtain that there are 145 and 222 alternating 11 crossing knots with tunnel numbers one and two, respectively. For the alternating 12 crossing knots, there are 315, 971, and 2 knots with tunnel numbers one, two, and three, respectively. This information can be found in Table 2.

Alternating: 1655 11 crossings: 367
2-bridge:
91
Tunnel number 1:
91
3-bridge: 270 Montesinos: 91
Clasp:
54
α=1\alpha=1:
54
Tunnel number 1:
54
Non-clasp: 37
α=1\alpha=1:
35
Tunnel number 2: 37
α1\alpha\neq 1:
2
Non-Montesinos:
179
Tunnel number 2:
179
4-bridge:
6
Montesinos:
6
Clasp:
6
α=1\alpha=1:
6
Tunnel number 2:
6
12 crossings: 1288
2-bridge:
176
Tunnel number 1:
176
3-bridge: 1090 Montesinos: 261
Clasp:
139
α=1\alpha=1:
139
Tunnel number 1:
139
Non-clasp: 122
α=1\alpha=1:
100
Tunnel number 2: 122
α1\alpha\neq 1:
22
Non-Montesinos:
829
Tunnel number 2:
829
4-bridge: 22 Montesinos: 22
Clasp:
20
α=1\alpha=1:
20
Tunnel number 2:
20
Non-clasp:
2
α1\alpha\neq 1:
2
Tunnel number 3:
2
Table 2. Identification of tunnel number for alternating knots with 11 and 12 crossings.
Proposition 5.2.

The tunnel number of 881 non-alternating 11 or 12 crossing knots has been calculated.

Proof.

We follow the same procedure as in the proof of Proposition 5.1. In this case, we also need to employ Theorem 3.9, Proposition 3.10222The Nakanishi indices of knots with 10 crossings or fewer are known and we obtained them from KnotInfo [17]. We obtained the Nakanishi indices of knots with 11 and 12 crossings from the Knotorious website [4], but for many of these knots only upper and lower bounds for the Nakanishi index are known. By using Proposition 3.10, we are able to find an additional 82 knots with Nakanishi index 1 which were not identified by Knotorious., Theorem 3.11, and Method 3.12. Specific details can be found in Table 3. ∎

We have identified 144, 732, and 5 non-alternating 11 or 12 crossing knots with with tunnel numbers one, two, and three, respectively. This data can be found in Table 3.

Non-alternating: 1073 11 crossings: 185 3-bridge: 176 Montesinos: 58
Clasp:
32
α=1\alpha=1:
32
Tunnel number 1:
32
Identified by:
3.7, 3.8, 3.12
Non-clasp: 26 α=1\alpha=1: 26
Tunnel number 1:
2
Identified by:
3.8, 3.12
Tunnel number 2:
24
Identified by:
3.8, 3.9, 3.10
Non-Montesinos: 118
Tunnel number 1:
5
Identified by:
3.12
Tunnel number 2:
71
Identified by:
3.9, 3.10, 3.11
Tunnel number {1,2}\in\left\{{1,2}\right\}:
42
4-bridge:
9
Montesinos:
9
Clasp:
9
α=1\alpha=1:
9
Tunnel number 2:
9
Identified by:
3.8, 3.10
12 crossings: 888 3-bridge: 862 Montesinos: 170
Clasp:
85
α=1\alpha=1:
85
Tunnel number 1:
85
Identified by:
3.7, 3.8, 3.12
Non-clasp: 85 α=1\alpha=1: 65
Tunnel number 1:
2
Identified by:
3.8, 3.12
Tunnel number 2:
63
Identified by:
3.8, 3.9, 3.10
α1\alpha\neq 1:
20
Tunnel number 2:
20
Identified by:
3.5, 3.8, 3.9, 3.10
Non-Montesinos: 692
Tunnel number 1:
18
Identified by:
3.12
Tunnel number 2:
524
Identified by:
3.9, 3.10, 3.11
Tunnel number {1,2}\in\left\{{1,2}\right\}:
150
4-bridge: 26 Montesinos: 26
Clasp:
21
α=1\alpha=1:
21
Tunnel number 2:
21
Identified by:
3.8, 3.10
Non-clasp:
5
α1\alpha\neq 1:
5
Tunnel number 3:
5
Identified by:
3.5
Table 3. Identification of tunnel number for non-alternating knots with 11 and 12 crossings.

Table 4 shows the relative effectiveness of each criterion in computing tunnel number. In particular, Method 3.12 was able to identify all 756 tunnel number one knots known to us; this includes 23 non-alternating tunnel number one knots which were not identified by any other criterion.

Criteria
Amount of tunnel
numbers identified
with this criterion
% of tunnel
numbers identified
with this criterion
Corollary 3.4 364 14.35%
Theorem 3.5 57 2.24%
Theorem 3.6, Corollary 3.7 1903 75.04%
Theorem 3.8 714 28.15%
Theorem 3.9 1366 53.86%
Proposition 3.10 362 14.27%
Theorem 3.11 89 3.51%
Total amount of tunnel numbers identified 2536 100%
Table 4. Relative effectiveness of each criterion in computing tunnel number, out of the 2536 tunnel numbers that we know of knots with 12 crossings or fewer. Propositions 3.1 and 3.3 are used implicitly.

We have been unable to identify the tunnel number of 192 of the non-altenating knots with 11 and 12 crossings. The tunnel number of these 192 knots can be bounded above by Theorem 3.1 and Corollary 3.4, so these knots have tunnel number at most two. Based on the effectiveness of Method 3.12, we conjecture that all of these 192 knots have tunnel number two.

Overall, of the 2728 total knots with 11 and 12 crossings, we have found 2536 tunnel numbers. Combining Propositions 5.1 and 5.2, we obtain Theorem 1.1.

6. Future directions

Some alternative methods to compute tunnel number not used in this paper include computing Yamada’s invariant of spatial graphs [23], finding better methods to compute the Nakanishi indices of knots, or implementing the algorithms by Lackenby [14] or Li [15].

A possible continuation of this work includes computing the tunnel numbers of knots with 13 or more crossings. In this case, it would be useful to have a list of Nakanishi indices of knots with 13 or more crossings (possibly computed using the Knotorious program [4]). The bridge indices of knots up to 16 crossings can be found from [2] and the list of Montesinos knots up to 14 knots can be found from this paper.

We hope that our tunnel number data can be used to make a list of bridge spectra of knots [29], to help conjecture a full characterization of tunnel number two knots, or as evidence for or against the Rank-Genus conjecture for knots [16, Question 2].

Appendix A List of tunnel numbers

11 and 12 crossing knots with tunnel number one:

11aXX with X=X= 1, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 16, 21, 23, 31, 32, 33, 34, 35, 36, 37, 39, 40, 41, 42, 45, 46, 48, 50, 51, 55, 56, 58, 59, 60, 61, 62, 63, 64, 65, 74, 75, 77, 82, 83, 84, 85, 89, 90, 91, 92, 93, 94, 95, 96, 98, 110, 111, 117, 118, 119, 120, 121, 140, 144, 145, 153, 154, 159, 161, 166, 174, 175, 176, 177, 178, 179, 180, 182, 183, 184, 185, 186, 188, 190, 191, 192, 193, 195, 203, 204, 205, 206, 207, 208, 210, 211, 220, 221, 222, 224, 225, 226, 229, 230, 234, 235, 236, 238, 240, 241, 242, 243, 245, 246, 247, 257, 258, 259, 260, 306, 307, 308, 309, 310, 311, 333, 334, 335, 336, 337, 339, 341, 342, 343, 355, 356, 357, 358, 359, 360, 363, 364, 365, 367.

11nXX with X=X= 1, 2, 3, 12, 13, 14, 15, 16, 17, 18, 19, 20, 28, 29, 30, 38, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 70, 79, 96, 102, 104, 111, 135, 143, 145.

12aXX with X=X= 3, 9, 12, 16, 17, 18, 19, 20, 21, 22, 24, 25, 26, 27, 28, 31, 32, 34, 35, 37, 38, 42, 56, 62, 77, 78, 81, 82, 83, 84, 85, 86, 87, 95, 96, 97, 98, 99, 104, 106, 110, 112, 118, 121, 124, 128, 130, 141, 142, 143, 144, 145, 146, 147, 148, 149, 151, 152, 153, 158, 159, 160, 161, 165, 168, 169, 170, 171, 172, 173, 174, 175, 176, 178, 179, 180, 181, 183, 193, 194, 196, 197, 203, 204, 205, 206, 210, 212, 221, 226, 234, 235, 236, 237, 238, 239, 240, 241, 242, 243, 246, 247, 251, 254, 255, 257, 258, 259, 299, 300, 302, 303, 304, 305, 306, 307, 329, 330, 345, 378, 379, 380, 384, 385, 406, 420, 421, 422, 423, 424, 425, 436, 437, 447, 454, 463, 471, 477, 482, 497, 498, 499, 500, 501, 502, 506, 507, 508, 510, 511, 512, 514, 517, 518, 519, 520, 521, 522, 528, 532, 533, 534, 535, 536, 537, 538, 539, 540, 541, 544, 545, 549, 550, 551, 552, 579, 580, 581, 582, 583, 584, 585, 591, 595, 596, 597, 600, 601, 643, 644, 649, 650, 651, 652, 669, 681, 682, 684, 689, 690, 691, 713, 714, 715, 716, 717, 718, 720, 721, 722, 723, 724, 726, 727, 728, 729, 731, 732, 733, 736, 738, 740, 743, 744, 745, 757, 758, 759, 760, 761, 762, 763, 764, 772, 773, 774, 775, 789, 790, 791, 792, 794, 795, 796, 797, 800, 802, 803, 822, 823, 826, 827, 835, 836, 837, 838, 839, 840, 842, 843, 876, 877, 878, 879, 880, 881, 882, 937, 938, 1023, 1024, 1029, 1030, 1033, 1034, 1039, 1040, 1125, 1126, 1127, 1128, 1129, 1130, 1131, 1132, 1133, 1134, 1135, 1136, 1138, 1139, 1140, 1145, 1146, 1148, 1149, 1157, 1158, 1159, 1161, 1162, 1163, 1165, 1166, 1214, 1273, 1274, 1275, 1276, 1277, 1278, 1279, 1281, 1282, 1287.

12nXX with X=X= 11, 12, 13, 25, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 54, 65, 77, 78, 79, 121, 150, 151, 152, 153, 154, 155, 159, 160, 161, 162, 163, 164, 165, 166, 167, 168, 169, 170, 171, 172, 198, 199, 200, 218, 233, 234, 235, 236, 237, 238, 239, 240, 241, 242, 243, 244, 248, 249, 250, 251, 288, 289, 293, 303, 304, 305, 306, 307, 308, 309, 310, 352, 370, 371, 374, 404, 433, 446, 464, 483, 487, 488, 500, 501, 502, 503, 552, 575, 579, 591, 594, 624, 650, 721, 722, 723, 724, 725, 726, 749, 851.

11 and 12 crossing knots with tunnel number two:

11aXX with X=X= 2, 3, 14, 15, 17, 18, 19, 20, 22, 24, 25, 26, 27, 28, 29, 30, 38, 43, 44, 47, 49, 52, 53, 54, 57, 66, 67, 68, 69, 70, 71, 72, 73, 76, 78, 79, 80, 81, 86, 87, 88, 97, 99, 100, 101, 102, 103, 104, 105, 106, 107, 108, 109, 112, 113, 114, 115, 116, 122, 123, 124, 125, 126, 127, 128, 129, 130, 131, 132, 133, 134, 135, 136, 137, 138, 139, 141, 142, 143, 146, 147, 148, 149, 150, 151, 152, 155, 156, 157, 158, 160, 162, 163, 164, 165, 167, 168, 169, 170, 171, 172, 173, 181, 187, 189, 194, 196, 197, 198, 199, 200, 201, 202, 209, 212, 213, 214, 215, 216, 217, 218, 219, 223, 227, 228, 231, 232, 233, 237, 239, 244, 248, 249, 250, 251, 252, 253, 254, 255, 256, 261, 262, 263, 264, 265, 266, 267, 268, 269, 270, 271, 272, 273, 274, 275, 276, 277, 278, 279, 280, 281, 282, 283, 284, 285, 286, 287, 288, 289, 290, 291, 292, 293, 294, 295, 296, 297, 298, 299, 300, 301, 302, 303, 304, 305, 312, 313, 314, 315, 316, 317, 318, 319, 320, 321, 322, 323, 324, 325, 326, 327, 328, 329, 330, 331, 332, 338, 340, 344, 345, 346, 347, 348, 349, 350, 351, 352, 353, 354, 361, 362, 366.

11nXX with X=X= 4, 5, 6, 7, 8, 9, 10, 11, 21, 22, 23, 24, 25, 26, 27, 31, 32, 33, 34, 35, 36, 37, 39, 40, 41, 42, 43, 44, 46, 47, 48, 49, 50, 67, 68, 69, 71, 72, 73, 74, 75, 76, 77, 78, 80, 81, 82, 83, 84, 85, 87, 88, 89, 90, 91, 93, 97, 100, 101, 103, 105, 106, 107, 108, 109, 110, 114, 116, 120, 122, 124, 126, 128, 129, 130, 131, 132, 133, 134, 137, 138, 139, 140, 141, 147, 148, 151, 154, 157, 159, 160, 162, 164, 165, 166, 167, 172, 174, 175, 176, 177, 183, 184, 185.

12aXX with X=X= 1, 2, 4, 5, 6, 7, 8, 10, 11, 13, 14, 15, 23, 29, 30, 33, 36, 39, 40, 41, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 57, 58, 59, 60, 61, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 79, 80, 88, 89, 90, 91, 92, 93, 94, 100, 101, 102, 103, 105, 107, 108, 109, 111, 113, 114, 115, 116, 117, 119, 120, 122, 123, 125, 126, 127, 129, 131, 132, 133, 134, 135, 136, 137, 138, 139, 140, 150, 154, 155, 156, 157, 162, 163, 164, 166, 167, 177, 182, 184, 185, 186, 187, 188, 189, 190, 191, 192, 195, 198, 199, 200, 201, 202, 207, 208, 209, 211, 213, 214, 215, 216, 217, 218, 219, 220, 222, 223, 224, 225, 227, 228, 229, 230, 231, 232, 233, 244, 245, 248, 249, 250, 252, 253, 256, 260, 261, 262, 263, 264, 265, 266, 267, 268, 269, 270, 271, 272, 273, 274, 275, 276, 277, 278, 279, 280, 281, 282, 283, 284, 285, 286, 287, 288, 289, 290, 291, 292, 293, 294, 295, 296, 297, 298, 301, 308, 309, 310, 311, 312, 313, 314, 315, 316, 317, 318, 319, 320, 321, 322, 323, 324, 325, 326, 327, 328, 331, 332, 333, 334, 335, 336, 337, 338, 339, 340, 341, 342, 343, 344, 346, 347, 348, 349, 350, 351, 352, 353, 354, 355, 356, 357, 358, 359, 360, 361, 362, 363, 364, 365, 366, 367, 368, 369, 370, 371, 372, 373, 374, 375, 376, 377, 381, 382, 383, 386, 387, 388, 389, 390, 391, 392, 393, 394, 395, 396, 397, 398, 399, 400, 401, 402, 403, 404, 405, 407, 408, 409, 410, 411, 412, 413, 414, 415, 416, 417, 418, 419, 426, 427, 428, 429, 430, 431, 432, 433, 434, 435, 438, 439, 440, 441, 442, 443, 444, 445, 446, 448, 449, 450, 451, 452, 453, 455, 456, 457, 458, 459, 460, 461, 462, 464, 465, 466, 467, 468, 469, 470, 472, 473, 474, 475, 476, 478, 479, 480, 481, 483, 484, 485, 486, 487, 488, 489, 490, 491, 492, 493, 494, 495, 496, 503, 504, 505, 509, 513, 515, 516, 523, 524, 525, 526, 527, 529, 530, 531, 542, 543, 546, 547, 548, 553, 555, 556, 557, 558, 559, 560, 561, 562, 563, 564, 565, 566, 567, 568, 569, 570, 571, 572, 573, 574, 575, 576, 577, 578, 586, 587, 588, 589, 590, 592, 593, 594, 598, 599, 602, 603, 604, 605, 606, 607, 608, 609, 610, 611, 612, 613, 614, 615, 616, 617, 618, 619, 620, 621, 622, 623, 624, 625, 626, 627, 628, 629, 630, 631, 632, 633, 634, 635, 636, 637, 638, 639, 640, 641, 642, 645, 646, 647, 648, 653, 654, 655, 656, 657, 658, 659, 660, 661, 662, 663, 664, 665, 666, 667, 668, 670, 671, 672, 673, 674, 675, 676, 677, 678, 679, 680, 683, 685, 686, 687, 688, 692, 693, 694, 695, 696, 697, 698, 699, 700, 701, 702, 703, 704, 705, 706, 707, 708, 709, 710, 711, 712, 719, 725, 730, 734, 735, 737, 739, 741, 742, 746, 747, 748, 749, 751, 752, 753, 754, 755, 756, 765, 766, 767, 768, 769, 770, 771, 776, 777, 778, 779, 780, 781, 782, 783, 784, 785, 786, 787, 788, 793, 798, 799, 801, 804, 805, 806, 807, 808, 809, 810, 811, 812, 813, 814, 815, 816, 817, 818, 819, 820, 821, 824, 825, 828, 829, 830, 831, 832, 833, 834, 841, 844, 845, 846, 847, 848, 849, 850, 851, 852, 853, 854, 855, 856, 857, 858, 859, 860, 861, 862, 863, 864, 865, 866, 867, 868, 869, 870, 871, 872, 873, 874, 875, 883, 884, 885, 886, 887, 888, 889, 890, 891, 892, 893, 894, 895, 896, 897, 898, 899, 900, 901, 902, 903, 904, 905, 906, 907, 908, 909, 910, 911, 912, 913, 914, 915, 916, 917, 918, 919, 920, 921, 922, 923, 924, 925, 926, 927, 928, 929, 930, 931, 932, 933, 934, 935, 936, 939, 940, 941, 942, 943, 944, 945, 946, 947, 948, 949, 950, 951, 952, 953, 954, 955, 956, 957, 958, 959, 960, 961, 962, 963, 964, 965, 966, 967, 968, 969, 970, 971, 972, 973, 974, 975, 976, 977, 978, 979, 980, 981, 982, 983, 984, 985, 986, 987, 988, 989, 990, 991, 992, 993, 994, 995, 996, 997, 998, 999, 1000, 1001, 1002, 1003, 1004, 1005, 1006, 1007, 1008, 1009, 1010, 1011, 1012, 1013, 1014, 1015, 1016, 1017, 1018, 1019, 1020, 1021, 1022, 1025, 1026, 1027, 1028, 1031, 1032, 1035, 1036, 1037, 1038, 1041, 1042, 1043, 1044, 1045, 1046, 1047, 1048, 1049, 1050, 1051, 1052, 1053, 1054, 1055, 1056, 1057, 1058, 1059, 1060, 1061, 1062, 1063, 1064, 1065, 1066, 1067, 1068, 1069, 1070, 1071, 1072, 1073, 1074, 1075, 1076, 1077, 1078, 1079, 1080, 1081, 1082, 1083, 1084, 1085, 1086, 1087, 1088, 1089, 1090, 1091, 1092, 1093, 1094, 1095, 1096, 1097, 1098, 1099, 1100, 1101, 1102, 1103, 1104, 1105, 1106, 1107, 1108, 1109, 1110, 1111, 1112, 1113, 1114, 1115, 1116, 1117, 1118, 1119, 1120, 1121, 1122, 1123, 1124, 1137, 1141, 1142, 1143, 1144, 1147, 1150, 1151, 1152, 1153, 1154, 1155, 1156, 1160, 1164, 1167, 1168, 1169, 1170, 1171, 1172, 1173, 1174, 1175, 1176, 1177, 1178, 1179, 1180, 1181, 1182, 1183, 1184, 1185, 1186, 1187, 1188, 1189, 1190, 1191, 1192, 1193, 1194, 1195, 1196, 1197, 1198, 1199, 1200, 1201, 1202, 1203, 1204, 1205, 1206, 1207, 1208, 1209, 1210, 1211, 1212, 1213, 1215, 1216, 1217, 1218, 1219, 1220, 1221, 1222, 1223, 1224, 1225, 1226, 1227, 1228, 1229, 1230, 1231, 1232, 1233, 1234, 1235, 1236, 1237, 1238, 1239, 1240, 1241, 1242, 1243, 1244, 1245, 1246, 1247, 1248, 1249, 1250, 1251, 1252, 1253, 1254, 1255, 1256, 1257, 1258, 1259, 1260, 1261, 1262, 1263, 1264, 1265, 1266, 1267, 1268, 1269, 1270, 1271, 1272, 1280, 1283, 1284, 1285, 1286, 1288.

12nXX with X=X= 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 14, 15, 17, 18, 19, 20, 21, 22, 23, 24, 26, 27, 28, 29, 30, 31, 32, 33, 34, 49, 50, 51, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 80, 81, 82, 83, 84, 85, 86, 87, 89, 90, 91, 92, 93, 94, 95, 96, 97, 98, 99, 100, 101, 102, 103, 104, 105, 106, 107, 108, 109, 110, 111, 112, 113, 114, 115, 116, 117, 118, 119, 120, 122, 123, 124, 125, 126, 127, 128, 129, 130, 131, 132, 133, 134, 135, 136, 137, 138, 139, 140, 141, 142, 143, 144, 145, 146, 147, 148, 149, 173, 174, 175, 176, 177, 178, 179, 180, 181, 182, 183, 184, 185, 186, 187, 188, 189, 190, 191, 192, 193, 194, 195, 196, 197, 201, 202, 203, 205, 206, 208, 209, 210, 212, 213, 214, 215, 216, 217, 219, 220, 221, 222, 223, 224, 225, 226, 227, 229, 231, 232, 252, 253, 254, 255, 256, 257, 259, 261, 262, 263, 264, 265, 266, 267, 268, 269, 270, 271, 272, 273, 274, 275, 276, 277, 278, 281, 286, 290, 291, 292, 294, 295, 296, 297, 298, 300, 301, 302, 312, 313, 315, 316, 317, 318, 319, 320, 322, 323, 324, 325, 326, 327, 331, 332, 333, 334, 335, 336, 337, 338, 339, 340, 341, 342, 343, 344, 345, 346, 347, 348, 349, 350, 351, 353, 355, 356, 357, 358, 359, 360, 361, 362, 363, 364, 365, 366, 367, 368, 369, 372, 376, 378, 379, 380, 381, 382, 384, 385, 386, 387, 388, 389, 390, 393, 394, 396, 397, 398, 399, 400, 401, 402, 403, 405, 406, 407, 408, 409, 410, 412, 413, 414, 415, 418, 419, 420, 421, 422, 423, 424, 427, 428, 429, 430, 431, 434, 435, 436, 437, 440, 442, 444, 447, 448, 454, 455, 456, 457, 460, 461, 462, 463, 465, 466, 467, 468, 469, 470, 471, 472, 473, 474, 475, 476, 477, 478, 479, 480, 484, 485, 491, 492, 493, 494, 495, 496, 497, 498, 504, 505, 506, 507, 508, 509, 510, 512, 513, 514, 515, 516, 517, 518, 520, 522, 523, 526, 528, 529, 530, 531, 532, 533, 534, 536, 539, 540, 541, 545, 546, 547, 549, 550, 557, 558, 559, 560, 561, 562, 563, 564, 565, 566, 567, 568, 569, 570, 571, 572, 573, 574, 576, 577, 578, 581, 582, 583, 584, 586, 588, 589, 590, 592, 593, 597, 598, 599, 600, 601, 602, 604, 605, 606, 607, 608, 609, 611, 614, 616, 617, 618, 619, 620, 621, 622, 623, 626, 627, 630, 631, 633, 634, 635, 636, 637, 640, 641, 643, 644, 645, 646, 647, 648, 649, 651, 652, 654, 655, 656, 657, 658, 659, 660, 661, 662, 665, 666, 669, 670, 672, 673, 674, 675, 676, 677, 678, 679, 680, 681, 682, 683, 684, 685, 686, 687, 688, 689, 690, 693, 694, 695, 696, 697, 698, 699, 701, 702, 703, 704, 705, 706, 708, 709, 710, 711, 712, 713, 714, 715, 716, 717, 719, 720, 727, 728, 729, 730, 731, 732, 733, 734, 735, 736, 737, 738, 742, 745, 746, 747, 748, 752, 753, 755, 756, 757, 758, 760, 761, 762, 763, 764, 765, 766, 767, 768, 769, 770, 771, 772, 773, 774, 775, 776, 778, 779, 780, 781, 782, 783, 784, 786, 787, 788, 789, 790, 791, 792, 793, 794, 795, 796, 797, 798, 799, 800, 802, 806, 812, 813, 816, 817, 819, 826, 827, 828, 831, 834, 836, 837, 838, 839, 840, 841, 842, 843, 844, 846, 847, 848, 852, 853, 854, 857, 858, 859, 861, 862, 863, 864, 865, 866, 869, 870, 871, 872, 873, 874, 876, 877, 878, 879, 881, 883, 884, 885, 887, 888.

11 and 12 crossing knots with tunnel number three:

12aXX with X=X= 554, 750.

12nXX with X=X= 553, 554, 555, 556, 642.

11 and 12 crossing knots with tunnel number {1,2}\in\left\{{1,2}\right\}:

11nXX with X=X= 45, 65, 66, 86, 92, 94, 95, 98, 99, 112, 113, 115, 117, 118, 119, 121, 123, 125, 127, 136, 142, 144, 146, 149, 150, 152, 153, 155, 156, 158, 161, 163, 168, 169, 170, 171, 173, 178, 179, 180, 181, 182.

12nXX with X=X= 16, 52, 53, 88, 156, 157, 158, 204, 207, 211, 228, 230, 245, 246, 247, 258, 260, 279, 280, 282, 283, 284, 285, 287, 299, 311, 314, 321, 328, 329, 330, 354, 373, 375, 377, 383, 391, 392, 395, 411, 416, 417, 425, 426, 432, 438, 439, 441, 443, 445, 449, 450, 451, 452, 453, 458, 459, 481, 482, 486, 489, 490, 499, 511, 519, 521, 524, 525, 527, 535, 537, 538, 542, 543, 544, 548, 551, 580, 585, 587, 595, 596, 603, 610, 612, 613, 615, 625, 628, 629, 632, 638, 639, 653, 663, 664, 667, 668, 671, 691, 692, 700, 707, 718, 739, 740, 741, 743, 744, 750, 751, 754, 759, 777, 785, 801, 803, 804, 805, 807, 808, 809, 810, 811, 814, 815, 818, 820, 821, 822, 823, 824, 825, 829, 830, 832, 833, 835, 845, 849, 850, 855, 856, 860, 867, 868, 875, 880, 882, 886.

References