AbstractWe observe that many special functions are solutions of so-called holonomic systems. Bernstein's deep theory of holonomic systems is then invoked to show that any identity involving sums and integrals of products of these special functions can be verified in a finite number of steps. This is partially substantiated by an algorithm that proves terminating hypergeometric series identities, and that is given both in English and in MAPLE
AbstractIn Koepf (1992) it was shown how for a given holonomic function a representation as a formal...
This thesis deals with a method of expressing, as infinite products, some special limiting cases of ...
This paper presents a general method for proving and discovering combinatorial identities: to prove ...
The Holonomic Systems Approach was proposed in the early 1990s by Doron Zeilberger and has turned ou...
We present the Mathematica package HolonomicFunctions which provides a powerful frame-work for the a...
This thesis shows how computer algebra makes it possible to manipulate a large class of sequences an...
International audienceWe extend Zeilberger's approach to special function identities to cases that a...
AbstractZeilberger's algorithm which finds holonomic recurrence equations for definite sums of hyper...
An algorithm for definite hypergeometric summation is given. It is based, in a non-obvious way, on G...
This book presents a geometric theory of complex analytic integrals representing hypergeometric func...
AbstractWe extend Zeilberger's fast algorithm for definite hypergeometric summation to non-hypergeom...
This manual describes the functionality of the Mathematica package Holo-nomicFunctions. It is a very...
AbstractAn algorithm for proving terminating hypergeometric identities, and thus binomial coefficien...
Holonomic functions and sequences have the property that they can be represented by a finite amount ...
Title from first page of PDF file (viewed November 18, 2010)Includes bibliographical references (p. ...
AbstractIn Koepf (1992) it was shown how for a given holonomic function a representation as a formal...
This thesis deals with a method of expressing, as infinite products, some special limiting cases of ...
This paper presents a general method for proving and discovering combinatorial identities: to prove ...
The Holonomic Systems Approach was proposed in the early 1990s by Doron Zeilberger and has turned ou...
We present the Mathematica package HolonomicFunctions which provides a powerful frame-work for the a...
This thesis shows how computer algebra makes it possible to manipulate a large class of sequences an...
International audienceWe extend Zeilberger's approach to special function identities to cases that a...
AbstractZeilberger's algorithm which finds holonomic recurrence equations for definite sums of hyper...
An algorithm for definite hypergeometric summation is given. It is based, in a non-obvious way, on G...
This book presents a geometric theory of complex analytic integrals representing hypergeometric func...
AbstractWe extend Zeilberger's fast algorithm for definite hypergeometric summation to non-hypergeom...
This manual describes the functionality of the Mathematica package Holo-nomicFunctions. It is a very...
AbstractAn algorithm for proving terminating hypergeometric identities, and thus binomial coefficien...
Holonomic functions and sequences have the property that they can be represented by a finite amount ...
Title from first page of PDF file (viewed November 18, 2010)Includes bibliographical references (p. ...
AbstractIn Koepf (1992) it was shown how for a given holonomic function a representation as a formal...
This thesis deals with a method of expressing, as infinite products, some special limiting cases of ...
This paper presents a general method for proving and discovering combinatorial identities: to prove ...