The method of creative telescoping
Journal of Symbolic Computation
Hypergeometric solutions of linear recurrences with polynomial coefficients
Journal of Symbolic Computation - Special issue on symbolic computation in combinatorics
Indefinite sums of rational functions
ISSAC '95 Proceedings of the 1995 international symposium on Symbolic and algebraic computation
Rational summation and Gosper-Petkovsˇek
Journal of Symbolic Computation - Special issue on symbolic computation in combinatorics
Minimal decomposition of indefinite hypergeometric sums
Proceedings of the 2001 international symposium on Symbolic and algebraic computation
Concrete Math
On the structure of multivariate hypergeometric terms
Advances in Applied Mathematics
On the q-Analogue of Zeilberger's Algorithm to Rational Functions
Programming and Computing Software
On the rational summation problem
Programming and Computing Software
Low complexity algorithms for linear recurrences
Proceedings of the 2006 international symposium on Symbolic and algebraic computation
A non-holonomic systems approach to special function identities
Proceedings of the 2009 international symposium on Symbolic and algebraic computation
Applicability of the q-analogue of Zeilberger's algorithm
Journal of Symbolic Computation
Subanalytic solutions of linear difference equations and multidimensional hypergeometric sequences
Journal of Symbolic Computation
| Hi-index | 0.00 |
A terminating condition of the well-known Zeilberger's algorithm for a given hypergeometric term T(n, k) is presented. It is shown that the only information on T(n, k) that one needs in order to determine in advance whether this algorithm will succeed is the rational function T(n, k + 1)/T(n, k).