The Stanley–Stembridge conjecture for chromatic symmetric functions
The Stanley–Stembridge conjecture for chromatic symmetric functions
Let be a finite partially ordered set, and let be its incomparability graph. For a proper coloring of , the associated chromatic symmetric function is . A symmetric function is -positive if its expansion in the basis of elementary symmetric functions has nonnegative coefficients.
Stanley–Stembridge conjecture. If is a -avoiding partial order, then is -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 , 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
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.