Related papers: Matrix factorizations and colored MOY graphs
The Reshetikhin-Turaev sl(N) polynomial of links colored by wedge powers of the defining representation has been categorified via several different approaches. Here, we give a concise introduction to the categorification using matrix…
Fix an integer N>1. To each diagram of a link colored by 1,...,N, we associate a chain complex of graded matrix factorizations. We prove that the homotopy type of this chain complex is invariant under Reidemeister moves. When every…
We want to construct a homological link invariant whose Euler characteristic is MOY polynomial as Khovanov and Rozansky constructed a categorification of HOMFLY polynomial. The present paper gives the first step to construct a…
We generalize the Morton-Franks-Williams inequality to the colored $\mathfrak{sl}(N)$ link homology defined in arXiv:0907.0695, which gives infinitely many new bounds for the braid index and the self linking number. A key ingredient of our…
For each positive integer n the HOMFLY polynomial of links specializes to a one-variable polynomial that can be recovered from the representation theory of quantum sl(n). For each such n we build a doubly-graded homology theory of links…
The topological string interpretation of homological knot invariants has led to several insights into the structure of the theory in the case of sl(N). We study possible extensions of the matrix factorization approach to knot homology for…
We consider the number of colors for the colorings of links by the symmetric group $S_3$ of degree $3$. For knots, such a coloring corresponds to a Fox 3-coloring, and thus the number of colors must be 1 or 3. However, for links, there are…
Using Bar-Natan's Khovanov homology we define a homology theory for coloured, oriented, framed links. We then compute this explicitly.
The SO(3) Kauffman polynomial and the chromatic polynomial of planar graphs are categorified by a unique extension of the Khovanov homology framework. Many structural observations and computations of homologies of knots and spin networks…
In our previous papers we used the Hilbert scheme of points on $C^2$ in order to construct a triply graded link homology and its $gl(m)$ version. Here we extend the $gl(m)$ construction to super-algebras $gl(m|k)$.
In this paper we use the equivariant version of factorization homology constructed using the parametrized higher category theory and show that it can be used to describe the results used in the series of papers.
In this paper we define the 1,2-coloured HOMFLY-PT link homology and prove that it is a link invariant. We conjecture that this homology categorifies the coloured HOMFLY-PT polynomial for links whose components are labelled 1 or 2.
We define reduced colored sl(N) link homologies and use deformation spectral sequences to characterize their dependence on color and rank. We then define reduced colored HOMFLY-PT homologies and prove that they arise as large N limits of…
Node-link diagrams are a popular method for representing graphs that capture relationships between individuals, businesses, proteins, and telecommunication endpoints. However, node-link diagrams may fail to convey insights regarding graph…
This paper starts a systematic description of colored knot polynomials, beginning from the first non-(anti)symmetric representation R=[2,1]. The project involves several steps: (i) parametrization of big families of knots a la…
A planar graph can be embedded in a piecewise linear manifold, and the lattice on each linear piece can be colored with 3-coloring. If a planar graph can be colored with multiple 3-coloring, i.e. coloring the graph in pieces with different…
We study factorizations of HOMFLY polynomials of certain knots and oriented links. We begin with a computer analysis of knots with at most 12 crossings, finding 17 non-trivial factorizations. Next, we give an irreducibility criterion for…
In this paper, two results are obtained on a hypergraph embedding problem. The proof technique is itself of interest, being the first time amalgamations have been used to address the embedding of hypergraphs. The first result finds…
Obtaining colored HOMFLY-PT polynomials for knots from 3-strand braid carrying arbitrary $SU(N)$ representation is still tedious. For a class of rank $r$ symmetric representations, $[r]$-colored HOMFLY-PT $H_{[r]}$ evaluation becomes…
These are the notes of the lectures delivered by the author at CIME in June 2018. The main purpose of the notes is to provide an overview of the techniques used in the construction of the triply graded link homology. The homology is space…