The Abel-Zeilberger Algorithm

William Y.C. Chen, Qing-Hu Hou, Hai-Tao Jin

Abstract


By combining Abel's lemma on summation by parts with Zeilberger's algorithm, we give an algorithm, called the Abel-Zeilberger algorithm, to find recurrence relations for definite summations. The role of Abel's lemma can be extended to the case of linear difference operators with polynomial coefficients. This approach can be used to verify and discover identities involving harmonic numbers and derangement numbers. As examples, we use the Abel-Zeilberger algorithm to prove the Paule-Schneider identities, an identity of Andrews and Paule, and an identity of Calkin.


Full Text: PDF