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.
Full Text
Paper version not known
Published Version
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call