Article ID Journal Published Year Pages File Type
9513181 Discrete Mathematics 2005 16 Pages PDF
Abstract
We present an algorithm which computes a non-trivial lower bound for the order of the minimal telescoper for a given hypergeometric term. The combination of this algorithm and techniques from indefinite summation leads to an efficiency improvement in Zeilberger's algorithm. We also describe a Maple implementation, and conduct experiments which show the improvement that it makes in the construction of the telescopers.
Related Topics
Physical Sciences and Engineering Mathematics Discrete Mathematics and Combinatorics
Authors
, ,