Abstract
Based on a modified version of Abramov-Petkov{\v s}ek reduction, a new
algorithm to compute minimal telescopers for bivariate hypergeometric terms was
developed last year. We investigate further in this paper and present a new
argument for the termination of this algorithm, which provides an independent
proof of the existence of telescopers and even enables us to derive lower as
well as upper bounds for the order of telescopers for hypergeometric terms.
Compared to the known bounds in the literature, our bounds are sometimes
better, and never worse than the known ones.
| Original language | English |
|---|---|
| Title of host publication | ISSAC '15 Proceedings of the 2015 ACM on International Symposium on Symbolic and Algebraic Computation |
| Editors | Markus Rosenkranz |
| Number of pages | 8 |
| Publication status | Published - Jun 2016 |
Fields of science
- 101 Mathematics
- 101001 Algebra
- 101005 Computer algebra
- 101013 Mathematical logic
- 102031 Theoretical computer science
JKU Focus areas
- Computation in Informatics and Mathematics
- Engineering and Natural Sciences (in general)