A generalization of Gosper's algorithm to bibasic hypergeometric summation
From MaRDI portal
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.
Recommendations
Cited in
(14)- Improvement of the degree setting in Gosper's algorithm
- The summation of rational functions by an extended Gosper algorithm
- Greatest factorial factorization and symbolic summation
- Algorithms for \(q\)-hypergeometric summation in computer algebra
- Multibasic and mixed hypergeometric Gosper-type algorithms
- Telescoping method, summation formulas, and inversion pairs
- pqTelescope
- scientific article; zbMATH DE number 5781392 (Why is no real title available?)
- Proof of a conjecture of Lundow and Rosengren on the bimodality of p,q-binomial coefficients
- A probabilistic model for the degree of the cancellation polynomial in Gosper's algorithm
- Gosper's algorithm, accurate summation, and the discrete Newton-Leibniz formula
- The Abel Lemma and the q-Gosper Algorithm
- The Abel lemma and the \(q\)-Gosper algorithm
- Average case analysis of Gosper's algorithm for a class of urn model inputs
This page was built for publication: A generalization of Gosper's algorithm to bibasic hypergeometric summation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1379160)