Papers
Topics
Authors
Recent
Search
2000 character limit reached

A categorification of the chromatic symmetric function

Published 9 Jun 2015 in math.CO, math.GT, and math.QA | (1506.03133v1)

Abstract: The Stanley chromatic symmetric function $X_G$ of a graph $G$ 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 $S_n$-modules, whose graded Frobenius series $Frob_G(q,t)$ reduces to the chromatic symmetric function at $q=t=1$. This homology can be thought of as a categorification of the chromatic symmetric function, and provides a homological analogue of several familiar properties of $X_G$. In particular, the decomposition formula for $X_G$ discovered recently by Orellana and Scott, and Guay-Paquet is lifted to a long exact sequence in homology.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (2)

Collections

Sign up for free to add this paper to one or more collections.