A Generalization of Gosper's Algorithm to Bibasic Hypergeometric Summation

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. AMS Subject Classification. Primary 33D65, 68Q40; Secondary 33D20.