Related papers: Unknotting virtual knots with Gauss diagram forbid…
In this paper, we establish that the arc shift operation on a $n$-component virtual link diagram acts as an unknotting operation when the virtual link is $n$-homogeneous proper, aiding in the classification of \( n \)-component virtual…
Mosaic diagrams for knots were first introduced in 2008 by Lomanoco and Kauffman for the purpose of building a quantum knot system. Since then, many others have explored the structure of these knot mosaic diagrams, as they are interesting…
Given a virtual link diagram $D$, we define its unknotting index $U(D)$ to be minimum among $(m, n)$ tuples, where $m$ stands for the number of crossings virtualized and $n$ stands for the number of classical crossing changes, to obtain a…
The Gauss self-linking integral of an unframed knot is not a knot invariant, but it can be turned into an invariant by adding a correction term which requires adding extra structure to the knot. We collect the different…
New presentations of a link and a virtual link are introduced and algebraic systems on links and virtual links are constructed respectively. Based on the algebraic systems, Reduction Crossing Algorithms for them are proposed which are used…
If a rectangular diagram represents the trivial knot, then it can be deformed into the trivial rectangular diagram with only four edges by a finite sequence of merge operations and exchange operations, without increasing the number of…
In this paper, we study the unknotting operation for twisted knots, called arc shift move. First, we find a family of twisted knots with arc shift number $n$ for any given $n \in \mathbb{N}$. Then we define a new unknotting operation,…
In the present paper, we address the problem how to get a map from knots in the cylinder and on the thickened torus to some (generalisation of) virtual knots called virtual-flat knots. The main construction takes a diagram on a cylinder…
Kishino's knot is not detected by the fundamental group or the bracket polynomial; these invariants cannot differentiate between Kishino's knot and the unknot. However, we can show that Kishino's knot is not equivalent to unknot by applying…
If a rectangular diagram represents the trivial knot, then it can be deformed into the rectangular diagram with only two vertical edges by a finite sequence of merge operations and exchange operations, without increasing the number of…
We study virtualized Delta, sharp, and pass moves for oriented virtual links, and give necessary and sufficient conditions for two oriented virtual links to be related by the local moves. In particular, they are unknotting operations for…
We provide an upper bound on the number of ordered Reidemeister moves required to pass between two diagrams of the same link. This bound is in terms of the number of unordered Reidemeister moves required.
We introduce a notion of intrinsic linking and knotting for virtual spatial graphs. Our theory gives two filtrations of the set of all graphs, allowing us to measure, in a sense, how intrinsically linked or knotted a graph is; we show that…
Kuperberg [Algebr. Geom. Topol. 3 (2003) 587-591] has shown that a virtual knot corresponds (up to generalized Reidemeister moves) to a unique embedding in a thichened surface of minimal genus. If a virtual knot diagram is equivalent to a…
We introduce a new combinatorial method to encode knots and links with applications to knot invariants. Clasp diagrams defined in this paper are combinatorial blueprints for building knot diagrams out of full twists on two strings rather…
A knot diagram has an associated looped interlacement graph, obtained from the intersection graph of the Gauss diagram by attaching loops to the vertices that correspond to negative crossings. This construction suggests an extension of the…
We study invariants of virtual graphoids, which are virtual spatial graph diagrams with two distinguished degree-one vertices modulo graph Reidemeister moves applied away from the distinguished vertices. Generalizing previously known…
Numerical simulations indicate that there exist conformations of the unknot, tied on a finite piece of rope, entangled in such a manner, that they cannot be disentangled to the torus conformation without cutting the rope. The simplest…
We propose some natural generalizations of Reidemeister moves that do not increase the number of crossings in the generated diagrams. Experimentations make us conjecture that this class of monotonic moves is complete for computing canonical…
In this paper we introduce the notion of an unknotting index for virtual knots. We give some examples of computation by using writhe invariants, and discuss a relationship between the unknotting index and the virtual knot module. In…