论文信息 - Sharp upper bounds for the orders of the recurrences output by the Zeilberger and q-Zeilberger algorithms

Sharp upper bounds for the orders of the recurrences output by the Zeilberger and q-Zeilberger algorithms

We do what the title promises, and as a bonus, we get much simplified versions of these algorithms, that do not make any explicit mention of Gosper's algorithm.

Doron Zeilberger | Mohamud Mohammed

[1] Doron Zeilberger. A fast algorithm for proving terminating hypergeometric identities , 2006, Discret. Math..

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

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

[4] Tom H. Koornwinder,et al. On Zeilberger's algorithm and its q-analogue: a rigorous description , 1993 .

[5] Peter Paule,et al. A Mathematica Version of Zeilberger's Algorithm for Proving Binomial Coefficient Identities , 1995, J. Symb. Comput..

[6] S. A. Abramov,et al. When does Zeilberger's algorithm succeed? , 2003, Adv. Appl. Math..

[7] William Y. C. Chen,et al. Applicability of the q-analogue of Zeilberger's algorithm , 2004, J. Symb. Comput..

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

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

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