The Abel-Zeilberger algorithm

From MaRDI portal
(Redirected from Publication:640468)



Abstract: We use both Abel's lemma on summation by parts and Zeilberger's 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, the Apery-Schmidt-Strehl identity, Calkin's identity and some identities involving Fibonacci numbers.


In this article Abel's Lemma on summation is combined with Gosper's algorithm and more generally with Abramov's algorithm to find closed forms of indefinite summation problems and to compute recurrence relations of definite sums. The presented algorithm is closely related to the holonomic approach worked out in the pioneering article [\textit{F. Chyzak}, Discrete Math. 217, No. 1--3, 115--134 (2000; Zbl 0968.33011)] and can be considered as a special case of [\textit{C. Schneider}, Adv. Appl. Math. 34, No. 4, 740--767 (2005; Zbl 1078.33021)] formulated in the context of difference fields.





Describes a project that uses

Uses Software






This page was built for publication: The Abel-Zeilberger algorithm

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q640468)