Binomial identities — combinatorial and algorithmic aspects
- 31 December 1994
- journal article
- Published by Elsevier BV in Discrete Mathematics
- Vol. 136 (1-3), 309-346
- https://doi.org/10.1016/0012-365x(94)00118-3
Abstract
No abstract availableKeywords
This publication has 30 references indexed in Scilit:
- A Generalization of the Pfaff-Saalschütz TheoremStudies in Applied Mathematics, 1991
- A short proof of a ‘strange’ combinatorial identity conjectured by GosperDiscrete Mathematics, 1991
- A one-line proof of the Habsieger-Zeilberger G2 constant term identityJournal of Computational and Applied Mathematics, 1991
- A very short proof of Dixon's theoremJournal of Combinatorial Theory, Series A, 1990
- A 21st century proof of Dougall's hypergeometric sum identityJournal of Mathematical Analysis and Applications, 1990
- Recurrences for sums of powers of binomial coefficientsJournal of Combinatorial Theory, Series A, 1989
- Short proofs of two hypergeometric summation formulas of KarlssonProceedings of the American Mathematical Society, 1989
- A combinatorial proof of the Mehler formulaJournal of Combinatorial Theory, Series A, 1978
- Identities in combinatorics, I: on sorting two ordered setsDiscrete Mathematics, 1975
- Applications of Basic Hypergeometric FunctionsSiam Review, 1974