New Categorifications of the Chromatic and the Dichromatic Polynomials for Graphs
Marko Stosic
Abstract
In this paper, for each graph G, we define a chain complex of graded modules over the ring of polynomials, whose graded Euler characteristic is equal to the chromatic polynomial of G. Furthermore, we define a chain complex of doubly-graded modules, whose (doubly) graded Euler characteristic is equal to the dichromatic polynomial of G. Both constructions use Koszul complexes, and are similar to the new Khovanov-Rozansky categorifications of HOMFLYPT polynomial. We also give simplified definition of this triply-graded link homology theory.
Create a lesson
Related papers
The weak bialgebra structures on k n
Jingheng Zhou
Characters of Quantum Symmetric Pairs
Philip Schlösser
Bianchi identities in noncommutative geometry
Paolo Aschieri
Centers of quantum Schur superalgebras from Hecke algebras
Qiang Fu, Yingshan Luo, Chengquan Sun
On Split Forms of Fusion Categories
César Galindo
R-matrix via Hasse diagrams
Nikita Kryazhevskikh, Andrey Mudrov, Vladimir Stukopin