REDUCE package for the indefinite and definite summation

This article describes the REDUCE package ZEILBERG implemented by Gregor Stölting and the author which can be obtained from RedLib, accessible via anonymous ftp on ftp.zib-berlin.de in the directory pub/redlib/rules.The REDUCE package ZEILBERG is a careful implementation of the Gosper and Zeilberger algorithms for indefinite, and definite summation of hypergeometric terms, respectively. An expression ak is called a hypergeometric term (or closed form), if ak/ak-1 is a rational function with respect to k. Typical hypergeometric terms are ratios of products of powers, factorials, Γ function terms, binomial coefficients, and shifted factorials (Pochhammer symbols) that are integer-linear in their arguments.The package covers further extensions of both Gosper's and Zeilberger's algorithm which in particular are valid for ratios of products of powers, factorials, Γ function terms, binomial coefficients, and shifted factorials that are rational-linear in their arguments.A similar MAPLE package is described elsewhere [2].

[1]  George Gasper.  Lecture notes for an introductory minicourse on q-series , 1995 .

[2]  T. Koornwinder,et al.  BASIC HYPERGEOMETRIC SERIES (Encyclopedia of Mathematics and its Applications) , 1991 .

[3]  G. Rw.  Decision procedure for indefinite hypergeometric summation , 1978 .

[4]  Doron Zeilberger,et al.  The Method of Creative Telescoping , 1991, J. Symb. Comput..

[5]  Rene F. Swarttouw,et al.  The Askey-scheme of hypergeometric orthogonal polynomials and its q-analogue Report Fac , 1996, math/9602214.

[6]  Wolfram Koepf,et al.  Algorithms for m-Fold Hypergeometric Summation , 1995, J. Symb. Comput..

[7]  Herbert S. Wilf,et al.  Generating functionology , 1990 .

[8]  R. W. Gosper.  Decision procedure for indefinite hypergeometric summation. , 1978, Proceedings of the National Academy of Sciences of the United States of America.

[9]  Peter Paule,et al.  A Mathematica Version of Zeilberger's Algorithm for Proving Binomial Coefficient Identities , 1995, J. Symb. Comput..

[10]  Volker Strehl,et al.  Binomial Sums and Identities , 1993 .

[11]  Doron Zeilberger,et al.  A fast algorithm for proving terminating hypergeometric identities , 1990, Discret. Math..

[12]  V. B. Uvarov,et al.  Classical Orthogonal Polynomials of a Discrete Variable , 1991 .

[13]  Wolfram Koepf.  Algorithms for the indefinite and definite summation , 1994 .

[14]  Tom H. Koornwinder,et al.  On Zeilberger's algorithm and its q-analogue: a rigorous description , 1993 .

[15]  R. Askey,et al.  Some basic hypergeometric orthogonal polynomials that generalize Jacobi polynomials , 1985 .

[16]  Donald E. Knuth.  The Art of Computer Programming 2 / Seminumerical Algorithms , 1971 .

[17]  Peter Paule,et al.  A Mathematica q-Analogue of Zeilberger's Algorithm Based on an Algebraically Motivated Approach to q-Hypergeometric Telescoping , 1991 .