A generalization of Gosper's algorithm to bibasic hypergeometric summation
The electronic journal of combinatorics, Tome 3 (1996) no. 1
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 literature can be proved and even found this way. A Mathematica implementation of the algorithm is available from the author.
DOI :
10.37236/1243
Classification :
33D70, 68W30
Mots-clés : Gosper's algorithm, bibasic hypergeometric summation
Mots-clés : Gosper's algorithm, bibasic hypergeometric summation
@article{10_37236_1243,
author = {Axel Riese},
title = {A generalization of {Gosper's} algorithm to bibasic hypergeometric summation},
journal = {The electronic journal of combinatorics},
year = {1996},
volume = {3},
number = {1},
doi = {10.37236/1243},
zbl = {0885.33012},
url = {http://geodesic.mathdoc.fr/articles/10.37236/1243/}
}
Axel Riese. A generalization of Gosper's algorithm to bibasic hypergeometric summation. The electronic journal of combinatorics, Tome 3 (1996) no. 1. doi: 10.37236/1243
Cité par Sources :