Related papers: Crossing numbers of cable knots
Birman-Menasco proved that there are finitely many knots having a given genus and braid index. We give a quantitative version of Birman-Menasco finiteness theorem, an estimate of the crossing number of knots in terms of genus and braid…
This is the third of three papers that refine and extend portions of our earlier preprint, "The depth of a knot tunnel." Together, they rework the entire preprint. In this paper, we use the theory of tunnel number 1 knots that we introduced…
We study Kauffman's model of folded ribbon knots: knots made of a thin strip of paper folded flat in the plane. The ribbonlength is the length to width ratio of such a folded ribbon knot. We show for any knot or link type that there exist…
This is a report on our ongoing research on a combinatorial approach to knot recognition, using coloring of knots by certain algebraic objects called quandles. The aim of the paper is to summarize the mathematical theory of knot coloring in…
For a connected graph, we define the proper-walk connection number as the minimum number of colors needed to color the edges of a graph so that there is a walk between every pair of vertices without two consecutive edges having the same…
Disentangling two or more cables requires many steps to remove crossings between and within cables. We formalize the problem of disentangling multiple cables and present an algorithm, Iterative Reduction Of Non-planar Multiple cAble kNots…
We calculate Jones polynomials $V(H_r,t)$ for a family of alternating knots and links $H_r$ with arbitrarily many crossings $r$, by computing the Tutte polynomials $T(G_+(H_r),x,y)$ for the associated graphs $G_+(H_r)$ and evaluating these…
The knot Floer order $\operatorname{Ord}(K)$ is a knot invariant derived from knot Floer homology that provides bounds on many other invariants, such as the bridge index $\operatorname{br}(K)$ for which $\operatorname{Ord}(K) + 1 \leq…
An \"{u}bercrossing diagram is a knot diagram with only one crossing that may involve more than two strands of the knot. Such a diagram without any nested loops is called a petal projection. Every knot has a petal projection from which the…
We consider the number of colors for the colorings of links by the symmetric group $S_3$ of degree $3$. For knots, such a coloring corresponds to a Fox 3-coloring, and thus the number of colors must be 1 or 3. However, for links, there are…
The Slope Conjecture relates a quantum knot invariant, (the degree of the colored Jones polynomial of a knot) with a classical one (boundary slopes of incompressible surfaces in the knot complement). The degree of the colored Jones…
Since the crossing number of K_{12} is now known to be 150, it is well-known that simple counting arguments and Kleitman's parity theorem for the crossing number of K_{2n+1} combine with a specific drawing of K_{13} to show that the…
We discuss the polynomial representation for long knots and elaborate on how to obtain them with a bound on degrees of the defining polynomials, for any knot-type.
The 2-loop polynomial is a polynomial presenting the 2-loop part of the Kontsevich invariant of knots. We show a cabling formula for the 2-loop polynomial of knots. In particular, we calculate the 2-loop polynomial for torus knots.
The genus non-increasing totally positive unknotting number is the minimum number of crossing changes that transform a knot into the unknot, such that all the crossing changes are positive-to-negative crossing changes that do not increase…
Determining unknotting numbers is a large and widely studied problem. We consider the more general question of the unknotting number of a spatial graph. We show the unknotting number of spatial graphs is subadditive. Let $g$ be an embedding…
Our goal is to systematically compute the $\mathbb{C}P^2$-genus of all prime knots up to 8-crossings. We obtain upper bounds on the $\mathbb{C}P^2$-genus via coherent band surgery. We obtain lower bounds by obstructing homological degrees…
The aim of the present paper is to prove that the minimal number of virtual crossings for some families of virtual knots grows quadratically with respect to the minimal number of classical crossings. All previously known estimates for…
The warping degree of an oriented knot diagram is the minimal number of crossing changes which are required to obtain a monotone knot diagram from the diagram. The minimal warping degree of a knot is the minimal value of the warping degree…
We establish a new fundamental relationship between total curvature of knots and crossing number. If K is a smooth knot in 3-space, R the cross-section radius of a uniform tube neighborhood of K, L the arclength of K, and k the total…