English

The Extended Zeilberger's Algorithm with Parameters

Classical Analysis and ODEs 2009-08-11 v1 Combinatorics

Abstract

For a hypergeometric series kf(k,a,b,...,c)\sum_k f(k,a, b, ...,c) with parameters a,b,>...,ca, b, >...,c, Paule has found a variation of Zeilberger's algorithm to establish recurrence relations involving shifts on the parameters. We consider a more general problem concerning several similar hypergeometric terms f1(k,a,b,...,c)f_1(k, a, b,..., c), f2(k,a,b,...,c)f_2(k, a,b, ..., c), ......, fm(k,a,b,...,c)f_m(k, a, b, ..., c). We present an algorithm to derive a linear relation among the sums kfi(k,a,b,...,c)\sum_k f_i(k,a,b,...,c) (1im)(1\leq i \leq m). Furthermore, when the summand fif_i contains the parameter xx, we can require that the coefficients be xx-free. Such relations with xx-free coefficients can be used to determine whether a polynomial sequence satisfies the three term recurrence and structure relations for orthogonal polynomials. The qq-analogue of this approach is called the extended qq-Zeilberger's algorithm, which can be employed to derive recurrence relations on the Askey-Wilson polynomials and the qq-Racah polynomials.

Keywords

Cite

@article{arxiv.0908.1328,
  title  = {The Extended Zeilberger's Algorithm with Parameters},
  author = {William Y. C. Chen and Qing-Hu Hou and Yan-Ping Mu},
  journal= {arXiv preprint arXiv:0908.1328},
  year   = {2009}
}

Comments

21 pages

R2 v1 2026-06-21T13:34:01.694Z