arXivDaily arXiv每日学术速递 周一至周五更新
arXiv math/0504239math.GTmath.CO

Categorification of the Dichromatic Polynomial for Graphs

Marko Stosic

英文摘要:

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 $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.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑