A direct algorithm to construct the minimal Z-pairs for rational functions

Advances in Applied Mathematics

Volumn 30, Issue 1-2, 2003, Pages 137-159

  Le, H Q ^a  

^a UNIVERSITY OF WATERLOO   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0038742975     PISSN: 01968858     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0196-8858(02)00529-8     Document Type: Review

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. 14 (1975) 1035-1039, transl. from: Zh. Vychisl. Mat. Mat. Fyz.
2. S.A. Abramov, K.Yu. Kvashenko, On the greatest common divisor of polynomials which depend on a parameter, in: Proceedings ISSAC'93, 1993, pp. 152-156.
3. S.A. Abramov, Indefinite sums of rational functions, in: Proceedings ISSAC'95, 1995, pp. 303-308.
4. S.A. Abramov, H.Q. Le, Applicability of Zeilberger's algorithm to rational functions, in: Proceedings FPSAC'2000, Springer-Verlag, 2000, pp. 91-102.
5. S.A. Abramov, H.Q. Le, A criterion for the applicability of Zeilberger's algorithm to rational functions, Discrete Math. 259 (2002) 1-17.
6. S.A. Abramov, M. Petkovšek, Minimal decomposition of indefinite hypergeometric sums, in: Proc. ISSAC'2001, 2001, pp. 7-14.
7. R. Graham, D. Knuth, O. Patashnik, Concrete Mathematics, 2nd Edition, Addison-Wesley, Reading, MA, 1994.
8. T.H. Koornwinder, On Zeilberger's algorithm and its q-analogue, J. Comput. Appl. Math. 48 (1993) 91-111.
9. H.Q. Le, A direct algorithm to construct Zeilberger's recurrences for rational functions, in: Proc. FPSAC'2001, 2001, pp. 303-312.
10. H.Q. Le, On the q-analogue of Zeilberger's algorithm to rational functions, Progr. Comput. Software (Programmirovanie) 27 (2001) 49-58.
11. H.Q. Le, S.A. Abramov, K.O. Geddes, A direct algorithm to construct the minimal telescopers for rational functions (q-difference case), Technical Report CS-2001-25, Department of Computer Science, University of Waterloo, ON, Canada.
12. H.Q. Le, S.A. Abramov, K.O. Geddes, HypergeometricSum: A Maple package for finding closed forms of indefinite and definite sums of hypergeometric type, Technical Report CS-2001-24, Department of Computer Science, University of Waterloo, ON, Canada.
13. M.B. Monagan, K.O. Geddes, K.M. Heal, G. Labahn, S.M. Vorkoetter, J. McCarron, P. DeMarco, Maple 7 Programming Guide, Waterloo Maple, Toronto, 2001.
14. P. Paule, Greatest factorial factorization and symbolic summation, J. Symbolic Comput. 20 (1995) 235-268.
15. P. Paule, M. Schorn, A Mathematica version of Zeilberger's algorithm for proving binomial coefficient identities, J. Symbolic Comput. 20 (1995) 673-698.
16. M. Petkovšek, H. Wilf, D. Zeilberger, A = B, Peters, Wellesley, MA, 1996.
17. R. Pirastu, V. Strehl, Rational summation and Gosper-Petkovšek representation, J. Symbolic Comput. 20 (1995) 617-635.
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.