Tournaments and Vandermond's determinant

DOI10.1002/JGT.3190030315MaRDI QIDQ3870905zbMATH OpenOpenAlexFDO

Authors Ira M. Gessel

Publication date 1979

Published in Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/jgt.3190030315

zbMATH Keywords

tournamentVandermonde's determinant

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Directed graphs (digraphs), tournaments (05C20)

Cited in

(15)

• A proof of Andrews' \(q\)-Dyson conjecture
• The extension to root systems of a theorem on tournaments
• Colored tournaments and Weyl's denominator formula
• A combinatorial proof of Dyson's conjecture
• Colorings and orientations of graphs
• A constant term identity featuring the ubiquitous (and mysterious) Andrews-Mills-Robbins-Rumsey numbers \(1, 2, 7, 42, 429, \dots\)
• A combinatorial interpretation of the inverse \(t\)-Kostka matrix.
• Symplectic shifted tableaux and deformations of Weyl's denominator formula for \(\text{sp}(2n)\)
• A combinatorial proof of the equivalence of the classical and combinatorial definitions of Schur function
• Two variable Pfaffian identities and symmetric functions
• Combinatorial proof of Selberg's integral formula
• A proof of Andrews' q-Dyson conjecture. (Reprint)
• A sign-reversing involution for an extension of Torelli's Pfaffian identity
• Determinant: Old algorithms, new insights
• Visualizing Vandermonde's determinant through nonintersecting lattice paths

This page was built for publication: Tournaments and Vandermond's determinant

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3870905)