A fast algorithm for proving terminating hypergeometric identities (Q913796): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0012-365x(90)90120-7 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2122300900 / rank | |||
Normal rank | |||
Latest revision as of 11:39, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A fast algorithm for proving terminating hypergeometric identities |
scientific article |
Statements
A fast algorithm for proving terminating hypergeometric identities (English)
0 references
1990
0 references
This is a very brief description of an algorithm developed by the author for verifying identities for terminating hypergeometric series. A fuller account of this procedure with examples of its use to both prove and discover such identities can be found in ``WZ pairs certify combinatorial identities'' (preprint) by Herbert Wilf and Doron Zeilberger.''
0 references
algorithm
0 references
identities
0 references
terminating hypergeometric series
0 references
0 references
0 references
