A generalization of Gosper's algorithm to bibasic hypergeometric summation (Q1379160): Difference between revisions
From MaRDI portal
Created a new Item |
Set profile property. |
||
| (3 intermediate revisions by 2 users not shown) | |||
| Property / describes a project that uses | |||
| Property / describes a project that uses: qZeil / rank | |||
Normal rank | |||
| Property / describes a project that uses | |||
| Property / describes a project that uses: Mathematica / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 03:08, 5 March 2024
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
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
