Fetching the paper…
Reading the bibliography…
Usually creative telescoping is used to derive recurrences for sums.
S.A. Abramov, On the summation of rational functions , Zh. vychisl. mat. Fiz. 11
1971
Earlier work this paper cites.
R.W. Gosper, Decision procedures for indefinite hypergeometric summation , Proc. Nat. Acad. Sci. U.S.A. 75
1978
Earlier work this paper cites.
A. van der Poorten, A proof that Euler missed… Apéry’s proof of the irrationality of ζ ( 3 ) \zeta(3) , Math. Intelligencer 1
1979
Earlier work this paper cites.
M. Karr, Summation in finite terms , J. ACM 28
1981
Earlier work this paper cites.
D. Zeilberger, The method of creative telescoping , J. Symbolic Comput. 11
1991
Earlier work this paper cites.
P. Paule, Greatest factorial factorization and symbolic summation , J. Symbolic Comput. 20
1995
Earlier work this paper cites.
P. Paule and M. Schorn, A Mathematica version of Zeilberger’s algorithm for proving binomial coefficient identities , J. Symbolic Comput. 20
1995
Earlier work this paper cites.
M. Petkovšek, H. S. Wilf, and D. Zeilberger, a = b a=b , A. K. Peters, Wellesley, MA, 1996
1996
Earlier work this paper cites.
I. Nemes and P. Paule, A canonical form guide to symbolic summation , Advances in the Design of Symbolic Computation Systems (A. Miola and M. Temperini, eds.), Texts Monogr. Symbol. Comput., Springer, Wien-New York, 1997, pp. 84–110
1997
Earlier work this paper cites.
P. Paule and A. Riese, A Mathematica q-analogue of Zeilberger’s algorithm based on an algebraically motivated aproach to q q -hypergeometric telescoping , Special Functions, q-Series and Related Topics (M. Ismail and M. Rahman, eds.), vol. 14, Fields Institute Toronto, AMS, 1997, pp. 179–210
1997
Cited alongside, same era.
A. Bauer and M. Petkovšek, Multibasic and mixed hypergeometric Gosper-type algorithms , J. Symbolic Comput. 28
1999
Cited alongside, same era.
M. Bronstein, On solutions of linear ordinary difference equations in their coefficient field , J. Symbolic Comput. 29
2000
Cited alongside, same era.
C. Schneider, Symbolic summation in difference fields , Tech. Report 01-17, RISC-Linz, J. Kepler University, November 2001, PhD Thesis
2001
Cited alongside, same era.
S.A. Abramov and M. Petkovšek, Rational normal forms and minimal decompositions of hypergeometric terms , J. Symbolic Comput. 33
by same author, A collection of denominator bounds to solve parameterized linear difference equations in Π Σ {\Pi}{\Sigma} -extensions , An. Univ. Timişoara Ser. Mat.-Inform. 42
2004
Later among the works it cites.
by same author, The summation package Sigma: Underlying principles and a rhombus tiling application , Discrete Math. Theor. Comput. Sci. 6
2004
Later among the works it cites.
by same author, Degree bounds to find polynomial solutions of parameterized linear difference equations in Π Σ {\Pi}{\Sigma} -fields , Appl. Algebra Engrg. Comm. Comput. 16
2005
Later among the works it cites.
by same author, Product representations in Π Σ {\Pi}{\Sigma} -fields , Ann. Comb. 9
2005
Later among the works it cites.
by same author, Solving parameterized linear difference equations in terms of indefinite nested sums and products , J. Differ. Equations Appl. 11
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
2002
Cited alongside, same era.
by same author, When does Zeilberger’s algorithm succeed? , Adv. in Appl. Math. 30
2003
Cited alongside, same era.
P. Paule and C. Schneider, Computer proofs of a new family of harmonic number identities , Adv. in Appl. Math. 31
2003
Cited alongside, same era.
by same author, Contiguous relations and creative telescoping , Preprint (2004)
2004
Cited alongside, same era.
2005
Later among the works it cites.
by same author, Simplifying Sums in Π Σ \Pi\Sigma -Extensions , J. Algebra Appl. 6
2007
Later among the works it cites.
by same author, Symbolic summation assists combinatorics , Sém. Lothar. Combin. 56
2007
Later among the works it cites.
by same author, A refined difference field theory for symbolic summation , J. Symbolic Comput. 43
2008
Closest in time.