Disturbing the Dyson conjecture, in a generally GOOD way
From MaRDI portal
Publication:855832
DOI10.1016/j.jcta.2005.12.005zbMath1114.33025arXiv1812.05557WikidataQ123153589 ScholiaQ123153589MaRDI QIDQ855832
Publication date: 7 December 2006
Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1812.05557
05A15: Exact enumeration problems, generating functions
05A30: (q)-calculus and related topics
33D45: Basic orthogonal polynomials and functions (Askey-Wilson polynomials, etc.)
Related Items
A unified elementary approach to the Dyson, Morris, Aomoto, and Forrester constant term identities, A family of \(q\)-Dyson style constant term identities
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An algorithmic proof theory for hypergeometric (ordinary and ``\(q\)) multisum/integral identities
- A fast algorithm for proving terminating hypergeometric identities
- A proof of Andrews' \(q\)-Dyson conjecture
- \texttt{qMultiSum} -- a package for proving \(q\)-hypergeometric multiple summation identities
- Pfaff's method. III: Comparison with the WZ method
- Sharp upper bounds for the orders of the recurrences output by the Zeilberger and \(q\)-Zeilberger algorithms
- Statistical Theory of the Energy Levels of Complex Systems. I
- Disturbing the Dyson Conjecture (in a GOOD Way)
- First Layer Formulas for Characters of SL(n, C)
- Proof of a Conjecture by Dyson in the Statistical Theory of Energy Levels
- A short proof of the Zeilberger-Bressoud $q$-Dyson theorem
- Proof of a Conjecture by Dyson