Related papers: Converting virtual link diagrams to normal ones

Using unknotting number, we introduce a link diagram invariant of Hass and Nowik type, which changes at most by 2 under a Reidemeister move. As an application, we show that a certain infinite sequence of diagrams of the trivial…

We introduce a new standard form of a Seifert surface $F$. In that standard form, $F$ is obtained by successively plumbing flat annuli to a disk $D$, where the gluing regions are all in $D$. We show that any link has a Seifert surface in…

We introduce the Schubert form a $3$-bridge link diagram, as a generalization of the Schubert normal form of a $3$-bridge link. It consists of a set of six positive integers, written as $\left( p/n,q/m,s/l\right) $, with some conditions and…

The theory of frames normal for general connections on differentiable bundles is developed. Links with the existing theory of frames normal for covariant derivative operators (linear connections) in vector bundles are revealed. The…

A connected simple graph is said dual-hamiltonian if its vertex set has a $2$-coloring such that each color class induces a tree. We call such a coloring a hamiltonian coloring. We prove that if $G$ is a graph with a certain type of…

We study invariants of virtual graphoids, which are virtual spatial graph diagrams with two distinguished degree-one vertices modulo graph Reidemeister moves applied away from the distinguished vertices. Generalizing previously known…

A drawing of a graph is fan-planar if the edges intersecting a common edge $a$ share a vertex $A$ on the same side of $a$. More precisely, orienting $e$ arbitrarily and the other edges towards $A$ results in a consistent orientation of the…

Learning representation for graph classification turns a variable-size graph into a fixed-size vector (or matrix). Such a representation works nicely with algebraic manipulations. Here we introduce a simple method to augment an attributed…

A virtual link diagram is called {\em (mod $m$) almost classical} if it admits a (mod $m$) Alexander numbering. In \cite{BodenGaudreauHarperNicasWhite}, it is shown that Alexander polynomial for almost classical links can be defined by…

We tackle the problem of simultaneous transformations of networks represented as graphs. Roughly speaking, one may distinguish two kinds of simultaneous or parallel rewrite relations over complex structures such as graphs: (i) those which…

We study petal diagrams of knots, which provide a method of describing knots in terms of permutations in a symmetric group $S_{2n+1}$. We define two classes of moves on such permutations, called trivial petal additions and crossing…

In this paper we discuss how to define a chord index via smoothing a real crossing point of a virtual knot diagram. Several polynomial invariants of virtual knots and links can be recovered from this general construction. We also explain…

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…

In this paper we generalize single-relation pseudo-Riemannian graph embedding models to multi-relational networks, and show that the typical approach of encoding relations as manifold transformations translates from the Riemannian to the…

Networks constitute efficient tools for assessing universal features of complex systems. In physical contexts, classical as well as quantum, networks are used to describe a wide range of phenomena, such as phase transitions, intricate…

We extend the closed graph theorem and the open mapping theorem to a context in which a natural duality interchanges their extensions.

We construct a 2-variable link polynomial, called $W_L$, for classical links by considering simultaneously the Kauffman state models for the Alexander and for the Jones polynomials. We conjecture that this polynomial is the product of two…

Tait's flyping conjecture, stating that two reduced, alternating, prime link diagrams can be connected by a finite sequence of flypes, is extended to reduced, alternating, prime diagrams of 4-regular graphs in S^3. The proof of this version…

From the work of X. S. Lin and Z. Wang, it follows that degree two knot invariant admits a decomposition into the sum of a Gauss diagram count and a term involving Arnold invariants. In this paper we establish an analogous description for…

Graph neural networks are prominent models for representation learning over graph-structured data. While the capabilities and limitations of these models are well-understood for simple graphs, our understanding remains incomplete in the…