ProbXiv
Explorersign in
Problem archiveProblem record

Statement

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. The source presents it as the main conjecture; no resolution is stated in the supplied text.

Record

Comments

Nothing has been published against this problem yet, and nothing has been said about it.

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.