A proof of Andrews' \(q\)-Dyson conjecture. (Reprint)

DOI10.1016/j.disc.2006.03.023zbMath1094.33003OpenAlexW2005448739WikidataQ123358316 ScholiaQ123358316MaRDI QIDQ2498002

Doron Zeilberger, David M. Bressoud

Publication date: 4 August 2006

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2006.03.023

zbMATH Keywords

identitiesconstant term\(q\)-Dyson conjecture

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) (q)-calculus and related topics (05A30) Gamma, beta and polygamma functions (33B15) Hypergeometric integrals and functions defined by them ((E), (G), (H) and (I) functions) (33C60)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Sister Celine's technique and its generalizations
• A combinatorial proof of Dyson's conjecture
• Combinatorial problems of commutation and rearrangements
• Statistical Theory of the Energy Levels of Complex Systems. I
• A Proof of Andrews' q-Dyson Conjecture for n = 4
• Proof of a Conjecture by Dyson in the Statistical Theory of Energy Levels
• Tournaments and Vandermond's determinant
• On the Netto Inversion Number of a Sequence
• Proof of a Conjecture by Dyson

This page was built for publication: A proof of Andrews' \(q\)-Dyson conjecture. (Reprint)