Converging to Gosper's Algorithm

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

Research output: Working paper and reportsResearch report

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 coeficients.
Original languageEnglish
Place of PublicationRISC, Schloss Hagenberg, 4232 Hagenberg
PublisherRISC, JKU
Number of pages13
Publication statusPublished - Dec 2008

Publication series

NameRISC Report Series
No.08-20

Fields of science

  • 101 Mathematics
  • 101001 Algebra
  • 101005 Computer algebra
  • 101009 Geometry
  • 101012 Combinatorics
  • 101013 Mathematical logic
  • 101020 Technical mathematics

Cite this