Related papers: Matrix factorizations and colored MOY graphs
An $(m,n)$-mixed graph generalizes the notions of oriented graphs and edge-coloured graphs to a graph object with $m$ arc types and $n$ edge types. A simple colouring of such a graph is a non-trivial homomorphism to a reflexive target. We…
The counting of alternating tangles in terms of their crossing number, number of external legs and connected components is presented here in a unified framework using quantum field-theoretic methods applied to a matrix model of colored…
In this paper, we introduce a new method to prove the Lickorish-Millett type formulae for colored HOMFLY-PT polynomials of links.
We introduce ideas that complement the many known connections between polymatroids and graph coloring. Given a hypergraph that satisfies certain conditions, we construct polymatroids, given as rank functions, that can be written as sums of…
There is one generalization of fibered links in 3-manifolds, called homologically fibered links. It is known that the existence of homologically fibered links whose fiber surface has a given homeomorphic type is determined by the first…
The inclusion relation between simple objects in the plane may be used to define geometric set systems, or hypergraphs. Properties of various types of colorings of these hypergraphs have been the subject of recent investigations, with…
This paper describes several new problems and ideas concerning algebraic geometry and complexity theory. It first uses the idea of coloring graphs with elements of finite fields. This procedure then shows that graph coloring problems can be…
Combinatorics, in particular graph theory, has a rich history of being a domain of successful applications of tools from other areas of mathematics, including topological methods. Here, we survey the study of the Hom-complexes, and the ways…
We show that for every m in N, there exists an n in N such that every embedding of the complete graph K_n in R^3 contains a link of two components whose linking number is at least m. Furthermore, there exists an r in N such that every…
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…
The representation is essentially the same as that given by J.P.Nagle in J. Comb. Theory (B), 1971, 10:1, 42--59. The distinction is in the definition of the weighting function via the number of flows. This new definition allows one to…
We explain how existing results (such as categorical sl(n) actions, associated braid group actions and infinite twists) can be used to define a triply graded link invariant which categorifies the HOMFLY polynomial of links coloured by…
Khovanov introduced a bigraded cohomology theory of links whose graded Euler characteristic is the Jones polynomial. The theory was subsequently applied to the chromatic polynomial of graph, resulting in a categorification known as the…
We investigate the complexity of generalizations of colourings (acyclic colourings, $(k,\ell)$-colourings, homomorphisms, and matrix partitions), for the class of transitive digraphs. Even though transitive digraphs are nicely structured,…
Twisted links are a generalization of classical links and correspond to stably equivalence classes of links in thickened surfaces. In this paper we introduce twisted intersection colorings of a diagram and construct two invariants of a…
We study the behavior of the signature of colored links [Flo05, CF08] under the splice operation. We extend the construction to colored links in integral homology spheres and show that the signature is almost additive, with a correction…
It is well known that the Blanchfield pairing of a knot can be expressed using Seifert matrices. In this paper, we compute the Blanchfield pairing of a colored link with non-zero Alexander polynomial. More precisely, we show that the…
This is a graduate-level introduction to graph theory, corresponding to a quarter-long course. It covers simple graphs, multigraphs as well as their directed analogues, and more restrictive classes such as tournaments, trees and…
The aim of this paper is to generalize the notion of the coloring complex of a graph to hypergraphs. We present three different interpretations of those complexes -- a purely combinatorial one and two geometric ones. It is shown, that most…
We observe that there is an equivalence between the singularity category of an affine complete intersection and the homotopy category of matrix factorizations over a related scheme. This relies in part on a theorem of Orlov. Using this…