The e-positivity conjecture for chromatic quasisymmetric functions of indifference graphs
The e-positivity conjecture for chromatic quasisymmetric functions of indifference graphs
Let be an indifference graph, and write its chromatic quasisymmetric function in the elementary symmetric-function basis as
The e-positivity conjecture. For each , is -positive; equivalently, for every partition .
This conjecture generalizes the Stanley–Stembridge conjecture, whose case is known. The full polynomial positivity statement remains open.
Sources & referencesView supporting material
Primary source
Lucas Gagnon, “A unipotent realization of the chromatic quasisymmetric function”, arXiv:2211.06981 (2023).
Progress summary
Never refreshed
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.