An upper bound of the superbridge index of the connected sum of two knots is given in terms of the braid index of the summands. Using this upper bound and minimal polygonal presentations, we give an upper bound in terms of the superbridge index and the bridge index of the summands when they are torus knots. In contrast to the fact that the difference between the sum of bridge indices of two knots and the bridge index of their connected sum is always one, the corresponding difference for the superbridge index can be arbitrarily large.
We improve the upper bound on the superbridge index $sb[K]$ of a knot type $[K]$ in terms of the bridge index $b[K]$ from $sb[K] \leq 5b -3$ to $sb[K]\leq 3b[k] - 1$.
Previous work used polygonal realizations of knots to reduce the problem of computing the superbridge number of a realization to a linear programming problem, leading to new sharp upper bounds on the superbridge index of a number of knots. The present work extends this technique to polygonal realizations with an odd number of edges and determines the exact superbridge index of many new knots, including the majority of the 9-crossing knots for which it was previously unknown and, for the first time, several 12-crossing knots. Interestingly, at least half of these superbridge-minimizing polygona…
This paper gives new upper bounds on the stick numbers of the knots $9_{18}$, $10_{18}$, $10_{58}$, $10_{66}$, $10_{68}$, $10_{80}$, $10_{82}$, $10_{84}$, $10_{93}$, $10_{100}$, and $10_{152}$, as well as on the equilateral stick number of $10_{79}$. These bounds imply that the knots $10_{58}$, $10_{66}$, and $10_{80}$ have superbridge index $\leq 5$, completing the project of showing that no prime knots through 10 crossings can have superbridge index larger than 5. The current best bounds on stick number and superbridge index for prime knots through 10 crossings are given in Appendix A.
The knots $8_1$, $8_2$, $8_3$, $8_5$, $8_6$, $8_7$, $8_8$, $8_{10}$, $8_{11}$, $8_{12}$, $8_{13}$, $8_{14}$, $8_{15}$, $9_7$, $9_{16}$, $9_{20}$, $9_{26}$, $9_{28}$, $9_{32}$, and $9_{33}$ all have superbridge index equal to 4. This follows from new upper bounds on superbridge index not coming from the stick number and increases the number of knots from the Rolfsen table for which superbridge index is known from 29 to 49. Appendix A gives the current state of knowledge of superbridge index for prime knots through 10 crossings.
A petal projection of a knot $K$ is a projection of a knot which consists of a single multi-crossing and non-nested loops. Since a petal projection gives a sequence of natural numbers for a given knot, the petal projection is a useful model to study knot theory. It is known that every knot has a petal projection. A petal number $p(K)$ is the minimum number of loops required to represent the knot $K$ as a petal projection. In this paper, we find the relation between a superbridge index and a petal number of an arbitrary knot. By using this relation, we find the petal number of $T_{r,s}$ as foll…
We present a short proof of a theorem of Tanaka that if a composite ribbon knot admits a symmetric union presentation with one twisting region, then it has a non-trivial knot and its mirror image as connected summands.
A knot $κ$ in $S^3$ is persistently foliar if, for each non-trivial boundary slope, there is a co-oriented taut foliation meeting the boundary of the knot complement transversely in a foliation by curves of that slope. For rational slopes, these foliations may be capped off by disks to obtain a co-oriented taut foliation in every manifold obtained by non-trivial Dehn surgery on that knot. We show that any composite knot with a persistently foliar summand is persistently foliar and that any nontrivial connected sum of fibered knots is persistently foliar. As an application, it follows that any …
We study the minimal crossing number $c(K_{1}\# K_{2})$ of composite knots $K_{1}\# K_{2}$, where $K_1$ and $K_2$ are prime, by relating it to the minimal crossing number of spatial graphs, in particular the $2n$-theta curve $θ_{K_{1},K_{2}}^n$ that results from tying $n$ of the edges of the planar embedding of the $2n$-theta graph into $K_1$ and the remaining $n$ edges into $K_2$. We prove that for large enough $n$ we have $c(θ_{K_1,K_2}^n)=n(c(K_1)+c(K_2))$. We also formulate additional relations between the crossing numbers of certain spatial graphs that, if satisfied, imply the additivity …
Connected sum and trivalent vertex sum are natural operations on genus 2 spatial graphs and, as with knots, tunnel number behaves in interesting ways under these operations. We prove sharp Scharlemann-Schultens type bounds for the tunnel number of a composite genus 2 spatial graph. For the tunnel number of a composite Brunnian $θ$-curve, our result implies that the tunnel number is at least the number of summands, as in the knot case. We also prove a version of a theorem of Morimoto for knots: the tunnel number of a composite m-small genus 2 spatial graph is at least the sum of the tunnel numb…
