Hui Huang
ABSTRACT
Based on a modified version of Abramov-Petkovsek 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.
- S. A. Abramov. When does Zeilberger's algorithm succeed? Adv. in Appl. Math., 30(3):424--441, 2003. Google Scholar
Digital Library
- S. A. Abramov and H. Le. On the order of the recurrence produced by the method of creative telescoping. Discrete Math., 298(1--3):2--17, 2005. Google ScholarDigital Library
- S. A. Abramov and M. Petkovsek. Minimal decomposition of indefinite hypergeometric sums. In Proc. of ISSAC'01, pp. 7--14, 2001. Google ScholarDigital Library
- S. A. Abramov and M. Petkovsek. Proof of a conjecture of Wilf and Zeilberger. Preprint Series of the Institute of Mathematics, Physics and Mechanics, University of Ljubljana, vol. 39, 2001.Google Scholar
- S. A. Abramov and M. Petkovsek. Rational normal forms and minimal decompositions of hypergeometric terms. J. Symbolic Comput., 33(5):521--543, 2002. Google ScholarDigital Library
- M. Apagodu and D. Zeilberger. Multi-variable Zeilberger and Almkvist-Zeilberger algorithms and the sharpening of Wilf-Zeilberger theory. Adv. in Appl. Math., 37(2):139--152, 2006. Google ScholarDigital Library
- A. Bostan, S. Chen, F. Chyzak, and Z. Li. Complexity of creative telescoping for bivariate rational functions. In Proc. of ISSAC '10, pp. 203--210, 2010. Google ScholarDigital Library
- A. Bostan, S. Chen, F. Chyzak, Z. Li, and G. Xin. Hermite reduction and creative telescoping for hyperexponential functions. In Proc. of ISSAC'13, pp. 77--84, 2013. Google ScholarDigital Library
- A. Bostan, P. Lairez, and B. Salvy. Creative telescoping for rational functions using the Griffith-Dwork method. In Proc. of ISSAC'13, pp. 93--100, 2013. Google ScholarDigital Library
- S. Chen, H. Huang, M. Kauers, and Z. Li. A modified Abramov-Petkovsek reduction and creative telescoping for hypergeometric terms. In Proc. of ISSAC'15, pp. 117--124, 2015. Google ScholarDigital Library
- S. Chen, M. Kauers, and C. Koutschan. Reduction-based creative telescoping for algebraic functions. To appear in Proc. of ISSAC'16, 2016. Google ScholarDigital Library
- M. Mohammed and D. Zeilberger. Sharp upper bounds for the orders of the recurrences output by the Zeilberger and q-Zeilberger algorithms. J. Symbolic Comput., 39(2):201--207, 2005. Google ScholarDigital Library
- M. Petkovsek, H. S. Wilf, and Doron Zeilberger. A=B. A K Peters Ltd., Wellesley, MA, 1996.Google Scholar
- D. Zeilberger. The method of creative telescoping. J. Symbolic Comput., 11:195--204, 1991. Google ScholarDigital Library
Index Terms
- New Bounds for Hypergeometric Creative Telescoping
Recommendations
A Modified Abramov-Petkovsek Reduction and Creative Telescoping for Hypergeometric Terms
ISSAC '15: Proceedings of the 2015 ACM on International Symposium on Symbolic and Algebraic ComputationThe Abramov-Petkovsek reduction computes an additive decomposition of a hypergeometric term,which extends the functionality of the Gosper algorithm for indefinite hypergeometric summation. We modify the Abramov-Petkovsek reduction so as to decompose a ...
Reduction-Based Creative Telescoping for Algebraic Functions
ISSAC '16: Proceedings of the ACM on International Symposium on Symbolic and Algebraic ComputationContinuing a series of articles in the past few years on creative telescoping using reductions, we develop a new algorithm to construct minimal telescopers for algebraic functions. This algorithm is based on Trager's Hermite reduction and on polynomial ...
A Reduction Approach to Creative Telescoping
ISSAC '19: Proceedings of the 2019 on International Symposium on Symbolic and Algebraic ComputationCreative telescoping is the core in the algorithmic proof theory of combinatorial identities developed by Wilf and Zeilberger in the early 1990s. For multivariate functions, the process of creative telescoping constructs linear differential or ...
Comments