Papers
Topics
Authors
Recent
Search
2000 character limit reached

A directed graph generalization of chromatic quasisymmetric functions

Published 1 Sep 2017 in math.CO | (1709.00454v2)

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.

Summary

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 (1)

Collections

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