Converging to Gosper's Algorithm

Simple item page
dc.creatorChen, William Y. C.
dc.creatorPaule, Peter
dc.creatorSaad, Husam L.
dc.date2007-11-21
dc.date.accessioned2026-07-07T08:44:15Z
dc.date.available2026-07-07T08:44:15Z
dc.descriptionGiven 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.
dc.description13 pages
dc.identifierhttps://arxiv.org/abs/0711.3386
dc.identifierhttp://arxiv.org/abs/0711.3386
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/142593
dc.subjectClassical Analysis and ODEs
dc.subjectCombinatorics
dc.subject33F10; 05A19
dc.titleConverging to Gosper's Algorithm
dc.typetext

Files

Collections

arXiv