New categorifications of the chromatic and dichromatic polynomials for graphs
Tom 190 / 2006
Fundamenta Mathematicae 190 (2006), 231-243
MSC: Primary 57M25.
DOI: 10.4064/fm190-0-9
Streszczenie
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 the HOMFLYPT polynomial. We also give a simplified definition of this triply-graded link homology theory.
