Converging to Gosper's algorithm

From MaRDI portal
Publication:950412

DOI10.1016/J.AAM.2007.11.004zbMATH Open1173.33316arXiv0711.3386OpenAlexW2093552810MaRDI QIDQ950412FDOQ950412

Husam L. Saad, William Y. C. Chen, Peter Paule

Publication date: 22 October 2008

Published in: Advances in Applied Mathematics (Search for Journal in Brave)

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.


Full work available at URL: https://arxiv.org/abs/0711.3386





Cites Work


Cited In (5)

Uses Software






This page was built for publication: Converging to Gosper's algorithm

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q950412)