Abstract

Andrews [1] has conjectured that the constant term in a certain product is equal to a q q -multinomial coefficient. This conjecture is a q q -analogue of Dyson’s conjecture [5], and has been proved, combinatorically, by Zeilberger and Bressoud [15]. In this paper we give a combinatorial proof of a master theorem, that the constant term in a similar product, computed over the edges of a nontransitive tournament, is zero. Many constant terms are evaluated as consequences of this master theorem including Andrews’ q q -Dyson theorem in two ways, one of which is a q q -analogue of Good’s [6] recursive proof.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.