English

A spanning tree model for chromatic homology

Combinatorics 2025-04-02 v1 Quantum Algebra

Abstract

After the discovery of Khovanov homology, which categorifies the Jones polynomial, an analogous categorification of the chromatic polynomial, known as chromatic homology, was introduced. Its graded Euler characteristic recovers the chromatic polynomial. In this paper, we present a spanning tree model for the chromatic complex, i.e., we describe a chain complex generated by certain spanning trees of the graph that is chain homotopy equivalent to the chromatic complex. We employ the spanning tree model over Am:=Z[x]<xm>\mathcal{A}_m:= \frac{\mathbb{Z}[x]}{<x^m>} algebra to answer two open questions. First, we establish the conjecture posed by Sazdanovic and Scofield regarding the homological span of chromatic homology over mathcalAm\\mathcal{A}_m algebra, demonstrating that for any graph GG with vv vertices and bb blocks, the homological span is vbv - b. Additionally, we prove a conjecture of Helme-Guizon, Przytycki, and Rong concerning the existence of torsion of order dividing mm in chromatic homology over Am\mathcal{A}_m algebra.

Keywords

Cite

@article{arxiv.2504.00834,
  title  = {A spanning tree model for chromatic homology},
  author = {Aninda Banerjee and Apratim Chakraborty and Swarup Kumar Das and Pravakar Paul},
  journal= {arXiv preprint arXiv:2504.00834},
  year   = {2025}
}
R2 v1 2026-06-28T22:42:28.792Z