The e-positivity conjecture for chromatic quasisymmetric functions of indifference graphs

Let γ\gamma be an indifference graph, and write its chromatic quasisymmetric function in the elementary symmetric-function basis as

Xγ(x;t)=λaλ(t)eλ.X_{\gamma}(\mathbf{x};t)=\sum_{\lambda}a_{\lambda}(t)e_{\lambda}.

The e-positivity conjecture. For each γIG\gamma \in \mathcal{I}\mathcal{G}, Xγ(x;t)X_{\gamma}(\mathbf{x};t) is ee-positive; equivalently, aλ(t)Z0[t]a_{\lambda}(t)\in\mathbb{Z}_{\geq 0}[t] for every partition λ\lambda.

This conjecture generalizes the Stanley–Stembridge conjecture, whose t=1t=1 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

No solutions have been posted yet.