The Stanley–Stembridge conjecture for chromatic symmetric functions

Let PP be a finite partially ordered set, and let GG be its incomparability graph. For a proper coloring of GG, the associated chromatic symmetric function is XGX_G. A symmetric function is ee-positive if its expansion in the basis of elementary symmetric functions has nonnegative coefficients.

Stanley–Stembridge conjecture. If PP is a 3+1{\bf 3}+{\bf 1}-avoiding partial order, then XGX_G is ee-positive.

The conjecture was reduced to natural unit interval orders by Guay-Paquet and was proved by Brosnan and Chow, independently of Guay-Paquet. The paper studies and reproves the special case for unit interval orders additionally avoiding 2+1+1{\bf 2}+{\bf 1}+{\bf 1}, originally due to Gebhard and Sagan.

Sources & referencesView supporting material

Primary source

Joseph McDonough, Pavlo Pylyavskyy and Shiyun Wang, “The Stanley-Stembridge Conjecture for 2 + 1 +1-avoiding unit interval orders: a diagrammatic proof”, arXiv:2404.07280 (2024).

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.