Dyson conjecture

In mathematics, the Dyson conjecture Template:Harvs is a conjecture about the constant term of certain Laurent polynomials, proved independently in 1962 by Wilson and Gunson. Andrews generalized it to the q-Dyson conjecture, proved by Zeilberger and Bressoud and sometimes called the Zeilberger–Bressoud theorem. Macdonald generalized it further to more general root systems with the Macdonald constant term conjecture, proved by Cherednik.

Dyson conjecture

The Dyson conjecture states that the Laurent polynomial

\prod_{1 \leq i \neq j \leq n} (1 - t_{i} / t_{j})^{a_{i}}

has constant term

\frac{(a_{1} + a_{2} + \dots + a_{n})!}{a_{1}! a_{2}! \dots a_{n}!} .

The conjecture was first proved independently by Template:Harvtxt and Template:Harvtxt. Template:Harvtxt later found a short proof, by observing that the Laurent polynomials, and therefore their constant terms, satisfy the recursion relations

F (a_{1}, \dots, a_{n}) = \sum_{i = 1}^{n} F (a_{1}, \dots, a_{i} - 1, \dots, a_{n}) .

The case n = 3 of Dyson's conjecture follows from the Dixon identity.

Template:Harvtxt and Template:Harv used a computer to find expressions for non-constant coefficients of Dyson's Laurent polynomial.

Dyson integral

When all the values a_i are equal to β/2, the constant term in Dyson's conjecture is the value of Dyson's integral

\frac{1}{(2 π)^{n}} \int_{0}^{2 π} \dots \int_{0}^{2 π} \prod_{1 \leq j < k \leq n} | e^{i θ_{j}} - e^{i θ_{k}} |^{β} d θ_{1} \dots d θ_{n} .

Dyson's integral is a special case of Selberg's integral after a change of variable and has value

\frac{Γ (1 + β n / 2)}{Γ (1 + β / 2)^{n}}

which gives another proof of Dyson's conjecture in this special case.

q-Dyson conjecture

Template:Harvtxt found a q-analog of Dyson's conjecture, stating that the constant term of

\prod_{1 \leq i < j \leq n} {(\frac{x_{i}}{x_{j}}; q)}_{a_{i}} {(\frac{q x_{j}}{x_{i}}; q)}_{a_{j}}

is

\frac{(q; q)_{a_{1} + \dots + a_{n}}}{(q; q)_{a_{1}} \dots (q; q)_{a_{n}}} .

Here (a;q)_n is the q-Pochhammer symbol. This conjecture reduces to Dyson's conjecture for q = 1, and was proved by Template:Harvtxt, using a combinatorial approach inspired by previous work of Ira Gessel and Dominique Foata. A shorter proof, using formal Laurent series, was given in 2004 by Ira Gessel and Guoce Xin, and an even shorter proof, using a quantitative form, due to Karasev and Petrov, and independently to Lason, of Noga Alon's Combinatorial Nullstellensatz, was given in 2012 by Gyula Karolyi and Zoltan Lorant Nagy. The latter method was extended, in 2013, by Shalosh B. Ekhad and Doron Zeilberger to derive explicit expressions of any specific coefficient, not just the constant term; see http://www.math.rutgers.edu/~zeilberg/mamarim/mamarimhtml/qdyson.html, for detailed references.

Macdonald conjectures

Template:Harvtxt extended the conjecture to arbitrary finite or affine root systems, with Dyson's original conjecture corresponding to the case of the A_n−1 root system and Andrews's conjecture corresponding to the affine A_n−1 root system. Macdonald reformulated these conjectures as conjectures about the norms of Macdonald polynomials. Macdonald's conjectures were proved by Template:Harv using doubly affine Hecke algebras.

Macdonald's form of Dyson's conjecture for root systems of type BC is closely related to Selberg's integral.

References

Dyson conjecture

Contents