Related papers: Classification of virtual links by arc shift move
This paper describes a polynomial invariant of virtual knots that is defined in terms of an integer labeling of the virtual knot diagram. This labeling is seen to derive from an essentially unique structure of affine flat biquandle for flat…
We consider intrinsic linking and knotting in the context of directed graphs. We construct an example of a directed graph that contains a consistently oriented knotted cycle in every embedding. We also construct examples of intrinsically…
A virtual link diagram is called normal if the associated abstract link diagram is checkerboard colorable, and a virtual link is normal if it has a normal diagram as a representative.In this paper, we introduce a method of converting a…
Two categorifications are given for the arrow polynomial, an extension of the Kauffman bracket polynomial for virtual knots. The arrow polynomial extends the bracket polynomial to infinitely many variables, each variable corresponding to an…
We construct an algorithm to decide whether two given Legendrian or transverse links are equivalent. In general, the complexity of the algorithm is too high for practical implementation. However, in many cases, when the symmetry group of…
Virtual knot theory, introduced by Kauffman, is a generalization of classical knot theory of interest because its finite-type invariant theory is potentially a topological interpretation of Etingof and Kazhdan's theory of quantization of…
Virtual links are generalizations of classical links that can be represented by links embedded in a ``thickened'' surface $\Sigma\times I$, product of a Riemann surface of genus $h$ with an interval. In this paper, we show that virtual…
The untwisting number of a knot K is the minimum number of null-homologous twists required to convert K to the unknot. Such a twist can be viewed as a generalization of a crossing change, since a classical crossing change can be effected by…
Network embedding is a very important method for network data. However, most of the algorithms can only deal with static networks. In this paper, we propose an algorithm Recurrent Neural Network Embedding (RNNE) to deal with dynamic…
A virtual knot is an equivalence class of embeddings of $ S^1 $ into thickened (closed oriented) surfaces, up to self-diffeomorphism of the surface and certain handle stabilisations. The slice genus of a virtual knot is defined…
We study symmetric crossing change operations for strongly invertible knots. Our main theorem is that the most natural notion of equivariant unknotting number is not additive under connected sum, in contrast with the longstanding conjecture…
For a virtual knot $K$ and an integer $r\geq 0$, the $r$-covering $K^{(r)}$ is defined by using the indices of chords on a Gauss diagram of $K$. In this paper, we prove that for any finite set of virtual knots $J_0,J_2,J_3,\dots,J_m$, there…
We define a group-valued invariant of virtual knots and relate it to various other group-valued invariants of virtual knots, including the extended group of Silver-Williams and the quandle group of Manturov and Bardakov-Bellingeri. A…
We introduce a new polynomial invariant of virtual knots and links and use this invariant to compute a lower bound on the virtual crossing number and the minimal surface genus.
We prove the following results (1) (2) (3) on relations between $n$-links and their components. (1) Let L=(L_1, L_2) be a (4k+1)-link (4k+1\geq 5). Then we have Arf L=Arf L_1+Arf L_2. (2) Let L=(L_1, L_2) be a (4k+3)-link (4k+3\geq3). Then…
A knot (or link) diagram is said to be everywhere equivalent if all the diagrams obtained by switching one crossing represent the same knot (or link). We classify such diagrams of a closed 3-braid.
We define new notions of groups of virtual and welded knots (or links) and we study their relations with other invariants, in particular the Kauffman group of a virtual knot.
We study the complexity of the Virtual Network Embedding Problem (VNE), which is the combinatorial core of several telecommunication problems related to the implementation of virtualization technologies, such as Network Slicing. VNE is to…
We introduce a new knot diagram invariant called the Self-Crossing Index (SCI). Using SCI, we provide bounds for unknotting two families of framed unknots. For one of these families, unknotting using framed Reidemeister moves is…
In the paper we introduce a general approach how for a given virtual biquandle multi-switch $(S,V)$ on an algebraic system $X$ (from some category) and a given virtual link $L$ construct an algebraic system $X_{S,V}(L)$ (from the same…