A fast algorithm for proving terminating hypergeometric identities. (Reprint) (Q2498005)

From MaRDI portal
scientific article
Language Label Description Also known as
English
A fast algorithm for proving terminating hypergeometric identities. (Reprint)
scientific article

    Statements

    A fast algorithm for proving terminating hypergeometric identities. (Reprint) (English)
    0 references
    0 references
    4 August 2006
    0 references
    This article is a reprint in the 35th special Anniversary Issue of Discrete Mathematics. \textit{D. Zeilberger}'s original article appeared in [Discrete Math. 80, 207--211 (1990; Zbl 0701.05001)]. This article was the corner stone in the development of algorithmic summation leading WZ theory [\textit{H. S. Wilf, D. Zeilberger}, Rational functions certify combinatorial identities. J. Am. Math. Soc. 3, 147--158 (1990; Zbl 0695.05004)], several text books ([\textit{M. Petkovsek, H. S. Wilf, D. Zeilberger}, \(A=B\). Wellesley, MA: A. K. Peters (1996; Zbl 0848.05002)], [\textit{W. Koepf}, Hypergeometric summation. An algorithmic approach to summation and special function identities. Advanced Lectures in Mathematics. Wiesbaden: Vieweg (1998; Zbl 0909.33001)]). In 1998 Herbert Wilf and Doron Zeilberger were awarded the Leroy P. Steele Prize of the AMS for this development.
    0 references
    0 references
    0 references
    Algorithm
    0 references
    identities
    0 references
    terminating hypergeometric series
    0 references
    0 references