pith. sign in

arxiv: 1709.00454 · v2 · pith:7J5JQ623new · submitted 2017-09-01 · 🧮 math.CO

A directed graph generalization of chromatic quasisymmetric functions

classification 🧮 math.CO
keywords chromaticquasisymmetricdigraphsfunctiongraphdirectedfunctionssymmetric
0
0 comments X
read the original abstract

Stanley defined the chromatic symmetric function of a graph, and Shareshian and Wachs introduced a refinement, namely the chromatic quasisymmetric function of a labeled graph. In this paper, we define the chromatic quasisymmetric function of a directed graph, which agrees with the Shareshian-Wachs definition in the acyclic case. We give an F-basis expansion for all digraphs in terms of a permutation statistic, which we call G-descents. We use this expansion to derive a p-positivity formula for all digraphs with symmetric chromatic quasisymmetric functions. We show that the chromatic quasisymmetric functions of a certain class of digraphs, called circular indifference digraphs, have symmetric coefficients. We present an e-positivity formula for the chromatic quasisymmetric function of the directed cycle, which is a t-analog of a result of Stanley. Lastly, we give a generalization of the Shareshian-Wachs e-positivity conjecture to a larger class of digraphs.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.