Related papers: Classification of virtual links by arc shift move
A delta-move is a local move on a link diagram. The delta-Gordian distance between links measures the minimum number of delta-moves needed to move between link diagrams. A self delta-move only involves a single component of a link whereas a…
F-polynomials for virtual knots were defined by Kaur, Prabhakar and Vesnin in 2018 using flat virtual knot invariants. These polynomials naturally generalize Kauffman's affine index polynomial and use smoothing in classical crossing of a…
In this work we study how some elementary graph operations (like the disjoint union) and the collapse of two vertices modify the cut ideal of a graph. They pave the way for reducing the cut ideal of every graph to the cut ideal of smaller…
This paper employs various computational techniques to determine the bridge numbers of both classical and virtual knots. For classical knots, there is no ambiguity of what the bridge number means. For virtual knots, there are multiple…
We prove that two virtual knots have equivalent intersection graphs if and only if they have the same writhe polynomial.
Network virtualization is an efficient approach of solving the ossification problem of the Internet. It has become a promising way of supporting lots of heterogeneous network onto substrate physical network. A major challenge in network…
In the context of finite type invariants, Stanford introduced a family of equivalence relations on knots defined by the lower central series of the pure braid groups and characterized the finite type invariants in terms of the structure of…
Online social networks (OSNs) have become the main medium for connecting people, sharing knowledge and information, and for communication. The social connections between people using these OSNs are formed as virtual links (e.g., friendship…
The unknotting number of a knot is the minimum number of crossings one must change to turn that knot into the unknot. The algebraic unknotting number is the minimum number of crossing changes needed to transform a knot into an Alexander…
In this article, we determine, given a finite graph $\Gamma$ and an integer $n \geq 1$, when a right-angled Artin group $A(\Gamma)$ virtually splits over an abelian subgroup of rank $n$. More precisely, we show that the following assertions…
This paper gives new and elementary combinatorial topological proofs of the classification of unoriented and oriented rational knots and links. These proofs are based on the known classification of alternating knots through flyping, and the…
For a real algebraic link in $RP^3$, we prove that its encomplexed writhe (an invariant introduced by Viro) is maximal for a given degree and genus if and only if its self-linking number with respect to the framing by the osculating planes…
We define numerical link-homotopy invariants of link maps of any number of components, which naturally generalize the Kirk invariant. The Kirk invariant is a link-homotopy invariant of 2-component link maps given by linking numbers of loops…
Network alignment aims at inferring a set of anchor links matching the shared entities between different information networks, which has become a prerequisite step for effective fusion of multiple information networks. In this paper, we…
We give an explicit formula to compute the rotation number of a nullhomologous Legendrian knot in contact (1/n)-surgery diagrams along Legendrian links and obtain a corresponding result for the self-linking number of transverse knots.…
In this paper we construct new invariants of knotoids including the odd writhe, the parity bracket polynomial, the affine index polynomial and the arrow polynomial, and give an introduction to the theory of virtual knotoids. The invariants…
Untangling is a process in which some vertices of a planar graph are moved to obtain a straight-line plane drawing. The aim is to move as few vertices as possible. We present an algorithm that untangles the cycle graph C_n while keeping at…
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…
The sorting number of a graph with $n$ vertices is the minimum depth of a sorting network with $n$ inputs and outputs that uses only the edges of the graph to perform comparisons. Many known results on sorting networks can be stated in…
This paper discusses a generalization of virtual knot theory that we call multi-virtual knot theory. Multi-virtual knot theory uses a multiplicity of types of virtual crossings. As we will explain, this multiplicity is motivated by the way…