论文信息 - Proving hypergeometric identities by numerical verifications

Proving hypergeometric identities by numerical verifications

It is known that proper and q-proper hypergeometric identities can be certified by checking a finite number, say n"1, of initial values. By studying the degree and the height of the determinant of a polynomial matrix, we give a new method to estimate n"1. Examples show that the new estimates are considerably smaller than the previous results.

Qing-Hu Hou | Qiang-Hui Guo | Lisa H. Sun

[1] Mizan Rahman,et al. Basic Hypergeometric Series , 1990 .

[2] Bao-Yin Zhang. A new elementary algorithm for proving q-hypergeometric identities , 2003, J. Symb. Comput..

[3] Marko Petkovsek,et al. Hypergeometric Solutions of Linear Recurrences with Polynomial Coefficents , 1992, J. Symb. Comput..

[4] Mary Celine Fasenmyer. Some generalized hypergeometric polynomials , 1947 .

[5] Doron Zeilberger,et al. Sister Celine's technique and its generalizations , 1982 .

[6] 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..

[7] G. Andrews. The Theory of Partitions: Frontmatter , 1976 .

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

[9] Jie Li,et al. An improvement of the two-line algorithm for proving q-hypergeometric identities , 2003, Discret. Math..

[10] Lily Yen. A Two-Line Algorithm for Provingq-Hypergeometric Identities , 1997 .

[11] W. J. Thron,et al. Encyclopedia of Mathematics and its Applications. , 1982 .

[12] Lily Yen. A Two-Line Algorithm for Proving Terminating Hypergeometric Identities , 1996 .