A proof of the two parameter \(q\)-cases of the Macdonald-Morris constant term root system conjecture for \(S(F_ 4)\) and \(S(F_ 4)^ \vee\) via Zeilberger's method (Q1199815)

\textit{I. G. Macdonald} in [SIAM J. Math. Anal. 13, 988-1007 (1982; Zbl 0498.17006)] stated constant term conjectures for an affine root system \(S(R)\). They assert that the coefficient of \(x^ 0\) in \[ \prod_{\alpha\in R+} \prod_{j=1}^{k_ \alpha} (1-x^ \alpha q^{(j-1)u_ \alpha+\varepsilon_ \alpha})(1-x^{-\alpha} q^{ju_ \alpha -\varepsilon_ \alpha}) \] is an explicit product of \(q\)- factorials. The \(\varepsilon_ \alpha\) and \(u_ \alpha\) are constants determined by the root system, and the \(k_ \alpha\) are arbitrary nonnegative integers depending only on the length of \(\alpha\). In succeeding years, various special cases were proven including each of the infinite families of root systems. In 1988, \textit{D. Zeilberger} [ibid. 19, No. 4, 987-1011 (1988; Zbl 0658.05005)] presented a computational method for handling any root system provided there was sufficient computing capacity and sufficient good luck. The need for luck arose from an algorithm that randomly generated linear equations in a particular set of unknowns. When the set of equations has full rank, a proof of the Macdonald conjecture can be effected. In this paper, the authors show how to implement Zeilberger's algorithm in such a way that full rank is guaranteed. This enables them to give the first proof of Macdonald's conjectures for \(S(F_ 4)\) and \(S(F_ 4)^ \vee\). Their technique establishes that something like Macdonald's conjectures must be true for the remaining root systems \(S(E_ 6)\), \(S(E_ 7)\), and \(S(E_ 8)\). However, actual calculations of the correct product of \(q\)-factorials are beyond currently available resources.