On Polynomial Solutions of Linear Partial Differential and (q-)Difference Equations

We prove that the question of whether a given linear partial differential or difference equation with polynomial coefficients has non-zero polynomial solutions is algorithmically undecidable. However, for equations with constant coefficients this question can be decided very easily since such an equation has a non-zero polynomial solution iff its constant term is zero. We give a simple combinatorial proof of the fact that in this case the equation has polynomial solutions of all degrees. For linear partial q-difference equations with polynomial coefficients, the question of decidability of existence of non-zero polynomial solutions remains open. Nevertheless, for such equations with constant coefficients we show that the space of polynomial solutions can be described algorithmically. We present examples which demonstrate that, in contrast with the differential and difference cases where the dimension of this space is either infinite or zero, in the q-difference case it can also be finite and non-zero.

[1]  Moulay A. Barkatou,et al.  On Rational Solutions of Systems of Linear Differential Equations , 1999, J. Symb. Comput..

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

[3]  George E. Andrews,et al.  q-series : their development and application in analysis, number theory, combinatorics, physics, and computer algebra , 1986 .

[4]  Hilbert's tenth problem , 1975 .

[5]  Werner M. Seiler,et al.  Involution - The Formal Theory of Differential Equations and its Applications in Computer Algebra , 2009, Algorithms and computation in mathematics.

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

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

[8]  W. J. Thron,et al.  Encyclopedia of Mathematics and its Applications. , 1982 .

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

[10]  Werner M. Seiler.  Formal Geometry of Differential Equations , 2009 .

[11]  B. Sturmfels.  SOLVING SYSTEMS OF POLYNOMIAL EQUATIONS , 2002 .

[12]  T. Pheidas,et al.  Undecidability of existential theories of rings and fields: a survey. , 2000 .

[13]  Uli Walther,et al.  Computing Homomorphisms Between Holonomic D-modules , 2001, J. Symb. Comput..

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

[15]  Manuel Kauers,et al.  A refined denominator bounding algorithm for multivariate linear difference equations , 2011, ISSAC '11.

[16]  Moulay A. Barkatou.  Rational Solutions of Linear Differential Systems , 2006 .

[17]  S. P. Smith,et al.  Polynomial solutions to constant coefficient differential equations , 1992 .

[18]  T. Oaku,et al.  Polynomial and rational solutions of holonomic systems , 2000 .

[19]  Anton Leykin.  D-MODULES FOR MACAULAY 2 , 2002 .

[20]  Emil Grosswald,et al.  The Theory of Partitions , 1984 .

[21]  Manuel Kauers,et al.  Partial denominator bounds for partial linear difference equations , 2010, ISSAC.

[22]  John Rischard Rice,et al.  Mathematical Software , 1971 .

[23]  L. Lipshitz,et al.  Power series solutions of algebraic differential equations , 1984 .

[24]  Sergei A. Abramov,et al.  On some decidable and undecidable problems related to q-difference equations with parameters , 2010, ISSAC.