Converging to Gosper's algorithm

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. Our approach easily extends to the q-analogues.

[1]  Doron Zeilberger,et al.  An algorithmic proof theory for hypergeometric (ordinary and “q”) multisum/integral identities , 1992 .

[2]  Sergei A. Abramov,et al.  Special formal series solutions of linear operator equations , 2000, Discret. Math..

[3]  S. A. Abramov,et al.  Rational solutions of linear differential and difference equations with polynomial coefficients , 1991 .

[4]  Saulo Alves de Araujo,et al.  Identification of novel keloid biomarkers through Profiling of Tissue Biopsies versus Cell Cultures in Keloid Margin specimens Compared to adjacent Normal Skin , 2010, Eplasty.

[5]  Manuel Bronstein,et al.  On polynomial solutions of linear operator equations , 1995, ISSAC '95.

[6]  Peter Paule,et al.  SYMBOLIC SUMMATION SOME RECENT DEVELOPMENTS , 1995 .

[7]  Doron Zeilberger,et al.  The Method of Creative Telescoping , 1991, J. Symb. Comput..

[8]  Moulay A. Barkatou,et al.  Rational solutions of matrix difference equations: the problem of equivalence and factorization , 1999, ISSAC '99.

[9]  Doron Zeilberger.  A fast algorithm for proving terminating hypergeometric identities , 2006, Discret. Math..

[10]  Doron Zeilberger,et al.  A fast algorithm for proving terminating hypergeometric identities , 1990, Discret. Math..

[11]  Peter Paule,et al.  Greatest Factorial Factorization and Symbolic Summation , 1995, J. Symb. Comput..

[12]  Petr Lisonek,et al.  Improvement of the Degree Setting in Gospers's Algorithm , 1993, J. Symb. Comput..

[13]  G. Rw.  Decision procedure for indefinite hypergeometric summation , 1978 .

[14]  Marko Petkovsek.  A generalization of Gosper's algorithm , 1994, Discret. Math..

[15]  Ronald L. Graham,et al.  Concrete mathematics - a foundation for computer science , 1991 .

[16]  Marko Petkovsek,et al.  Hypergeometric Solutions of Linear Recurrences with Polynomial Coefficents , 1992, J. Symb. Comput..

[17]  D. Zeilberger.  A holonomic systems approach to special functions identities , 1990 .

[18]  Alin Bostan,et al.  Low complexity algorithms for linear recurrences , 2006, ISSAC '06.

[19]  Laureano Gonzalez-vega,et al.  Computer Algebra in Science and Engineering , 1995 .

[20]  Sergei A. Abramov.  Rational solutions of linear difference and q-difference equations with polynomial coefficients , 1995, ISSAC '95.