A Direct Algorithm to Construct Zeilberger's Recurrences for Rational Functions
Ha Le
To appear at
Formal Power Series and Algebraic Combinatorics (FPSAC01), Tempe, Arizona (USA), May 20-26, 2001
Abstract
We present a direct algorithm to construct Zeilberger's recurrences for rational functions. We also describe a Maple implementation of the algorithm and show timing comparisons between this algorithm and other related algorithms.
Server
START
Conference Manager
Update Time
23 Feb 2001 at 08:48:03
Maintainer
maylis@labri.u-bordeaux.fr.
Conference Systems