Related papers: Minimal crossing number implies minimal supporting…
We introduce Tristram-Levine signatures of virtual knots and use them to investigate virtual knot concordance. The signatures are defined first for almost classical knots, which are virtual knots admitting homologically trivial…
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…
The aim of this article is to detect new classes of quasi-alternating links. Quasi-alternating links are a natural generalization of alternating links. Their knot Floer and Khovanov homology are particularly easy to compute. Since knot…
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…
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…
The crossing number of a graph $G$ is the least number of crossings over all possible drawings of $G$. We present a structural characterization of graphs with crossing number one.
In the present paper we give a simple proof of the fact that the set of virtual links with orientable atoms is closed. More precisely, the theorem states that if two virtual diagrams $K$ and $K'$ have orientable atoms and they are…
A triple crossing is a crossing in a projection of a knot or link that has three strands of the knot passing straight through it. A triple crossing projection is a projection such that all of the crossings are triple crossings. We prove…
In this paper, we define the notion of a virtually symmetric representation of representations of virtual braid groups and prove that many known representations are equivalent to virtually symmetric. Using one such representation, we define…
For virtual knot theory, the virtual braid group was defined by generalizing the braid group. It was proved that any virtual link can be obtained by the closure of a virtual braid. On the other hand, due to work by Jones et al., it is known…
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…
We introduce the notion of ascent sliceness of virtual knots. A representative of a virtual knot is an embedding $ S^1 \hookrightarrow \Sigma_{g} \times I $, for $ \Sigma_g $ a closed connected oriented surface of genus $ g $; the virtual…
In [8], K. Kaur, S. Kamada et al. posed a problem of finding a virtual knot, if exists, with an unknotting index (n,m), where (n,m) is a pair of non-negative integers. In this paper, we address this question by providing infinite families…
We define and compare several natural ways to compute the bridge number of a knot diagram. We study bridge numbers of crossing number minimizing diagrams, as well as the behavior of diagrammatic bridge numbers under the connected sum…
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 the classical knot theory there is a well-known notion of descending diagram. From an arbitrary diagram one can easily obtain, by some crossing changes, a descending diagram which is a diagram of the unknot or unlink. In this paper the…
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…
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…
This paper is an introduction to virtual knot theory and an exposition of new ideas and constructions, including the parity bracket polynomial, the arrow polynomial, the parity arrow polynomial and categorifications of the arrow polynomial.…
A biquandle is a solution to the set-theoretical Yang-Baxter equation, which yields invariants for virtual knots such as the coloring number and the state-sum invariant. A virtual biquandle enriches the structure of a biquandle by…