Tournaments and Vandermond's determinant
From MaRDI portal
Publication:3870905
DOI10.1002/jgt.3190030315zbMath0433.05008OpenAlexW2115297889MaRDI QIDQ3870905
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
Exact enumeration problems, generating functions (05A15) Directed graphs (digraphs), tournaments (05C20)
Related Items (15)
The extension to root systems of a theorem on tournaments ⋮ Determinant: Old algorithms, new insights ⋮ Colored tournaments and Weyl's denominator formula ⋮ A combinatorial proof of the equivalence of the classical and combinatorial definitions of Schur function ⋮ Two variable Pfaffian identities and symmetric functions ⋮ A sign-reversing involution for an extension of Torelli's Pfaffian identity ⋮ A combinatorial proof of Dyson's conjecture ⋮ Combinatorial proof of Selberg's integral formula ⋮ Colorings and orientations of graphs ⋮ Visualizing Vandermonde's determinant through nonintersecting lattice paths ⋮ A proof of Andrews' \(q\)-Dyson conjecture. (Reprint) ⋮ A combinatorial interpretation of the inverse \(t\)-Kostka matrix. ⋮ A proof of Andrews' \(q\)-Dyson conjecture ⋮ Symplectic shifted tableaux and deformations of Weyl's denominator formula for \(\text{sp}(2n)\) ⋮ A constant term identity featuring the ubiquitous (and mysterious) Andrews-Mills-Robbins-Rumsey numbers \(1, 2, 7, 42, 429, \dots\)
This page was built for publication: Tournaments and Vandermond's determinant
