2000 character limit reached
On Macdonald expansions of $q$-chromatic symmetric functions and the Stanley-Stembridge Conjecture (2504.06936v1)
Published 9 Apr 2025 in math.CO and math.RT
Abstract: The Stanley-Stembridge conjecture asserts that the chromatic symmetric function of a $(3+1)$-free graph is $e$-positive. Recently, Hikita proved this conjecture by giving an explicit $e$-expansion of the Shareshian-Wachs $q$-chromatic refinement for unit interval graphs. Using the $\mathbb{A}_{q,t}$ algebra, we give an expansion of these $q$-chromatic symmetric functions into Macdonald polynomials. Upon setting $t=1$, we obtain another proof of the Stanley-Stembridge conjecture and rederive Hikita's formula. Upon setting $t=0$, we obtain an expansion into Hall-Littlewood symmetric functions.