Rooted (3+1)(3+1)-free ee-positivity conjecture

About 4 years old · traced to

Let (P,≤P)(P,\leq_P) be a poset, let G(P)G(P) be its incomparability graph, and let G(P)∗rG(P)_*^r denote this graph rooted at r∈Pr\in P. Let X0(G(P)∗r)X_0(G(P)_*^r) be the rooted chromatic symmetric function, and call it ee-positive when each coefficient in its expansion as a polynomial in the root variable has an ee-positive symmetric-function coefficient.

Rooted (3+1)(3+1)-free ee-positivity conjecture. For every r∈Pr\in P, if P−rP-r is (3+1)(\mathbf{3}+\mathbf{1})-free, then

X0(G(P)∗r)X_0(G(P)_*^r)

is ee-positive.

The authors report computer verification for posets with at most 88 vertices, but the general assertion remains open.

References

Primary source

Nicholas A. Loehr and Gregory S. Warrington, “A rooted variant of Stanley's chromatic symmetric function”, arXiv:2206.05392 (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.