go-v.orgdoi

The Abel-Zeilberger Algorithm

William Y. C. Chen, Qing-Hu Hou, Hai-Tao Jin · The Electronic Journal of Combinatorics · 2011

  • DOI 10.37236/2013
  • Publisher Electronic Journal of Combinatorics
  • Type article
  • Issued 2011

Not cached yet. This record was fetched live for this request and is stored after the lookup. Reopening the page should serve the cached copy.

The Electronic Journal of Combinatorics · Electronic Journal of Combinatorics · article · 2011

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.

Open the resolved locator · 10.37236/2013

Metadata licence: OpenAlex metadata (CC0)