← All problems

The shuffle conjecture for the character of diagonal coinvariants

23 years old · traced to

Fix nn and let δn=(n−1,n−2,…,1,0)\delta_n=(n-1,n-2,\ldots,1,0). For a partition λ⊆δn\lambda\subseteq\delta_n, let TT range over semistandard tableaux of skew shape (λ+(1n))/λ(\lambda+(1^n))/\lambda, and let dinv⁡(T)\operatorname{dinv}(T) be the number of d-inversions defined from the diagonals of the tableau. Define

Dn(z;q,t)=∑λ⊆δn  ∑T∈SSYT⁡(λ+(1n)/λ)t∣δn/λ∣qdinv⁡(T)zT.D_n(z;q,t)=\sum_{\lambda\subseteq\delta_n}\;\sum_{T\in\operatorname{SSYT}(\lambda+(1^n)/\lambda)}t^{|\delta_n/\lambda|}q^{\operatorname{dinv}(T)}z^T.

Here ∇\nabla is the nabla operator on symmetric functions, ene_n is the elementary symmetric function, hμh_\mu is the complete homogeneous symmetric function, and ⟨  ⟩\langle\,\ \rangle is the Hall inner product. The shuffle conjecture. One has

∇en(z)=Dn(z;q,t).\nabla e_n(z)=D_n(z;q,t).

Equivalently, for every partition μ\mu,

⟨∇en,hμ⟩=∑λ⊆δn  ∑T∈SSYT⁡(λ+(1n)/λ,μ)t∣δn/λ∣qdinv⁡(T).\langle\nabla e_n,h_\mu\rangle=\sum_{\lambda\subseteq\delta_n}\;\sum_{T\in\operatorname{SSYT}(\lambda+(1^n)/\lambda,\mu)}t^{|\delta_n/\lambda|}q^{\operatorname{dinv}(T)}.

This gives a tableau formula for the character of the diagonal coinvariant ring.

References

Status

  • Solved: Erik Carlsson and Anton Mellit. A proof of the shuffle conjecture (Journal of the American Mathematical Society, 2018) https://arxiv.org/abs/1508.06239

Source: J. Haglund, M. Haiman, N. Loehr, J. B. Remmel and A. Ulyanov, “A Combinatorial Formula for the Character of the Diagonal Coinvariants”, arXiv:math/0310424 (2004).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.