A criterion for the applicability of Zeilberger's algorithm to rational functions

Discrete Mathematics

Volumn 259, Issue 1-3, 2002, Pages 1-17

  Abramov, S A ^a   Le, H Q ^b  

^a RUSSIAN ACADEMY OF SCIENCES   (Russian Federation)

^b UNIVERSITY OF WATERLOO   (Canada)

Author keywords

Decomposition of indefinite sum; Hypergeometric term; Linear difference and q difference operators; Rational function; Terminating condition; Zeilberger's algorithm

Indexed keywords

EID: 31244435856     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0012-365X(02)00442-9     Document Type: Article

References (19)

1. S.A. Abramov, Rational component of the solutions of a first-order linear recurrence relation with a rational right-hand side, USSR Comput. Math. Phys. (transl., from Zh. Vychisl. Mat. Mat. Fyz.) 14 (1975) 1035-1039.
2. S.A. Abramov, Indefinite sums of rational functions, Proceedings of the ISSAC'95, 1995, pp. 303-308.
3. S.A. Abramov, A note on Zeilberger's algorithm and proper terms, Proceedings of the 7th Rhine Workshop on Computer Algebra, Bregenz, Austria, March 22-March 24, 2000.
4. S.A. Abramov, K.Yu. Kvashenko, On the greatest common divisor of polynomials which depends on a parameter, Proceedings of the ISSAC'93, 1993, pp. 152-156.
5. S.A. Abramov, H.Q. Le, Applicability of Zeilberger's algorithm to rational functions, Proceedings of the FPSAC'2000, Lecture Notes in Computer Science, Springer, Berlin, 2000, pp. 91-102.
6. S.A. Abramov, M. Petkovšek, Minimal decomposition of indefinite hypergeometric sums, Proceedings of the ISSAC'2001, 2001, pp. 7-14.
7. B. Gauthier, HYPERG, Maple Package, User's Reference Manual, Version 1.0, http://www-igm.univmlv.fr/gauthier/HYPERG.html.
8. R.W. Gosper Jr., Decision procedure for indefinite hypergeometric summation, Proc. Natl. Acad. Sci. USA 75 (1977) 40-42.
9. R. Graham, D. Knuth, O. Patashnik, Concrete Mathematics, 2nd Edition, Addison-Wesley, Reading, MA, 1994.
10. W. Koepf, Hypergeometric Summation: An Algorithmic Approach to Summation and Special Function Identities, Vieweg, Braunschweig, 1998.
11. T.H. Koomwinder, On Zeilberger's algorithm and its q-analogue, J. Comput. Appl. Math 48 (1993) 91-111.
12. H.Q. Le, On the q-analogue of Zeilberger's algorithm to rational functions, Programming Comput. Software (Programmirovanie) 27 (2001) 49-58.
13. M.B. Monagan, K.O. Geddes, K.M. Heal, G. Labahn, S.M. Vorkoetter, J. McCarron, Maple 6 Programming Guide, Waterloo Maple Inc., Toronto, 2000.
14. P. Paule, M. Schorn, A Mathematica version of Zeilberger's algorithm for proving binomial coefficient identities. J. Symbolic Comput. 20 (1995) 673-698.
15. M. Petkovšek, H. Wilf, D. Zeilberger, A = B, A.K. Peters, Wellesley, MA, 1996.
16. R. Pirastu, V. Strehl, Rational summation and Gosper-Petkovšek representation, J. Symbolic Comput. 20 (1995) 617-635.
17. P. Verbaeten, The automatic construction of pure recurrence relations, Proceedings of the EUROSAM '74, ACM-SIGSAM Bull. 8 (1974) 96-98.
18. H. Wilf, D. Zeilberger, An algorithmic proof theory for hypergeometric (ordinary and "q") multisum/integral identities, Invent. Math. 108 (1992) 575-633.
19. D. Zeilberger, The method of creative telescoping, J. Symbolic Comput. 11 (1991) 195-204.