Related papers: Virtual Crossing Realization

We exactly settle the complexity of graph realization, graph rigidity, and graph global rigidity as applied to three types of graphs: "globally noncrossing" graphs, which avoid crossings in all of their configurations; matchstick graphs,…

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…

We formulate conjectures generalizing some known results to the category of virtual Legendrian knots. This includes statements relating virtual Legendrian knots to ordinary Legendrian knots, non-existence of positive virtual Legendrian self…

The classical knot recognition problem is the problem of determining whether the virtual knot represented by a given diagram is classical. We prove that this problem is in NP, and we give an exponential time algorithm for the problem.

We show that every periodic virtual knot can be realized as the closure of a periodic virtual braid and use this to study the Alexander invariants of periodic virtual knots. If $K$ is a $q$-periodic and almost classical knot, we show that…

The composition of any two nontrivial classical knots is a satellite knot, and thus, by work of Thurston, is not hyperbolic. In this paper, we explore the composition of virtual knots, which are an extension of classical knots that…

This paper introduces two virtual knot theory ``analogues'' of a well-known family of invariants for knots in thickened surfaces: the Grishanov-Vassiliev finite-type invariants of order two. The first, called the three loop isotopy…

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…

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 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…

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 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…

This note has an experimental nature and contains no new theorems. We introduce certain moves for classical knot diagrams that for all the very many examples we have tested them on give a monotonic complete simplification. A complete…

In this paper, we discuss the crossing change operation along exchangeable double curves of a surface-knot diagram. We show that under certain condition, a finite sequence of Roseman moves preserves the property of those exchangeable double…

In [14], the second named author constructed the bracket invariant [.] of virtual knots valued in pictures (linear combinations of virtual knot diagrams with some crossing information omitted), such that for many diagrams K, the following…

Extending upon our previous work, we verify the Jones Unknot Conjecture for all knots up to $24$ crossings. We describe the method of our approach and analyze the growth of the computational complexity of its different components.

Variational quantum circuits (VQCs) are a central component of many quantum machine learning algorithms, offering a hybrid quantum-classical framework that, under certain aspects, can be considered similar to classical deep neural networks.…

In 2002, D. Hrencecin and L.H. Kauffman defined a filamentation invariant on oriented chord diagrams that may determine whether the corresponding flat virtual knot diagrams are non-trivial. A virtual knot diagram is non-classical if its…

We present an accurate numerical determination of the crossover from classical to Ising-like critical behavior upon approach of the critical point in three-dimensional systems. The possibility to vary the Ginzburg number in our simulations…

We use crossing parity to construct a generalization of biquandles for virtual knots which we call Parity Biquandles. These structures include all biquandles as a standard example referred to as the even parity biquandle. Additionally, we…