Related papers: Khovanov-Kauffman Homology for embedded Graphs
We revisit Rozansky's construction of Khovanov homology for links in $S^2\times S^1$, extending it to define Khovanov homology $Kh(L)$ for links $L$ in $M^r=#^r(S^2\times S^1)$ for any $r$. The graded Euler characteristic of $Kh(L)$ can be…
We introduce and study so-called self-indexed graphs. These are (oriented) finite graphs endowed with a map from the set of edges to the set of vertices. Such graphs naturally arise from classical knot and link diagrams. In fact, the graphs…
This article aims to study the topological invariant properties encoded in node graph representational embeddings by utilizing tools available in persistent homology. Specifically, given a node embedding representation algorithm, we…
We prove that a knot is the unknot if and only if its reduced Khovanov cohomology has rank 1. The proof has two steps. We show first that there is a spectral sequence beginning with the reduced Khovanov cohomology and abutting to a knot…
Knowledge graph embedding involves learning representations of entities -- the vertices of the graph -- and relations -- the edges of the graph -- such that the resulting representations encode the known factual information represented by…
Two natural generalizations of knot theory are the study of spatially embedded graphs, and Kauffman's theory of virtual knots. In this paper we combine these approaches to begin the study of virtual spatial graphs.
Given any unoriented link diagram, a group of new knot invariants are constructed. Each of them satisfies a generalized 4 term skein relation. The coefficients of each invariant is from a commutative ring. Homomorphisms and representations…
We give a brief survey of some known results on intrinsically linked or knotted graphs.
Finite order invariants (Vassiliev invariants) of knots are expressed in terms of weight systems, that is, functions on chord diagrams satisfying the four-term relations. Weight systems have graph analogues, so-called $4$-invariants of…
We propose a new method of computing cohomology groups of spaces of knots in $\R^n$, $n \ge 3$, based on the topology of configuration spaces and two-connected graphs, and calculate all such classes of order $\le 3.$ As a byproduct we…
Khovanov homology is a recently introduced invariant of oriented links in $\mathbb{R}^3$. It categorifies the Jones polynomial in the sense that the (graded) Euler characteristic of the Khovanov homology is a version of the Jones polynomial…
Link prediction is an important learning task for graph-structured data. In this paper, we propose a novel topological approach to characterize interactions between two nodes. Our topological feature, based on the extended persistent…
We consider an analogue of well-known Casson knot invariant for knotoids. We start with a direct analogue of the classical construction which gives two different integer-valued knotoid invariants and then focus on its homology extension.…
In this paper, we extend the definition of a knotoid that was introduced by Turaev, to multi-linkoids that consist of a number of knot and knotoid components. We study invariants of multi-linkoids that lie in a closed orientable surface,…
The homology of Kontsevich's commutative graph complex parameterizes finite type invariants of odd dimensional manifolds. This {\it graph homology} is also the twisted homology of Outer Space modulo its boundary, so gives a nice point of…
We construct cobordism maps on link Floer homology associated to decorated link cobordisms. The maps are defined on a curved chain homotopy type invariant. We describe the construction, and prove invariance. We also make a comparison with…
By means of Rasmussen's formulation of Khovanov-Rozansky homology originally given over $\mathbb{Q}$ in arXiv:math/0607544, we compare different flavors of $\mathfrak{sl}(n)$ link homology with the link invariants obtained by Kitchloo in…
We describe an algorithm that recognizes some (perhaps all) intrinsically knotted (IK) graphs, and can help find knotless embeddings for graphs that are not IK. The algorithm, implemented as a Mathematica program, has already been used by…
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…
In [36, Section 8], the present author proposed the hypergraph obstruction for the existence of k-regular embeddings. In this paper, we develop the hypergraph obstruction concretely and give some homological obstructions for the k-regular…