Related papers: Linking number and folded ribbon unknots
The ropelength problem asks for the minimum-length configuration of a knotted diameter-one tube embedded in Euclidean three-space. The core curve of such a tube is called a tight knot, and its length is a knot invariant measuring…
If a knot has the Alexander polynomial not equal to 1, then it is linear $n$-colorable. By means of such a coloring, such a knot is given an upper bound for the minimal quandle order, i.e., the minimal order of a quandle with which the knot…
We showed that the order of torsion homology classes in the grid homology of a knot is a lower bound for the unknotting number.
We extend linkage unfolding results from the well-studied case of polygonal linkages to the more general case of linkages of polygons. More precisely, we consider chains of nonoverlapping rigid planar shapes (Jordan regions) that are hinged…
We consider knotted annuli in 4-space, called 2-string-links, which are knotted surfaces in codimension two that are naturally related, via closure operations, to both 2-links and 2-torus links. We classify 2-string-links up to…
We show that the knots $K\in\{4_1,5_1\}$ can be paired with a corresponding knot $K^\prime$ such that $u(K\#K^\prime)<u(K)+u(K^\prime)$. As a consequence unknotting number fails to be additive for these knots. We also provide a candidate…
Recently, Freedman [arXiv:2301.00295] introduced the idea of packing a maximal number of links into a bounded region subject to geometric constraints, and produced upper bounds on the packing number in some cases, while commenting that…
If L is an oriented link with $n$ components, then the rank of its Khovanov homology is at least $2^n$. We classify all the links whose Khovanov homology with Z/2-coefficients achieves this lower bound, and show that such links can be…
This paper concerns the H(2)-unknotting numbers of links related to 2-bridge links. It consists of three parts. In the first part, we consider a necessary and sufficient condition for a 2-bridge link to have H(2)-unknotting number one. The…
A connected covering is a design system in which the corresponding {\em block graph} is connected. The minimum size of such coverings are called {\em connected coverings numbers}. In this paper, we present various formulas and bounds for…
We construct an infinite collection of knots with the property that any knot in this family has $n$-string essential tangle decompositions for arbitrarily high $n$.
I consider the problem of a thin membrane on which a metric has been prescribed, for example by lithographically controlling the local swelling properties of a polymer thin film. While any amount of swelling can be accommodated locally,…
A triple crossing is a crossing in a projection of a knot or link that has three strands of the knot passing straight through it. A triple crossing projection is a projection such that all of the crossings are triple crossings. We prove…
New lower bounds on the unknotting number of a knot are constructed from the classical knot signature function. These bounds can be twice as strong as previously known signature bounds. They can also be stronger than known bounds arising…
We give a new construction of slice knots via annulus twists. The simplest slice knots obtained by our method are those constructed by Omae. In this paper, we introduce a sufficient condition for given slice knots to be ribbon, and prove…
Rainbow connection number, $rc(G)$, of a connected graph $G$ is the minimum number of colours needed to colour its edges, so that every pair of vertices is connected by at least one path in which no two edges are coloured the same. In this…
Given a knot K in S^3, let u^-(K) (respectively, u^+(K)) denote the minimum number of negative (respectively, positive) crossing changes among all unknotting sequences for K. We use knot Floer homology to construct the invariants l^-(K),…
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…
The unknotting number of a knot is the minimum number of crossings one must change to turn that knot into the unknot. The algebraic unknotting number is the minimum number of crossing changes needed to transform a knot into an Alexander…
The equations for the equilibrium of a thin elastic ribbon are derived by adapting the classical theory of thin elastic rods. Previously established ribbon models are extended to handle geodesic curvature, natural out-of-plane curvature,…