The refined shuffle conjecture for ∇En,k\nabla E_{n,k}

About 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 each partition λ⊆δn\lambda\subseteq\delta_n, let Dnλ(z;q)D_n^\lambda(z;q) denote the tableau sum over semistandard tableaux of shape (λ+(1n))/λ(\lambda+(1^n))/\lambda, weighted by qdinv⁡(T)zTq^{\operatorname{dinv}(T)}z^T. Let En,kE_{n,k} be defined by

en[Z1−u1−q]=∑k=1n(u;q)k(q;q)kEn,k(z).e_n\left[Z\frac{1-u}{1-q}\right]=\sum_{k=1}^n\frac{(u;q)_k}{(q;q)_k}E_{n,k}(z).

The refined shuffle conjecture. For 1≤k≤n1\leq k\leq n,

∇En,k=∑λ⊆δn∣{i:λi=n−i}∣=kt∣δn/λ∣Dnλ(z;q).\nabla E_{n,k}=\sum_{\substack{\lambda\subseteq\delta_n\\|\{i:\lambda_i=n-i\}|=k}}t^{|\delta_n/\lambda|}D_n^\lambda(z;q).

This refinement isolates the tableaux indexed by partitions having exactly kk parts on the staircase boundary and implies the stated positivity consequence for ∇En,k\nabla E_{n,k}. The supplied text introduces it as a refinement of the main conjecture and gives no resolution.

References

Primary 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.