Unknotting virtual knots with Gauss diagram forbidden moves

Unknotting twisted knots with Gauss diagram forbidden moves

Twisted knot theory, introduced by M.O.Bourgoin, is a generalization of virtual knot theory. It is easily shown that any virtual knot can be deformed into a trivial knot by a finite sequence of generalized Reidemeister moves and two "forbidden moves" $F_{1}$ and $F_{2}$. Similarly, we show that any twisted knot also can be deformed into a trivial knot or a trivial knot with a bar by a finite sequence of extended Reidemeister moves and three "forbidden moves" $T_{4}$, $F_{1}$ (or $F_{2}$) and $F_{3}$ (or $F_{4}$) .

H(n)-移动是虚拟和焊接链环的解结操作

The H(n)-move is an unknotting operation for virtual and welded links

本文将经典纽结的 H(n)-解结移动推广至虚拟与焊接链环，并证明虚拟化和禁止移动均可由有限次广义 Reidemeister 移动与 H(n)-移动实现。

Higher-order finite type invariants of classical and virtual knots and unknotting operations

Vassiliev introduced filtered invariants of knots using an unknotting operation, called crossing changes. Goussarov, Polyak, and Viro introduced other filtered invariants of virtual knots, which order is called GPV-order, using an unknotting operation, called virtualization. We defined other filtered invariants, which order is called $F$-order, of virtual knots using an unknotting operation, called forbidden moves. In this paper, we show that the set of virtual knot invariants of $F$-order $\le n+1$ is strictly stronger than that of $F$-order $\le n$ and that of GPV-order $\le 2n+1$. To obtain…

Forbidden detour number on virtual knot

We show that the forbidden detour move, essentially introduced by Kanenobu and Nelson, is an unknotting operation for virtual knots. Then we define the forbidden detour number of a virtual knot to be the minimal number of forbidden detour moves necessary to transform a diagram of the virtual knot into the trivial knot diagram. Some upper and lower bounds on the forbidden detour number are given in terms of the minimal number of real crossings or the coefficients of the affine index polynomial of the virtual knot.

On $n$-trivialities of classical and virtual knots for some unknotting operations

In this paper, we introduce a new nontrivial filtration, called F-order, for classical and virtual knot invariants; this filtration produces filtered knot invariants, which are called finite type invariants similar to Vassiliev knot invariants. Finite type invariants introduced by Goussarov, Polyak, and Viro are well-known, and we call them finite type invariants of GPV-order. We show that for any positive integer $n$ and for any classical knot $K$, there exist infinitely many of nontrivial classical knots, all of whose finite type invariants of GPV-order $< n$, coincide with those of $K$ (The…

Crosscap numbers of alternating knots via unknotting splices

Ito-Takimura recently defined a splice-unknotting number $u^-(D)$ for knot diagrams. They proved that this number provides an upper bound for the crosscap number of any prime knot, asking whether equality holds in the alternating case. We answer their question in the affirmative. (Ito has independently proven the same result.) As an application, we compute the crosscap numbers of all prime alternating knots through at least 13 crossings, using Gauss codes.