CATEGORIFICATION OF THE DICHROMATIC POLYNOMIAL FOR GRAPHS
From MaRDI portal
Abstract: For each graph and each positive integer , we define a chain complex whose graded Euler characteristic is equal to an appropriate -specialization of the dichromatic polynomial. This also gives a categorification of -specializations of the Tutte polynomial of graphs. Also, for each graph and integer , we define the different one variable -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.
Recommendations
Cites work
Cited in
(22)- On Khovanov's categorification of the Jones polynomial
- Diagrammatic categorification of the Chebyshev polynomials of the second kind
- A broken circuit model for chromatic homology theories
- Symmetric Khovanov-Rozansky link homologies
- A categorification for the chromatic polynomial
- Dual equivalence graphs and CAT(0) combinatorics
- Five lectures on Khovanov homology
- On conjectures about positive braid knots and almost alternating torus knots
- A categorification for the Penrose polynomial
- A Dichromatic Polynomial for Weighted Graphs and Link Polynomials
- Dichromatic polynomial of product digraphs
- KHOVANOV–ROZANSKY GRAPH HOMOLOGY AND COMPOSITION PRODUCT
- Linearization and categorification
- Dichotomy Theorems for Homomorphism Polynomials of Graph Classes
- Categorifications of the polynomial ring.
- New categorifications of the chromatic and dichromatic polynomials for graphs
- SO(3) homology of graphs and links
- The Potts model, the Jones polynomial and link homology
- Deletion-contraction triangles for Hausel-Proudfoot varieties
- Multipath matroids, digraph colourings, and the Tutte polynomial
- A categorification for the Tutte polynomial
- When the theories meet: Khovanov homology as Hochschild homology of links
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)