A Short Proof of the Zeilberger-Bressoud q-Dyson Theorem
Ira M. Gessel, Guoce Xin
math.COarXiv:math/0412339
Abstract
We give a formal Laurent series proof of Andrews's q-Dyson Conjecture, first proved by Zeilberger and Bressoud.
Create a lesson
Related papers
Counting with Hiccup Sequences
Benoit Cloitre
Degree similar and net-degree similar signed graphs
Matteo Cavaleri, Alfredo Donno
Clique and chromatic numbers of graph powers: spectral bounds and anticodes
Aida Abiad, Gabriel Coutinho, Hitesh Kumar et al.
Counting cographs in locally dense graphs
Hyunwoo Lee
Two-orbit right-angled Polytopes and Hypertopes
Claudio Alexandre Piedade, Philippe Tranchida
On the failure of additivity of inversion numbers for dijoins
Natalie Behague, Jack Cromwell