Toward Butler's conjecture
Donghyun Kim, Seung Jin Lee, Jaeseong Oh
TL;DR
The paper advances Butler's conjecture by constructing a positive, combinatorial F-expansion for the Macdonald intersection polynomial $\mathrm{I}_{\lambda,\mu}[X;q,t]$ via a new column-exchange rule and Butler permutations, yielding a fundamental-quasisymmetric expansion with explicit statistics. It then leverages LLT theory to prove Schur positivity in targeted cases, deriving explicit Schur-coefficient formulas for neighboring Hook shapes and obtaining $q,t$-Kostka–style insights. The authors connect generalized modified Macdonald polynomials to LLT polynomials, show positivity under LLT equivalences, and provide a framework to pursue combinatorial formulas for $(q,t)$-Kostka polynomials, including Specializations at $t=1$ or $q=1$. Overall, the work blends filled-diagram generalizations, bijective proofs, and LLT machinery to push toward a complete combinatorial understanding of Butler’s conjecture and related Kostka polynomials.
Abstract
For a partition $ν$, let $λ,μ\subseteq ν$ be two distinct partitions such that $|ν/λ|=|ν/μ|=1$. Butler conjectured that the divided difference $\operatorname{I}_{λ,μ}[X;q,t]=(T_λ\widetilde{H}_μ[X;q,t]-T_μ\widetilde{H}_λ[X;q,t])/(T_λ-T_μ)$ of modified Macdonald polynomials of two partitions $λ$ and $μ$ is Schur positive. By introducing a new LLT equivalence called column exchange rule, we give a combinatorial formula for $\operatorname{I}_{λ,μ}[X;q,t]$, which is a positive monomial expansion. We also prove Butler's conjecture for some special cases.
