Chromatic quasisymmetric functions for signed graphs
Combinatorics
2025-08-29 v1
Abstract
In 1995, Stanley introduced the chromatic symmetric function of a graph, which specializes to its chromatic polynomial, and which has been the focus of intense research. In 2017, Shareshian, Wachs, and Ellzey defined a refinement of this function for a directed graph, that appears to be in , the algebra of quasisymmetric functions, which is of great interest in algebraic combinatorics. Our goal is to extend this work to signed graphs, taking into account the perspective of the hyperplane arrangement associated with a signed graph, developed by Zaslavsky. We introduce the signed chromatic quasisymmetric invariant, and obtain structural properties. As a consequence, we define and study , the algebra of signed quasisymmetric functions.
Keywords
Cite
@article{arxiv.2508.20200,
title = {Chromatic quasisymmetric functions for signed graphs},
author = {Jean-Christophe Aval and Raquel Melgar},
journal= {arXiv preprint arXiv:2508.20200},
year = {2025}
}