Factorization of Polynomials and GCD Computations for Finding Universal Denominators

We discuss the algorithms which, given a linear difference equation with rational function coefficients over a field k of characteristic 0, compute a polynomial U(x) ∈ k[x] (a universal denominator) such that the denominator of each of rational solutions (if exist) of the given equation divides U(x). We consider two types of such algorithms. One of them is based on constructing a set of irreducible polynomials that are candidates for divisors of denominators of rational solutions, and on finding a bound for the exponent of each of these candidates (the full factorization of polynomials is used). The second one is related to earlier algorithms for finding universal denominators, where the computation of gcd was used instead of the full factorization. The algorithms are applicable to scalar equations of arbitrary orders as well as to systems of first-order equations. A complexity analysis and a time comparison of the algorithms implemented in Maple are presented.

[1]  M. V. Hoeij.  Factoring Polynomials and the Knapsack Problem , 2002 .

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

[3]  Sergei A. Abramov,et al.  Valuations of rational solutions of linear difference equations at irreducible polynomials , 2011, Adv. Appl. Math..

[4]  Moulay A. Barkatou,et al.  Rational solutions of first order linear difference systems , 1998, ISSAC '98.

[5]  Joachim von zur Gathen,et al.  Modern Computer Algebra (3. ed.) , 2003 .

[6]  Joachim von zur Gathen,et al.  Modern Computer Algebra , 1998 .

[7]  Mark van Hoeij,et al.  Integration of solutions of linear functional equations , 1999 .

[8]  S. Abramov,et al.  Indicial rational functions of linear ordinary differential equations with polynomial coefficients , 2009 .

[9]  P. Robba,et al.  Rational solutions of linear differential equations , 1989 .

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

[11]  D. E. Khmelnov,et al.  Search for Polynomial Solutions of Linear Functional Systems by Means of Induced Recurrences , 2004, Programming and Computer Software.

[12]  Mark van Hoeij,et al.  Liouvillian solutions of irreducible second order linear difference equations , 2010, ISSAC.

[13]  Mark van Hoeij,et al.  Rational solutions of linear difference equations , 1998, ISSAC '98.

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

[15]  P. Natali,et al.  Endothelin receptors as novel targets in tumor therapy , 2004, Journal of Translational Medicine.

[16]  Jürgen Gerhard,et al.  Modular Algorithms in Symbolic Summation and Symbolic Integration , 2005, Lecture Notes in Computer Science.

[17]  S. Abramov.  On the summation of rational functions , 1971 .

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

[19]  Mark van Hoeij,et al.  A method for the integration of solutions of Ore equations , 1997, ISSAC.

[20]  Donald E. Knuth,et al.  Big Omicron and big Omega and big Theta , 1976, SIGA.

[21]  Yiu-Kwong Man,et al.  Fast polynomial dispersion computation and its application to indefinite summation , 1994, ISSAC '94.