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