Kadell's orthogonality conjecture

About 7 years old · traced to

Let a=(a0,…,an)a=(a_0,\dots,a_n) be a sequence of non-negative integers, let x(a)x^{(a)} be the alphabet defined by

x(a)=(x0,x0q,…,x0qa0−1,…,xn,xnq,…,xnqan−1),x^{(a)}=(x_0,x_0q,\dots,x_0q^{a_0-1},\dots,x_n,x_nq,\dots,x_nq^{a_n-1}),

and write ∣a∣=a0+⋯+an|a|=a_0+\cdots+a_n. For a composition v=(v0,…,vn)v=(v_0,\dots,v_n), write ∣v∣=v0+⋯+vn|v|=v_0+\cdots+v_n, and let Dv,(r)(a)D_{v,(r)}(a) be the generalized qq-Dyson constant term defined in the source. Kadell's conjecture.** For rr a positive integer and vv a composition such that ∣v∣=r|v|=r,

Dv,(r)(a)={q∑i=k+1nai(1−qak)(q∣a∣;q)r(1−q∣a∣)(q∣a∣−ak+1;q)r∏i=0n[ai+⋯+anai],if v=(0k,r,0n−k),0,otherwise.D_{v,(r)}(a)=\begin{cases} \displaystyle \frac{q^{\sum_{i=k+1}^n a_i}(1-q^{a_k})(q^{|a|};q)_r}{(1-q^{|a|})(q^{|a|-a_k+1};q)_r}\prod_{i=0}^n\genfrac{[}{]}{0pt}{}{a_i+\cdots+a_n}{a_i},&\text{if }v=(0^{k},r,0^{n-k}),\\[6mm] 0,&\text{otherwise}. \end{cases}

Kadell formulated this orthogonality conjecture as a qq-Dyson constant-term problem. The more general statement in the source was proved by Károlyi, Lascoux and Warnaar using multivariable Lagrange interpolation and key polynomials, so this conjecture is solved.

References

Primary source

Yue Zhou, “On the q-Dyson orthogonality problem”, arXiv:1911.12479 (2019).

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.