A proof of Andrews' \(q\)-Dyson conjecture (Q1058634): Difference between revisions

The \(q\)-shifted factorial is defined by \((x;q)_ n=(1-x)(1-xq)\cdots(1- xq^{n-1})\). Andrews conjectured that the constant term in the Laurent polynomial \[ \prod_{1\leq i\leq j<n}(x_ i/x_ j;q)_{a_ i}(qx_ j/x_ i;q)_{a_ j} \] is \[ (q;q)_{a_ 1+\dots+a_ n}/(q;q)_{a_ 1}\dots(q;q)_{a_ n}, \] as an extension of an earlier conjecture of \textit{F. J. Dyson} [J. Math. Phys. 3, 140--156 (1962; Zbl 0105.41604)] that was proved by\textit{J. Gunson} [ibid. 3, 752--753 (1962; Zbl 0111.43903)] and \textit{K. G. Wilson} [ibid. 3, 1040--1043 (1962; Zbl 0113.21403)] (the case \(q=1)\). A combinatorial proof is given in the present paper. This is a major advance, and is one more indication that enumerative combinatorics has come of age, and should be learned by many people who could use it, as well as those who are developing it.