Related papers: An Unknotting Index for Virtual Links
Every classical or virtual knot is equivalent to the unknot via a sequence of extended Reidemeister moves and the so-called forbidden moves. The minimum number of forbidden moves necessary to unknot a given knot is an invariant we call the…
A virtual link diagram is called mod $m$ almost classical if it admits an Alexander numbering valued in integers modulo $m$, and a virtual link is called mod $m$ almost classical if it has a mod $m$ almost classical diagram as a…
All knots are fused isotopic to the unknot via a process known as virtualization. We extend and adapt this process to show that, up to fused isotopy, classical links are classified by their linking numbers.
The surgery unknotting number of a Legendrian link is defined as the minimal number of particular oriented surgeries that are required to convert the link into a Legendrian unknot. Lower bounds for the surgery unknotting number are given in…
We define the virtual bridge number $vb(K)$ and the virtual unknotting number $vu(K)$ invariants for virtual knots. For ordinary knots $K$ they are closely related to the bridge number $b(K)$ and the unknotting number $u(K)$ and we have…
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…
A virtual link diagram is called {\em (mod $m$) almost classical} if it admits a (mod $m$) Alexander numbering. In \cite{BodenGaudreauHarperNicasWhite}, it is shown that Alexander polynomial for almost classical links can be defined by…
The splitting number of a link is the minimal number of crossing changes between different components required, on any diagram, to convert it to a split link. We introduce new techniques to compute the splitting number, involving covering…
For an oriented knot diagram D, the warping degree d(D) is the smallest number of crossing changes which are needed to obtain the monotone diagram from D in the usual way. We show that d(D) + d(-D) + 1 is less than or equal to the crossing…
We describe a method for generating minimal hard prime surface-link diagrams. We extend the known examples of minimal hard prime classical unknot and unlink diagrams up to three components and generate figures of all minimal hard prime…
Let $n$ be a positive integer. The aim of this paper is to study two local moves $V(n)$ and $V^{n}$ on welded links, which are generalizations of the crossing virtualization. We show that the $V(n)$-move is an unknotting operation on welded…
We use virtual knot theory to detect the non-invertibility of some classical links in $\mathbb{S}^3$. These links appear in the study of virtual covers. Briefly, a virtual cover associates a virtual knot $\upsilon$ to a knot $K$ in a…
We prove that parities on virtual knots come from invariant 1-cycles on the arcs of knot diagrams. In turn, the invariant cycles are determined by quasi-indices on the crossings of the diagrams. The found connection between the parities and…
We consider a natural model of random knotting- choose a knot diagram at random from the finite set of diagrams with n crossings. We tabulate diagrams with 10 and fewer crossings and classify the diagrams by knot type, allowing us to…
Minimum braids are a complete invariant of knots and links. This paper defines minimum braids, describes how they can be generated, presents tables for knots up to ten crossings and oriented links up to nine crossings, and uses minimum…
Using unknotting number, we introduce a link diagram invariant of Hass and Nowik type, which changes at most by 2 under a Reidemeister move. As an application, we show that a certain infinite sequence of diagrams of the trivial…
We introduce an up-down coloring of a virtual-link diagram. The colorabilities give a lower bound of the minimum number of Reidemeister moves of type II which are needed between two 2-component virtual-link diagrams. By using the notion of…
Geometric interpretations of some virtual knot invariants are given in terms of invariants of links in $\mathbb{S}^3$. Alexander polynomials of almost classical knots are shown to be specializations of the multi-variable Alexander…
In principle, the rules of links formation of a network model can be considered as a kind of link prediction algorithm. By revisiting the preferential attachment mechanism for generating a scale-free network, here we propose a class of…
The warping degree of an oriented knot diagram is the minimal number of crossings which we meet as an under-crossing first when we travel along the diagram from a fixed point. The warping degree of a knot projection is the minimal value of…