The method of creative telescoping

Authors:
Doron Zeilberger
Affiliations:
Department of Mathematics and Computer Science, Temple University, Philadelphia, PA 19122, USA
Venue:
Journal of Symbolic Computation
Year:
1991

Citing 2
Cited 41

A fast algorithm for proving terminating hypergeometric identities

Discrete Mathematics
The method of differentiating under the integral sign

Journal of Symbolic Computation

The method of differentiating under the integral sign

Journal of Symbolic Computation
A maple program for proving hypergeometric identities

ACM SIGSAM Bulletin
Finding all hypergeometric solutions of linear differential equations

ISSAC '93 Proceedings of the 1993 international symposium on Symbolic and algebraic computation
Fast polynomial dispersion computation and its application to indefinite summation

ISSAC '94 Proceedings of the international symposium on Symbolic and algebraic computation
REDUCE package for the indefinite and definite summation

ACM SIGSAM Bulletin
On polynomial solutions of linear operator equations

ISSAC '95 Proceedings of the 1995 international symposium on Symbolic and algebraic computation
High degree solutions of low degree equations (extended abstract)

ISSAC '98 Proceedings of the 1998 international symposium on Symbolic and algebraic computation
One-dimensional quantum walks

STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Computing the minimal telescoper for sums of hypergeometric terms

ACM SIGSAM Bulletin
On the q-Analogue of Zeilberger's Algorithm to Rational Functions

Programming and Computing Software
A criterion for the applicability of Zeilberger's algorithm to rational functions

Discrete Mathematics
(-1)-enumeration of plane partitions with complementation symmetry

Advances in Applied Mathematics - Special issue on: Formal power series and algebraic combinatorics in memory of Rodica Simion, 1955-2000
A direct algorithm to construct the minimal Z-pairs for rational functions

Advances in Applied Mathematics - Special issue on: Formal power series and algebraic combinatorics in memory of Rodica Simion, 1955-2000
Applicability of Zeilberger's algorithm to hypergeometric terms

Proceedings of the 2002 international symposium on Symbolic and algebraic computation
Simplification of definite sums of rational functions by creative symmetrizing method

Proceedings of the 2002 international symposium on Symbolic and algebraic computation
Cited References

Computer algebra handbook
Algorithmic problem solving

Encyclopedia of Computer Science
Effective scalar products of D-finite symmetric functions

Journal of Combinatorial Theory Series A
Low complexity algorithms for linear recurrences

Proceedings of the 2006 international symposium on Symbolic and algebraic computation
Application of unspecified sequences in symbolic summation

Proceedings of the 2006 international symposium on Symbolic and algebraic computation
A telescoping method for double summations

Journal of Computational and Applied Mathematics
Improved universal denominators

Programming and Computing Software
Differential equations for algebraic functions

Proceedings of the 2007 international symposium on Symbolic and algebraic computation
A refined difference field theory for symbolic summation

Journal of Symbolic Computation
Rogers-Ramanujan computer searches

Journal of Symbolic Computation
Applicability of the q-analogue of Zeilberger's algorithm

Journal of Symbolic Computation
Sharp upper bounds for the orders of the recurrences output by the Zeilberger and q-Zeilberger algorithms

Journal of Symbolic Computation
Polynomial ring automorphisms, rational (w,σ)-canonical forms, and the assignment problem

Journal of Symbolic Computation
Complexity of creative telescoping for bivariate rational functions

Proceedings of the 2010 International Symposium on Symbolic and Algebraic Computation
Estimating self-sustainability in peer-to-peer swarming systems

Performance Evaluation
The method of combinatorial telescoping

Journal of Combinatorial Theory Series A
A refined denominator bounding algorithm for multivariate linear difference equations

Proceedings of the 36th international symposium on Symbolic and algebraic computation
Abstracts of conferences in honor of Doron Zeilberger's 60th birthday

ACM Communications in Computer Algebra
A definite summation of hypergeometric terms of special kind

Programming and Computing Software
Subanalytic solutions of linear difference equations and multidimensional hypergeometric sequences

Journal of Symbolic Computation
Note: Counting humps in Motzkin paths

Discrete Applied Mathematics
Combinatorial telescoping for an identity of Andrews on parity in partitions

European Journal of Combinatorics
The extended Zeilberger algorithm with parameters

Journal of Symbolic Computation
Trading order for degree in creative telescoping

Journal of Symbolic Computation
Creative telescoping for rational functions using the griffiths: dwork method

Proceedings of the 38th international symposium on International symposium on symbolic and algebraic computation
Minors of a class of Riordan arrays related to weighted partial Motzkin paths

European Journal of Combinatorics

Quantified Score

Hi-index	0.00

Visualization

Abstract

An algorithm for definite hypergeometric summation is given. It is based, in a non-obvious way, on Gosper's algorithm for definite hypergeometric summation, and its theoretical justification relies on Bernstein's theory of holonomic systems.