The Abel-Zeilberger Algorithm
William Y.C. Chen, Qing-Hu Hou, and 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 ﬁnd recurrence relations for deﬁnite 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. AMS Classification: 33F10, 05A19, 39A10 Keywords: Abel's lemma, Zeilberger's algorithm, holonomic sequence, linear difference equation Download: PDF |