Order-degree curves for hypergeometric creative telescoping

Creative telescoping applied to a bivariate proper hypergeometric term produces linear recurrence operators with polynomial coefficients, called telescopers. We provide bounds for the degrees of the polynomials appearing in these operators. Our bounds are expressed as curves in the (r, d)-plane which assign to every order r a bound on the degree d of the telescopers. These curves are hyperbolas, which reflect the phenomenon that higher order telescopers tend to have lower degree, and vice versa.

[1]  Doron Zeilberger,et al.  The Method of Creative Telescoping , 1991, J. Symb. Comput..

[2]  Gilles Villard,et al.  Computing the rank and a small nullspace basis of a polynomial matrix , 2005, ISSAC.

[3]  Pierre Verbaeten,et al.  The automatic construction of pure recurrence relations , 1974, SIGS.

[4]  Sergei A. Abramov,et al.  A criterion for the applicability of Zeilberger's algorithm to rational functions , 2002, Discret. Math..

[5]  Doron Zeilberger,et al.  A fast algorithm for proving terminating hypergeometric identities , 1990, Discret. Math..

[6]  Peter Paule,et al.  Greatest Factorial Factorization and Symbolic Summation , 1995, J. Symb. Comput..

[7]  Christoph Koutschan,et al.  A Fast Approach to Creative Telescoping , 2010, Math. Comput. Sci..

[8]  Sergei A. Abramov.  Indefinite sums of rational functions , 1995, ISSAC '95.

[9]  Éric Schost,et al.  Differential equations for algebraic functions , 2007, ISSAC '07.

[10]  D. Zeilberger.  A holonomic systems approach to special functions identities , 1990 .

[11]  B. Beckermann,et al.  A Uniform Approach for the Fast Computation of Matrix-Type Padé Approximants , 1994, SIAM J. Matrix Anal. Appl..

[12]  R. W. Gosper.  Decision procedure for indefinite hypergeometric summation. , 1978, Proceedings of the National Academy of Sciences of the United States of America.

[13]  S. A. Abramov,et al.  The rational component of the solution of a first-order linear recurrence relation with a rational right side , 1975 .

[14]  G. Rw.  Decision procedure for indefinite hypergeometric summation , 1978 .

[15]  Manuel Kauers,et al.  Trading order for degree in creative telescoping , 2011, J. Symb. Comput..

[16]  Doron Zeilberger,et al.  An algorithmic proof theory for hypergeometric (ordinary and “q”) multisum/integral identities , 1992 .

[17]  H. Q. Le.  A direct algorithm to construct the minimal Z-pairs for rational functions , 2003, Adv. Appl. Math..

[18]  Doron Zeilberger,et al.  Sharp upper bounds for the orders of the recurrences output by the Zeilberger and q-Zeilberger algorithms , 2005, J. Symb. Comput..

[19]  Ziming Li,et al.  Complexity of creative telescoping for bivariate rational functions , 2010, ISSAC.