qMultiSum - A package for proving q-hypergeometric multiple summation identities

Journal of Symbolic Computation

Volumn 35, Issue 3, 2003, Pages 349-376

  Riese, Axel ^a  

^a JOHANNES KEPLER UNIVERSITY LINZ   (Austria)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0037339422     PISSN: 07477171     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0747-7171(02)00138-4     Document Type: Review

References (18)

1. Alladi, K., Andrews, G.E., Gordon, B., 1995. Generalizations and refinements of a partition theorem of Göllnitz. J. Reine Angew. Math. 460, 165-188.
2. Alladi, K., Berkovich, A., 2001. A double bounded key identity of Göllnitz's (BIG) partition theorem. In: Garvan, F.G., Ismail, M.E.H. (Eds.), Symbolic Computation, Number Theory, Special Functions, Physics and Combinatorics. Developments in Mathematics, vol. 4, Kluwer, Dordrecht, pp. 13-32.
3. Alladi, K., Gordon, B., 1993. Generalizations of Schur's partition theorem. Manuscripta Math. 79, 113-126.
4. Andrews, G.E., 1974. An analytic generalization of the Rogers-Ramanujan identities for odd moduli. Proc. Natl. Acad. Sci. USA 71, 4082-4085.
5. Andrews, G.E., 1984. Multiple series Rogers-Ramanujan type identities. Pacific J. Math. 114, 267-283.
6. Andrews, G.E., 2000. Umbral calculus, Bailey chains and pentagonal number theorems. J. Combin. Theory Ser. A 91, 464-475.
7. Berkovich, A., Riese, A., 2002. A computer proof of a polynomial identity implying a partition theorem of Göllnitz. Adv. Appl. Math. 28, 1-16.
8. Gasper, G., Rahman, M., 1990. Basic hypergeometric series. In: Rota, G.-C. (Ed.), Encyclopedia Math. Appl., vol. 35, Cambridge University Press, London and New York.
9. Hornegger, J., 1992. Hypergeometrische Summation und polynomiale Rekursion. Diploma Thesis, Universität Erlangen-Nürnberg, Germany.
10. Koornwinder, T.H., 1993. On Zeilberger's algorithm and its q-analogue. J. Comput. Appl. Math. 48, 91-111.
11. 2 summation theorems for U (n) basic hypergeometric series. Adv. Math. 131, 93-187.
12. Paule, P., 1985. On identities of the Rogers-Ramanujan type. J. Math. Anal. Appl. 107, 225-284.
13. Paule, P., Riese, A., 1997. A Mathematica q-analogue of Zeilberger's algorithm based on an algebraically motivated approach to q-hypergeometric telescoping. In: Ismail, M.E.H., Masson, D.R., Rahman, M. (Eds.), Special Functions, q-Series and Related Topics. Fields Inst. Commun., 14, American Mathematical Society, Providence, RI, pp. 179-210.
14. Verbaeten, P., 1976. Rekursiebetrekkingen voor lineaire hypergeometrische funkties. Ph.D. Thesis, Katholieke Universiteit te Leuven, Heverlee, Belgium.
15. Warnaar, S.O., 2001. 50 years of Bailey's lemma. In: Betten, A. et al. (Eds.), Algebraic Combinatorics and Applications, Springer, Berlin, pp. 333-347.
16. Wegschaider, K., 1997. Computer generated proofs of binomial multi-sum identities. Diploma Thesis, RISC, J. Kepler Universität Linz, Austria.
17. Wilf, H.S., Zeilberger, D., 1992. An algorithmic proof theory for hypergeometric (ordinary and "q") multisum/integral identities. Invent. Math.
18. Zielberger, D., 1990. A fast algorithm for proving terminating hypergeometric identities. Dicrete Math. 80, 207-211.