← All problems

The refined mm-shuffle conjecture for ∇mEn,k\nabla^m E_{n,k}

23 years old · traced to

Fix positive integers m,nm,n and set δn=(n−1,n−2,…,1,0)\delta_n=(n-1,n-2,\ldots,1,0). 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),

and let Dn(m),λ(z;q)D_n^{(m),\lambda}(z;q) denote the generalized tableau sum associated with a partition λ⊆mδn\lambda\subseteq m\delta_n. The refined mm-shuffle conjecture. For 1≤k≤n1\leq k\leq n,

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

This is proposed as the m>1m>1 analogue of the refinement for ∇En,k\nabla E_{n,k}, separating the contributions according to the number of parts on the boundary of mδnm\delta_n. The supplied text gives no resolution.

References
  1. 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.