The Abel-Zeilberger algorithm

From MaRDI portal
Publication:640468

zbMATH Open1231.33029arXiv1105.0178MaRDI QIDQ640468FDOQ640468

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

Publication date: 18 October 2011

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

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.


Full work available at URL: https://arxiv.org/abs/1105.0178

File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)






Cited In (11)

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)