← All problems

Haiman’s conjecture on Kazhdan–Lusztig positivity of monomial immanants

For every integer n≥1n\ge 1, every partition λ⊢n\lambda\vdash n, and every permutation w∈Snw\in S_n, the polynomial cλ,w(q)c_{\lambda,w}(q) obtained by evaluating the monomial character indexed by λ\lambda on the Kazhdan–Lusztig basis element indexed by ww has non-negative integer coefficients and is symmetric and unimodal. Equivalently, writing cλ,w(q)=∑i=0daiqic_{\lambda,w}(q)=\sum_{i=0}^{d}a_iq^i, one has ai∈Z≥0a_i\in\mathbb{Z}_{\ge 0}, ai=ad−ia_i=a_{d-i}, and a0≤a1≤⋯≤a⌊d/2⌋a_0\le a_1\le\cdots\le a_{\lfloor d/2\rfloor}.

References

Progress summary

Refreshed
Open · progress reported

An exact computation reportedly confirms the conjecture through dimension ten, but the general question remains open.

Haiman’s conjecture, posed in 1993, predicts positivity and symmetry properties for coefficients arising from Kazhdan–Lusztig basis elements and Hecke-algebra characters, implying positivity for monomial immanants. The general assertion concerns every partition λ⊢n\lambda \vdash n and permutation w∈Snw \in S_n.

Known results

  • Haiman’s earlier computation verified the conjecture for n≤7n \le 7.
  • The q=1q=1 case was known for partitions with at most two columns and for smooth ww.
  • A companion result establishes the conjecture for all hook shapes and every nn.
  • Related special cases include pattern-avoidance results and Schur-positivity results for generalized Jacobi–Trudi matrices.

October 30, 2026 computational verification

On October 30, 2026, Keith McNulty’s preprint reported an exact verification through n≤10n \le 10, reducing the computation to S10S_{10} and checking 1,252,173,0301{,}252{,}173{,}030 extremal pairs with consistency tests. This is claimed progress, not an all-nn proof, and has not been independently assessed in the retrieved record.

Current status (as of November 2026): The conjecture is verified computationally through n≤10n \le 10, while its validity for arbitrary nn remains open.

Sources

Solutions 0

No solutions have been posted yet.