Eugene Zima, Wilfrid Laurier University

Abstract

One well-known longstanding problem with Gosper’s algorithm is that its running time depends at least linearly on the dispersion of the rational certificate of the summand, and this last can be exponentially large in the bit size of the summand. This makes summation problems for hypergeometric terms with large dispersion values effectively intractable. We show that for summable terms this dependency is not essential (can be removed). The structure of polynomial solutions to the Gospe key equation is analyzed. A method for rapid extractionsof simple high-degree factors of the solution is given. Resulting modified Gosper's algorithm is presented. This result is based on very simple and well-known facts, properties, and lazy evaluation rules of factorial polynomials. Experimental Maple implementation confirms practical acceleration in computing of indefinite sums and rational normal forms of hypergeometric terms.

Link to video: https://vimeo.com/642181749

Presented Via Zoom: https://rutgers.zoom.us/j/94346444480

Password: 6564120420

For further information see: https://sites.math.rutgers.edu/~zeilberg/expmath/