Given a knot, what's the minimal genus of a torus the knot is embeddable on?

To make use of the idea that bridge number bounds the embeddability number, let's put $6_2$ into bridge position first:

Bridge position

One way to get a surface for any knot is to make a tube that follows the entire knot, but the resulting torus isn't a "standardly embedded surface." A way to think of bridge position is that you are taking two unknotted $n$-tangles and gluing the boundaries together using some homeomorphism (the braid in the middle is a way to represent the homeomorphism, since there is a surjective homomorphism from the braid group $B_{2n}$ to the the mapping class group of the $2n$-punctured sphere), so by putting the "top" tangle on the $2n$-punctured sphere and the "bottom" tangle on $n$ tubes, the composite is a standardly embedded genus-$n$ surface.

Concretely, here is a genus $2$-surface for the bridge position above:

A genus two surface with the knot

Why is this standardly embedded? Notice that the punctured sphere at the top can eat up the braid; the attached handles can freely move around, carrying the embedded knot with it. For example, here is one step of consuming the braid:

One braid generator consumed

Fully consumed, the result is what one might call "a mess," but at least it's clear that the resulting genus-$2$ surface is standard:

The knot on a standard genus-2 surface

The blue is supposed to represent the surface, a sphere with two tubes glued into it.

To calculate this, I made use of a structure called a traintrack on the punctured sphere to represent the two arcs between the punctures. As the braid acts on this pair of arcs, you can coalesce parallel segments into a single segment by allowing railroad switchers (or what I internally call splitters), then writing the weight on the segment to account for how many parallel tracks it is representing. An observation is that you only need to calculate what happens with one of the two arcs since there is only a single way, up to isotopy, to draw in the second arc. Hopefully this is enough information to make sense of the following computation, where each numbered step represents having consumed another braid generator:

Traintrack computation

A way of thinking about $n$-embeddability is that one wants a genus-$n$ Heegaard splitting of $S^3$ with the knot embedded in the splitting surface. This is related to the tunnel number $t(K)$ of the knot, but I'm not sure what the exact relation is.

One thing to notice about the surface obtained from the bridge position above is that each tube contains only a single strand, which seems potentially inefficient. This might give some intuition for why the bridge number is merely an upper bound for embeddability. However, it's known that $6_3$ is not a torus knot so the upper bound is sharp.


To add on to Kyle Miller's answer, the relation between tunnel number and $n$-embeddable invariants is $t(K)\leq n $. There is another invariant called the genus $g$ bridge number, $b_g(k)$, which generalizes bridge knot to a family of invariants, and $b_0(K)$ is the classical bridge number. (There are a few definitions that vary slightly here depending on the author.) If $b_g(K) = 0$ for some $g$, then $K$ embeds on a genus $g$ surface and is primitive ( but you can mostly ignore this at the moment.) From here, you can get a better bounds on tunnel number, $t(K) \leq b_g(K) +g -1$.

Now, for the question you ask about Bridge number being an upper bound for $n$-embeddable, you can see this by the fact that $b_g(K)\geq b_{g+1}(K) +1$. In other words, genus $g$ bridge numbers must decrease at every step. So if $b(K) = b_0(K) = n$, then we must have $b_n(K) = 0$, and $K$ embeds on a genus $n$ surface, but maybe it can be embedded on a lower genus link.

Sometimes $n$-embeddable is referred to as the Heegaard genus of a knot, $h(K)$.

Last, again to follow Kyle's answer, the original definition of bridge number was the minimum number of "bridges" a diagram can have, which are any arc which has only over crossings. Kyle's fourth picture is an example of this. Every $n$ bridge knot has a similar diagram which has $n$ arcs that go over the rest of the knot. Then we can make a surface that has a handle for each bridge.