A criterion for the applicability of Zeilberger's algorithm to rational functions (Q1861199)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A criterion for the applicability of Zeilberger's algorithm to rational functions |
scientific article |
Statements
A criterion for the applicability of Zeilberger's algorithm to rational functions (English)
0 references
16 March 2003
0 references
The applicability of Zeilberger's algorithm is considered and complete solutions are given for the case where the original hypergeometric term \(F(n,k)\) is a rational function. A class of identities \(\sum_{k=0}^n F(n,k)=0\) is specified that cannot be proven by Zeilberger's algorithm. Examples are discussed showing that the set of hypergeometric terms on which Zeilberger's algorithm terminates is a proper subset of the set of all hypergeometric terms, but a super-set of the set of proper terms. The algorithms are compared with existing Maple codes.
0 references
Zeilberger's algorithm
0 references
hypergeometric term
0 references
rational function
0 references
terminating condition
0 references
linear difference operator
0 references
\(q\)-difference operator
0 references
decomposition of indefinite sum
0 references
