Author:
Chen William Y. C.,Hou Qing-Hu,Mu Yan-Ping
Abstract
AbstractWe present a systematic method for proving non-terminating basic hypergeometric identities. Assume that k is the summation index. By setting a parameter x to xqn, we may find a recurrence relation of the summation by using the q-Zeilberger algorithm. This method applies to almost all non-terminating basic hypergeometric summation formulae in the work of Gasper and Rahman. Furthermore, by comparing the recursions and the limit values, we may verify many classical transformation formulae, including the Sears–Carlitz transformation, transformations of the very well-poised 8φ7 series, the Rogers–Fine identity and the limiting case of Watson's formula that implies the Rogers–Ramanujan identities.
Publisher
Cambridge University Press (CUP)
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. The Art of Telescoping;Proceedings of the 2019 on International Symposium on Symbolic and Algebraic Computation;2019-07-08
2. Elliptic polylogarithms and basic hypergeometric functions;The European Physical Journal C;2017-02
3. Zeilberger’s Algorithm;Hypergeometric Summation;2014
4. The method of combinatorial telescoping;Journal of Combinatorial Theory, Series A;2011-04
5. The q-WZ method for infinite series;Journal of Symbolic Computation;2009-08