Related papers: Minimal diagrams of classical and virtual links
We describe a method of encoding various types of link diagrams, including those with classical, flat, rigid, welded, and virtual crossings. We show that this method may be used to encode link diagrams, up to equivalence, in a notation…
We describe a new class of minimal link diagrams. This class includes certain alternating diagrams, the standard diagrams of all torus links, and numerous homogeneous diagrams whose minimality has not been proven before. Besides, we…
A virtual link is a generalization of a classical link that is defined as an equivalence class of certain diagrams, called virtual link diagrams. It is further generalized to a twisted link. Twisted links are in one-to-one correspondence…
The Jones polynomial and Khovanov homology of a classical link are invariants that depend upon an initial choice of orientation for the link. In this paper, we give a Khovanov homology theory for unoriented virtual links. The graded Euler…
We prove a Kauffman-Murasugi-Thistlethwaite theorem for alternating links in thickened surfaces. It states that any reduced alternating diagram of a link in a thickened surface has minimal crossing number, and any two reduced alternating…
A link homology is defined that is independent of link diagrams. This diagramless homology is closely related to Khovanov homology.
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…
We give a sufficient condition for an almost alternating link diagram to represent a non-splittable link. The main theorem gives us a way to see if a given almost alternating link diagram represents a splittable link without increasing…
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…
Quasi-alternating links are homologically thin for both Khovanov homology and knot Floer homology. We show that every quasi-alternating link gives rise to an infinite family of quasi-alternating links obtained by replacing a crossing with…
The paper contains an essentially self-contained treatment of Khovanov homology, Khovanov-Lee homology as well as the Rasmussen invariant for virtual knots and virtual knot cobordisms which directly applies to classical knot and classical…
Multicrossings, which have previously been defined for classical knots and links, are extended to virtual knots and links. In particular, petal diagrams are shown to exist for all virtual knots.
Virtual singular braids are generalizations of singular braids and virtual braids. We define the virtual singular braid monoid via generators and relations, and prove Alexander- and Markov-type theorems for virtual singular links. We also…
We prove that the Khovanov homology of alternating knots and 2-component links is equal (as a singly graded group) to the singular homology of a certain space of trace- free, binary dihedral representations of the link group. More…
We study virtual isotopy sequences with classical initial and final diagrams, asking when such a sequence can be changed into a classical isotopy sequence by replacing virtual crossings with classical crossings. An example of a sequence for…
This paper investigates the parity concept in knotoids in $S^2$ and in $\mathbb{R}^2$ in relation with virtual knots. We show that the virtual closure map is not surjective and give specific examples of virtual knots that are not in the…
It is known that the Kauffman-Murasugi-Thislethwaite type inequality becomes an equality for any (possibly virtual) adequate link diagram. We refine this condition. As an application we obtain a criterion for virtual link diagram with…
In the present paper, we construct the generalized Kuperberg bracket for two-component links with one component fibred. We consider a new geometrical complexity for such links and establish minimality of diagrams in a strong sense.
Jin and Lee proved the following: Suppose that $D_1, \dots, D_n$ are link diagrams. Given a link $L$ which is partitioned into sublinks $L_1, \dots, L_n$ admitting diagrams $D_1, \dots, D_n$ respectively, there is a diagram $D$ of $L$ whose…
We construct various functorial maps (projections) from virtual knots to classical knots. These maps are defined on diagrams of virtual knots; in terms of Gauss diagram each of them can be represented as a deletion of some chords. The…