The Abel lemma and the q-Gosper algorithm
From MaRDI portal
Publication:719940
Abstract: Chu has recently shown that the Abel lemma on summations by parts can serve as the underlying relation for Bailey's bilateral summation formula. In other words, the Abel lemma spells out the telescoping nature of the sum. We present a systematic approach to compute Abel pairs for bilateral and unilateral basic hypergeometric summation formulas by using the -Gosper algorithm. It is demonstrated that Abel pairs can be derived from Gosper pairs. This approach applies to many classical summation formulas.
Cites work
- scientific article; zbMATH DE number 431568 (Why is no real title available?)
- scientific article; zbMATH DE number 3150929 (Why is no real title available?)
- scientific article; zbMATH DE number 2117212 (Why is no real title available?)
- A generalization of Gosper's algorithm to bibasic hypergeometric summation
- A simple proof of Ramanujan's summation of the \(_1\Psi_1\)
- Abel-Rothe type generalizations of Jacobi's triple product identity
- Algorithms for \(q\)-hypergeometric summation in computer algebra
- Bailey's very well-poised \(_6\psi_6\)-series identity
- Inversion of bilateral basic hypergeometric series
- On Zeilberger's algorithm and its \(q\)-analogue
- SERIES OF HYPERGEOMETRIC TYPE WHICH ARE INFINITE IN BOTH DIRECTIONS
- Sharp upper bounds for the orders of the recurrences output by the Zeilberger and \(q\)-Zeilberger algorithms
- Shorter Notes: A Simple Proof of Ramanujan's 1 Ψ 1 Sum
- Shorter Notes: On Ramanujan's Summation of 1 ψ 1 (a; b; z)
- \(q\)-hypergeometric solutions of \(q\)-difference equations
This page was built for publication: The Abel lemma and the \(q\)-Gosper algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q719940)