Related papers: The delta-unlinking number of algebraically split …
A quadruple crossing is a crossing in a projection of a knot or link that has four strands of the knot passing straight through it. A quadruple crossing projection is a projection such that all of the crossings are quadruple crossings. In a…
In the previous paper, we considered a link diagram invariant of Hass and Nowik type using regular smoothing and unknotting number, to estimate the number of Reidemeister moves needed for unlinking. In this paper, we introduce a new link…
A gordian unlink is a finite number of unknots that are not topologically linked, each with prescribed length and thickness, and that cannot be disentangled into the trivial link by an isotopy preserving length and thickness throughout. In…
Building on work by Alishahi-Dowlin, we extract a new knot invariant $\lambda \ge 0$ from universal Khovanov homology. While $\lambda$ is a lower bound for the unknotting number, in fact more is true: $\lambda$ is a lower bound for the…
A link diagram is said to be lune-free if, when viewed as a 4-regular plane graph it does not have multiple edges between any pair of nodes. We prove that any colored link diagram is equivalent to a colored lune-free diagram with the same…
Region crossing change for a knot or a proper link is an unknotting operation. In this paper, we provide a sharp upper bound on the region unknotting number for a large class of torus knots and proper links. Also, we discuss conditions on…
Negami found an upper bound on the stick number $s(K)$ of a nontrivial knot $K$ in terms of the minimal crossing number $c(K)$ of the knot which is $s(K) \leq 2 c(K)$. Furthermore McCabe proved $s(K) \leq c(K) + 3$ for a $2$-bridge knot or…
We consider a relation between two kinds of unknotting numbers defined by using a band surgery on unoriented knots; the band-unknotting number and H(2)-unknotting number, which we may characterize in terms of the first Betti number of…
We investigate the minimal number of links and knots in complete partite graphs. We provide exact values or bounds on the minimal number of links for all complete partite graphs with all but 4 vertices in one partition, or with 9 vertices…
The unknotting number of knots is a difficult quantity to compute, and even its behavior under basic satelliting operations is not understood. We establish a lower bound on the unknotting number of cable knots and iterated cable knots…
Tied links and the tied braid monoid were introduced recently by the authors and used to define new invariants for classical links. Here, we give a version purely algebraic-combinatoric of tied links. With this new version we prove that the…
We classify graphs that are 0, 1, or 2 edges short of being complete partite graphs with respect to intrinsic linking and intrinsic knotting. In addition, we classify intrinsic knotting of graphs on 8 vertices. For graphs in these families,…
Symmetries of knots have been studied extensively, and strongly invertible knots are one of them. Lamm defined the equivariant crossing number $c_t(K)$, the minimum crossing number among all symmetric diagrams for a strongly invertible knot…
We show that for any nontrivial knot $K$ and any natural number $n$ there is a diagram $D$ of $K$ such that the unknotting number of $D$ is greater than or equal to $n$. It is well known that twice the unknotting number of $K$ is less than…
One construction of the Alexander polynomial is as a quantum invariant associated with representations of restricted quantum $\mathfrak{sl}_2$ at a fourth root of unity. We generalize this construction to define a link invariant…
We consider the problem of untangling a given (non-planar) straight-line circular drawing $\delta_G$ of an outerplanar graph $G=(V, E)$ into a planar straight-line circular drawing by shifting a minimum number of vertices to a new position…
It is well known that the minimum crossing number of an alternating link equals the number of crossings in any reduced alternating link diagram of the link. This remarkable result is an application of the Jones polynomial. In the case of…
In 2000, Habiro introduced the notion of $C_k$-equivalence of knots and links. This geometric filtration is closely connected to finite type invariants, a class of invariants including Milnor's invariants. Shortly thereafter, Ohyama,…
Frequently, knots are enumerated by their crossing number. However, the number of knots with crossing number $c$ grows exponentially with $c$, and to date computer-assisted proofs can only classify diagrams up to around twenty crossings.…
From the work of X. S. Lin and Z. Wang, it follows that degree two knot invariant admits a decomposition into the sum of a Gauss diagram count and a term involving Arnold invariants. In this paper we establish an analogous description for…