Toward Butler's conjecture

TL;DR

This paper introduces a combinatorial formula for a specific difference of modified Macdonald polynomials, proving Butler's conjecture in certain cases and advancing understanding of Schur positivity in algebraic combinatorics.

Contribution

It develops a new LLT equivalence called column exchange rule and provides a positive monomial expansion for the divided difference of modified Macdonald polynomials.

Findings

Established a combinatorial formula for the divided difference.

Proved Butler's conjecture for some special cases.

Introduced the column exchange rule as a new LLT equivalence.

Abstract

For a partition $\nu$, let $\lambda,\mu\subseteq \nu$ be two distinct partitions such that $|\nu/\lambda|=|\nu/\mu|=1$. Butler conjectured that the divided difference $\operatorname{I}_{\lambda,\mu}[X;q,t]=(T_\lambda\widetilde{H}_\mu[X;q,t]-T_\mu\widetilde{H}_\lambda[X;q,t])/(T_\lambda-T_\mu)$ of modified Macdonald polynomials of two partitions $\lambda$ and $\mu$ is Schur positive. By introducing a new LLT equivalence called column exchange rule, we give a combinatorial formula for $\operatorname{I}_{\lambda,\mu}[X;q,t]$, which is a positive monomial expansion. We also prove Butler's conjecture for some special cases.