A new elementary algorithm for proving q-hypergeometric identities

被引：1
|
作者：
Zhang, BY [1 ]
机构：
[1] Nankai Univ, Minist Educ, Key lab Pure Math & Combinator, Ctr Combinator, Tianjin 300071, Peoples R China
来源：
JOURNAL OF SYMBOLIC COMPUTATION | 2003年 / 35卷 / 03期
关键词：
q-hypergeometric identities; computer proofs; elimination;
D O I：
10.1016/S0747-7171(02)00136-0
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
We give a fast elementary algorithm to get a small number n(1) for an admissible q-proper-hypergeometric identity [GRAPHICS] such that we can prove the identity by checking its correctness for n (n(0) less than or equal to n less than or equal to n(1)). For example, we get n(1) = 191 for the q-Vandermonde-Chu identity, n(1) = 70 for a finite version of Jacobi's triple product identity and n(1) = 209 for an identity due to L.J. Rogers. (C) 2003 Published by Elsevier Science Ltd.
引用
收藏
页码：293 / 303
页数：11
相关论文
共 50 条
12345