The Abel-Zeilberger algorithm
The electronic journal of combinatorics, The Zeilberger Festschrift volume, Tome 18 (2011) no. 2
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.
DOI :
10.37236/2013
Classification :
33F10, 68W30, 05A19, 39A10
Mots-clés : symbolic summation, hypergeoemtric sequences, holonomic sequences
Mots-clés : symbolic summation, hypergeoemtric sequences, holonomic sequences
@article{10_37236_2013,
author = {William Y.C. Chen and Qing-Hu Hou and Hai-Tao Jin},
title = {The {Abel-Zeilberger} algorithm},
journal = {The electronic journal of combinatorics},
year = {2011},
volume = {18},
number = {2},
doi = {10.37236/2013},
zbl = {1231.33029},
url = {http://geodesic.mathdoc.fr/articles/10.37236/2013/}
}
William Y.C. Chen; Qing-Hu Hou; Hai-Tao Jin. The Abel-Zeilberger algorithm. The electronic journal of combinatorics, The Zeilberger Festschrift volume, Tome 18 (2011) no. 2. doi: 10.37236/2013
Cité par Sources :