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.
Recommendations
Cited in
(13)- A note on Abel's partial summation formula
- Four families of summation formulas involving generalized harmonic numbers
- Whipple-type 3F2-series and summation formulae involving generalized harmonic numbers
- WZ-style certification and sister celine's technique for abel-type sums
- Watson-type3F2-series and summation formulae involving generalized harmonic numbers
- Abel's lemma and identities on harmonic numbers
- Finite binomial sum identities with harmonic numbers
- The expected value under the Yule model of the squared path-difference distance
- Term algebras, canonical representations and difference ring theory for symbolic summation
- Algorithmic solution of Abel's equation
- A Saalschütz-type identity and summation formulae involving generalized harmonic numbers
- Derivative operator and summation formulae involving generalized harmonic numbers
- Log-convexity and log-concavity for series in gamma ratios and applications
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)