Categorification of the Dichromatic Polynomial for Graphs

Simple item page
dc.creatorStosic, Marko
dc.date2005-04-12
dc.date2005-09-06
dc.date.accessioned2026-07-07T05:19:02Z
dc.date.available2026-07-07T05:19:02Z
dc.descriptionFor 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 $n\le 2$, 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.
dc.description12 pages, 2 figures; Section 3 corrected, added Section 5
dc.identifierhttps://arxiv.org/abs/math/0504239
dc.identifierhttp://arxiv.org/abs/math/0504239
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/74869
dc.subjectGeometric Topology
dc.subjectCombinatorics
dc.subject57M25; 05C15
dc.titleCategorification of the Dichromatic Polynomial for Graphs
dc.typetext

Files

Collections

arXiv