Related papers: Introduction to Graph-Link Theory

The arrow polynomial is an invariant of framed oriented virtual links that generalizes the virtual Kauffman bracket. In this paper we define the homological arrow polynomial, which generalizes the arrow polynomial to framed oriented virtual…

We construct the new non-trivial state--sum invariants for virtual knots and links by a generalization of the powerful Carter--Saito--Jelsovsky--Kamada--Langford theorem for classical knots. The main result of this work is based on…

This paper is an introduction to the theory of virtual knots and links and it gives a list of unsolved problems in this subject.

It has been argued based on electric-magnetic duality and other ingredients that the Jones polynomial of a knot in three dimensions can be computed by counting the solutions of certain gauge theory equations in four dimensions. Here, we…

We generalize Milnor link invariants to all types of surface-links in $4$--space (possibly with boundary). This is achieved by using the notion of cut-diagram, which is a 2-dimensional generalization of Gauss diagrams, associated to…

Link equivalence up to isotopy in a 3-space is the problem that lies at the root of knot theory, and is important in 3-dimensional topology and geometry. We consider its restriction to alternating links, given by two alternating diagrams…

In this paper, we use skein-theoretic techniques to classify all virtual knot polynomials and trivalent graph invariants with certain smallness conditions. The first half of the paper classifies all virtual knot polynomials giving…

We relativise the Thomassen--Woess definition of accessibility in graphs, defining what it means for a graph to be accessible relative to a peripheral system. In the case of locally finite, quasi-transitive graphs, we characterise relative…

In quantum information theory there is a construction for quantum channels, appropriately called a quantum graph, that generalizes the confusability graph construction for classical channels in classical information theory. In this paper,…

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. Normal virtual links have some properties similar to…

This paper introduces new invariants of rigid vertex graph embeddings by using non-local combinatorial information that is available at each graphical node. The new non-local information that we use in this paper involves parity in the…

Many real-world complex networks are best modeled as bipartite (or 2-mode) graphs, where nodes are divided into two sets with links connecting one side to the other. However, there is currently a lack of methods to analyze properly such…

The goal of this paper is to give a diagrammatical characterization of the information given by the Milnor invariants of links and string links. More precisely, we describe when two string links have equal Milnor invariants of length $\leq…

We observe that any knot invariant extends to virtual knots. The isotopy classification problem for virtual knots is reduced to an algebraic problem formulated in terms of an algebra of arrow diagrams. We introduce a new notion of finite…

The Witten-Reshetikhin-Turaev invariant of classical link diagrams is generalized to virtual link diagrams. This invariant is unchanged by the framed Reidemeister moves and the Kirby calculus. As a result, it is also an invariant of the…

This paper contains a categorification of the sl(k) link invariant using parabolic singular blocks of category O. Our approach is intended to be as elementary as possible, providing combinatorial proofs of the main results of Sussan. We…

We derive new formulas for the Jones polynomial and the Kauffman bracket polynomial of a rational link represented by a standard diagram that is not necessarily alternating. These formulas generalize the results of Qazaqzeh, Yasein, and…

We use planar 4-valent graphs and a graphical calculus involving such graphs to construct an invariant for balanced-oriented, knotted 4-valent graphs. Our invariant is an extension of the $sl(n)$ polynomial for classical knots and links. We…

A classical link in 3-space can be represented by a Gauss paragraph encoding a link diagram in a combinatorial way. A Gauss paragraph may code not a classical link diagram, but a diagram with virtual crossings. We present a criterion and a…

In [Duke Math. J. 101 (1999) 359-426], Mikhail Khovanov constructed a homology theory for oriented links, whose graded Euler characteristic is the Jones polynomial. He also explained how every link cobordism between two links induces a…