A Telescoping Algorithm for Double Summations

William Y.C. Chen, Qing-Hu Hou, and Yan-Ping Mu

  Abstract:  We present an algorithm to prove hypergeometric double summa- tion identities. Given a hypergeometric term F(n, i, j), we aim to nd a di erence operator L = a0(n)N0 + a1(n)N1 + ... + ar(n)Nr and rational functions R1(n, i, j), R2(n, i, j) such that LF = i(R1F) +j(R2F). Based on simple divisibility considerations, we show that the denominators of R1 and R2 must possess certain factors which can be computed from F(n, i, j). Using these factors as estimates, we may nd the numerators of R1 and R2 by guessing the upper bounds of the degrees and solving systems of linear equations. Our algorithm is valid for the Andrews-Paule identity, the Carlitz's identi- ties, the Apéry-Schmidt-Strehl identity, the Graham-Knuth-Patashnik identity, and the Petkovsek-Wilf-Zeilberger identity.

  AMS Classification:  33F10, 68W30.

  Keywords:  Zeilberger's algorithm, double summation, hypergeometric term, Andrews-Paule identity.

  Download:   PDF   

Return