A very short proof of Dixon's theorem
From MaRDI portal
Publication:918983
DOI10.1016/0097-3165(90)90014-NzbMath0707.05007OpenAlexW2036312986MaRDI QIDQ918983
Publication date: 1990
Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0097-3165(90)90014-n
Related Items
Theorems for a price: Tomorrow's semi-rigorous mathematical culture, The death of proof? Semi-rigorous mathematics? You've got to be kidding!, Binomial identities -- combinatorial and algorithmic aspects, A new proof of the $q$-Dixon identity, A simple proof of Dixon's identity, Central Values for Clebsch–Gordan Coefficients, Identities in search of identity, A short proof of the \(q\)-Dixon identity, Rational Functions Certify Combinatorial Identities, Unnamed Item, Unnamed Item, An algorithmic proof theory for hypergeometric (ordinary and ``\(q\)) multisum/integral identities
Cites Work
