Converging to Gosper's Algorithm

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

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.
13 pages

Keywords

Classical Analysis and ODEs, Combinatorics, 33F10; 05A19

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/142593

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/0711.3386
 http://arxiv.org/abs/0711.3386

Collections

arXiv