Abstract
Zeilberger’s method of creative telescoping is crucial for the computer-generated proofs of combinatorial and special-function identities. Telescopers are linear differential or (q-)recurrence op-erators computed by algorithms for creative telescoping. Two fun-damental problems related to creative telescoping are whether telescopers exist, and how to construct them efficiently when they do. In this paper, we solve the existence problem of telescopers for rational functions in three variables including 18 cases. We reduce the existence problem from the trivariate case to the bivariate case and some related problems. The existence criteria given in this paper enable us to determine the termination of algorithms for creative telescoping with trivariate rational inputs.
Original language | English |
---|---|
Pages (from-to) | 494-522 |
Number of pages | 29 |
Journal | Journal of Symbolic Computation |
Volume | 104 |
DOIs | |
Publication status | Published - Aug 2020 |
Fields of science
- 101 Mathematics
- 101001 Algebra
- 101005 Computer algebra
- 101013 Mathematical logic
- 102031 Theoretical computer science
JKU Focus areas
- Digital Transformation