A combinatorial proof of Dyson's conjecture

DOI10.1016/0012-365X(82)90028-0zbMath0492.05007OpenAlexW1978070273WikidataQ123364935 ScholiaQ123364935MaRDI QIDQ1167729

Doron Zeilberger

Publication date: 1982

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

Full work available at URL: https://doi.org/10.1016/0012-365x(82)90028-0

zbMATH Keywords

tournamentsDyson's conjecture

Mathematics Subject Classification ID

Combinatorial identities, bijective combinatorics (05A19) Directed graphs (digraphs), tournaments (05C20)

Related Items (14)

Interpretation of a basic hypergeometric identity with Lie characters and Young tableaux ⋮ On restricted sumsets over a field ⋮ A characterization of the algebraic degree in semidefinite programming ⋮ Ensemble averages when \(\beta \) is a square integer ⋮ On some batch code properties of the simplex code ⋮ Linear extension of the Erdős-Heilbronn conjecture ⋮ Logarithmic and Complex Constant Term Identities ⋮ A proof of Andrews' \(q\)-Dyson conjecture. (Reprint) ⋮ A Laurent series proof of the Habsieger-Kadell \(q\)-Morris identity ⋮ On the \(q\)-Dyson orthogonality problem ⋮ Identities involving (doubly) symmetric polynomials and integrals over Grassmannians ⋮ Additive Latin transversals. ⋮ On various restricted sumsets ⋮ A proof of Andrews' \(q\)-Dyson conjecture

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Combinatorial problems of commutation and rearrangements
• Statistical Theory of the Energy Levels of Complex Systems. I
• Proof of a Conjecture by Dyson in the Statistical Theory of Energy Levels
• Tournaments and Vandermond's determinant
• Proof of a Conjecture by Dyson

This page was built for publication: A combinatorial proof of Dyson's conjecture