DOIAbstract
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
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
We consider a class of sums over products of Z-sums whose arguments differ by a symbolic integer. Su...
Modern algorithmic techniques for summation, most of which were introduced in the 1990s, are develop...
AbstractZeilberger's algorithm which finds holonomic recurrence equations for definite sums of hyper...
The Holonomic Systems Approach was proposed in the early 1990s by Doron Zeilberger and has turned ou...
15 pagesCreative telescoping is an algorithmic method initiated by Zeilberger to compute definite su...
International audienceCreative telescoping is a powerful computer algebra paradigm -initiated by Dor...
International audienceCreative telescoping is a powerful computer algebra paradigm -initiated by Dor...
AbstractA detailed study of the degree setting for Gosper's algorithm for indefinite hypergeometric ...
AbstractThis paper is an exposition of different methods for computing closed forms of definite sums...
The celebrated Zeilberger algorithm which finds holonomic recurrence equations for definite sums of ...
AbstractA detailed study of the degree setting for Gosper's algorithm for indefinite hypergeometric ...
We consider a class of sums over products of Z-sums whose arguments differ by a symbolic integer. Su...
AbstractWe extend Zeilberger's fast algorithm for definite hypergeometric summation to non-hypergeom...
We consider a class of sums over products of Z-sums whose arguments differ by a symbolic integer. Su...
Abstract The aim of this article is twofold: on the one hand it is intended to serve as a gentle int...
We consider a class of sums over products of Z-sums whose arguments differ by a symbolic integer. Su...
Modern algorithmic techniques for summation, most of which were introduced in the 1990s, are develop...
AbstractZeilberger's algorithm which finds holonomic recurrence equations for definite sums of hyper...
The Holonomic Systems Approach was proposed in the early 1990s by Doron Zeilberger and has turned ou...
15 pagesCreative telescoping is an algorithmic method initiated by Zeilberger to compute definite su...
International audienceCreative telescoping is a powerful computer algebra paradigm -initiated by Dor...
International audienceCreative telescoping is a powerful computer algebra paradigm -initiated by Dor...
AbstractA detailed study of the degree setting for Gosper's algorithm for indefinite hypergeometric ...
AbstractThis paper is an exposition of different methods for computing closed forms of definite sums...
The celebrated Zeilberger algorithm which finds holonomic recurrence equations for definite sums of ...
AbstractA detailed study of the degree setting for Gosper's algorithm for indefinite hypergeometric ...
We consider a class of sums over products of Z-sums whose arguments differ by a symbolic integer. Su...
AbstractWe extend Zeilberger's fast algorithm for definite hypergeometric summation to non-hypergeom...
We consider a class of sums over products of Z-sums whose arguments differ by a symbolic integer. Su...
Abstract The aim of this article is twofold: on the one hand it is intended to serve as a gentle int...
We consider a class of sums over products of Z-sums whose arguments differ by a symbolic integer. Su...
Modern algorithmic techniques for summation, most of which were introduced in the 1990s, are develop...
AbstractZeilberger's algorithm which finds holonomic recurrence equations for definite sums of hyper...
Add to ORKG