 Macdonald generalized it further to more general root systems with the Macdonald constant term conjecture, proved by Cherednik.The Dyson conjecture states that the Laurent polynomial

has constant term

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

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