English

Nonterminating Basic Hypergeometric Series and the $q$-Zeilberger Algorithm

Combinatorics 2007-05-23 v1

Abstract

We present a systematic method for proving nonterminating basic hypergeometric identities. Assume that kk is the summation index. By setting a parameter xx to xqnxq^n, we may find a recurrence relation of the summation by using the qq-Zeilberger algorithm. This method applies to almost all nonterminating basic hypergeometric summation formulas in the book of Gasper and Rahman. Furthermore, by comparing the recursions and the limit values, we may verify many classical transformation formulas, including the Sears-Carlitz transformation, transformations of the very-well-poised 8ϕ7_8\phi_7 series, the Rogers-Fine identity, and the limiting case of Watson's formula that implies the Rogers-Ramanujan identities.

Keywords

Cite

@article{arxiv.math/0509281,
  title  = {Nonterminating Basic Hypergeometric Series and the $q$-Zeilberger Algorithm},
  author = {William Y. C. Chen and Qing-Hu Hou and Yan-Ping Mu},
  journal= {arXiv preprint arXiv:math/0509281},
  year   = {2007}
}

Comments

30 pages