A very short proof of Dixon's theorem
From MaRDI portal
Publication:918983
DOI10.1016/0097-3165(90)90014-NzbMath0707.05007MaRDI QIDQ918983
Publication date: 1990
Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)
05A19: Combinatorial identities, bijective combinatorics
Related Items
Identities in search of identity, An algorithmic proof theory for hypergeometric (ordinary and ``\(q\)) multisum/integral identities, 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 simple proof of Dixon's identity, A short proof of the \(q\)-Dixon identity, Rational Functions Certify Combinatorial Identities
Cites Work