A generalization of Gosper's algorithm to bibasic hypergeometric summation (Q1379160)

From MaRDI portal
Revision as of 11:54, 29 February 2024 by SwMATHimport240215 (talk | contribs) (‎Changed an Item)
scientific article
Language Label Description Also known as
English
A generalization of Gosper's algorithm to bibasic hypergeometric summation
scientific article

    Statements

    A generalization of Gosper's algorithm to bibasic hypergeometric summation (English)
    0 references
    0 references
    22 February 1998
    0 references
    Summary: An algebraically motivated generalization of Gosper's algorithm to indefinite bibasic hypergeometric summation is presented. In particular, it is shown how Paule's concept of greatest factorial factorization of polynomials can be extended to the bibasic case. It turns out that most of the bibasic hypergeometric summation identities from the literature can be proved and even found in this way. A Mathematica implementation of the algorithm is available from the author.
    0 references
    Gosper's algorithm
    0 references
    bibasic hypergeometric summation
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references