Identities of nonterminating series by Zeilberger's algorithm (Q1298586)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 1326386
Language Label Description Also known as
default for all languages
No label defined
    English
    Identities of nonterminating series by Zeilberger's algorithm
    scientific article; zbMATH DE number 1326386

      Statements

      Identities of nonterminating series by Zeilberger's algorithm (English)
      0 references
      5 October 2000
      0 references
      The Gosper algorithm and in particular the subsequent Zeilberger algorithm and the related WZ method have been extremely successful for an approach by computer algebra to identities involving hypergeometric functions [cf. \textit{M. Petovšek}, \textit{H. S. Wilfe} and \textit{D. Zeilberger}, \(A=B\). Wellesley, MA: A. K. Peters (1996; Zbl 0848.05002)]. But this method remains restricted to the case of identities for the terminating hypergeometric series. The author shows that automated proofs of the identities for non-terminating hypergeometric series are feasible by a combination of Zeilberger's algorithm and asymptotic estimates. It is shown that the method extends to the non-terminating generalization of Saalschütz' summation formula for a terminating Saalschützian \({_3F_2}\) hypergeometric series of argumentation \(1\).
      0 references
      Gosper algorithm
      0 references
      Zeilberger algorithm
      0 references
      WZ method
      0 references
      computer algebra
      0 references
      non-terminating hypergeometric series
      0 references
      asymptotic estimates
      0 references
      Saalschütz' summation formula
      0 references
      \({_3F_2}\) hypergeometric series
      0 references
      0 references
      0 references
      0 references
      0 references

      Identifiers