CATEGORIFICATION OF THE DICHROMATIC POLYNOMIAL FOR GRAPHS

From MaRDI portal



Abstract: For each graph and each positive integer n, we define a chain complex whose graded Euler characteristic is equal to an appropriate n-specialization of the dichromatic polynomial. This also gives a categorification of n-specializations of the Tutte polynomial of graphs. Also, for each graph and integer nle2, we define the different one variable n-specializations of the dichromatic polynomials, and for each polynomial we define graded chain complex whose graded Euler characteristic is equal to that polynomial. Furthermore, we explicitly categorify the specialization of the Tutte polynomial for graphs which corresponds to the Jones polynomial of the appropriate alternating link.












This page was built for publication: CATEGORIFICATION OF THE DICHROMATIC POLYNOMIAL FOR GRAPHS

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3519648)