A categorification of the chromatic symmetric function
Combinatorics
2015-06-11 v1 Geometric Topology
Quantum Algebra
Abstract
The Stanley chromatic symmetric function of a graph is a symmetric function generalization of the chromatic polynomial, and has interesting combinatorial properties. We apply the ideas of Khovanov homology to construct a homology of graded -modules, whose graded Frobenius series reduces to the chromatic symmetric function at . This homology can be thought of as a categorification of the chromatic symmetric function, and provides a homological analogue of several familiar properties of . In particular, the decomposition formula for discovered recently by Orellana and Scott, and Guay-Paquet is lifted to a long exact sequence in homology.
Keywords
Cite
@article{arxiv.1506.03133,
title = {A categorification of the chromatic symmetric function},
author = {Radmila Sazdanovic and Martha Yip},
journal= {arXiv preprint arXiv:1506.03133},
year = {2015}
}
Comments
26 pages