AbstractA detailed study of the degree setting for Gosper's algorithm for indefinite hypergeometric summation is presented. In particular, we discriminate between rational and proper hypergeometric input. As a result, the critical degree bound can be improved in the former case
Modern algorithmic techniques for summation, most of which were introduced in the 1990s, are develop...
ABSTRACT: Gosper’s algorithm is a cornerstone of automated summation of hypergeometric series. Milen...
Implementations of the celebrated Gosper algorithm (1978) for indefinite summation are available on ...
AbstractA detailed study of the degree setting for Gosper's algorithm for indefinite hypergeometric ...
this paper a detailed analysis of this degree setting is given. It turns out that the situation for ...
We exhibit a class of proper hypergeometric expressions which lead to a key equation with coefficien...
An algebraically motivated generalization of Gosper’s algorithm to indefinite bibasic hypergeometric...
The celebrated Zeilberger algorithm which finds holonomic recurrence equations for definite sums of ...
Title from first page of PDF file (viewed November 18, 2010)Includes bibliographical references (p. ...
In recent years, the problem of symbolic summation has received much attention due to the exciting a...
AbstractZeilberger's algorithm which finds holonomic recurrence equations for definite sums of hyper...
AbstractWe develop a method for deriving new basic hypergeometric identities from old ones by parame...
An algorithm for definite hypergeometric summation is given. It is based, in a non-obvious way, on G...
An algorithm for proving terminating hypergeometric identities, and thus binomial coefficients ident...
AbstractA decision procedure for finding closed forms for indefinite summation of polynomials, ratio...
Modern algorithmic techniques for summation, most of which were introduced in the 1990s, are develop...
ABSTRACT: Gosper’s algorithm is a cornerstone of automated summation of hypergeometric series. Milen...
Implementations of the celebrated Gosper algorithm (1978) for indefinite summation are available on ...
AbstractA detailed study of the degree setting for Gosper's algorithm for indefinite hypergeometric ...
this paper a detailed analysis of this degree setting is given. It turns out that the situation for ...
We exhibit a class of proper hypergeometric expressions which lead to a key equation with coefficien...
An algebraically motivated generalization of Gosper’s algorithm to indefinite bibasic hypergeometric...
The celebrated Zeilberger algorithm which finds holonomic recurrence equations for definite sums of ...
Title from first page of PDF file (viewed November 18, 2010)Includes bibliographical references (p. ...
In recent years, the problem of symbolic summation has received much attention due to the exciting a...
AbstractZeilberger's algorithm which finds holonomic recurrence equations for definite sums of hyper...
AbstractWe develop a method for deriving new basic hypergeometric identities from old ones by parame...
An algorithm for definite hypergeometric summation is given. It is based, in a non-obvious way, on G...
An algorithm for proving terminating hypergeometric identities, and thus binomial coefficients ident...
AbstractA decision procedure for finding closed forms for indefinite summation of polynomials, ratio...
Modern algorithmic techniques for summation, most of which were introduced in the 1990s, are develop...
ABSTRACT: Gosper’s algorithm is a cornerstone of automated summation of hypergeometric series. Milen...
Implementations of the celebrated Gosper algorithm (1978) for indefinite summation are available on ...
DOI
Add to ORKG