Converging to Gosper's Algorithm
Classical Analysis and ODEs
2007-11-22 v1 Combinatorics
Abstract
Given two polynomials, we find a convergence property of the GCD of the rising factorial and the falling factorial. Based on this property, we present a unified approach to computing the universal denominators as given by Gosper's algorithm and Abramov's algorithm for finding rational solutions to linear difference equations with polynomial coefficients.
Keywords
Cite
@article{arxiv.0711.3386,
title = {Converging to Gosper's Algorithm},
author = {William Y. C. Chen and Peter Paule and Husam L. Saad},
journal= {arXiv preprint arXiv:0711.3386},
year = {2007}
}
Comments
13 pages