Partial denominator bounds for partial linear difference equations

Authors:
Manuel Kauers;Carsten Schneider
Affiliations:
RISC, Johannes Kepler University, Linz, (Austria);RISC, Johannes Kepler University, Linz, (Austria)
Venue:
Proceedings of the 2010 International Symposium on Symbolic and Algebraic Computation
Year:
2010

Citing 7
Cited 3

Fast algorithms to search for the rational solutions of linear differential equations with polynomial coefficients

ISSAC '91 Proceedings of the 1991 international symposium on Symbolic and algebraic computation
Hypergeometric solutions of linear recurrences with polynomial coefficients

Journal of Symbolic Computation - Special issue on symbolic computation in combinatorics
Rational solutions of linear difference and q-difference equations with polynomial coefficients

ISSAC '95 Proceedings of the 1995 international symposium on Symbolic and algebraic computation
Rational solutions of linear difference equations

ISSAC '98 Proceedings of the 1998 international symposium on Symbolic and algebraic computation
Rational solutions of matrix difference equations: the problem of equivalence and factorization

ISSAC '99 Proceedings of the 1999 international symposium on Symbolic and algebraic computation
On solutions of linear ordinary difference equations in their coefficient field

Journal of Symbolic Computation
Low complexity algorithms for linear recurrences

Proceedings of the 2006 international symposium on Symbolic and algebraic computation

A refined denominator bounding algorithm for multivariate linear difference equations

Proceedings of the 36th international symposium on Symbolic and algebraic computation
On polynomial solutions of linear partial differential and (q-)difference equations

CASC'12 Proceedings of the 14th international conference on Computer Algebra in Scientific Computing
On rational solutions of linear partial differential or difference equations

Programming and Computing Software

Quantified Score

Hi-index	0.00

Visualization

Abstract

We investigate which polynomials can possibly occur as factors in the denominators of rational solutions of a given partial linear difference equation (PLDE). Two kinds of polynomials are to be distinguished, we call them periodic and aperiodic. The main result is a generalization of a well-known denominator bounding technique for univariate equations to PLDEs. This generalization is able to find all the aperiodic factors of the denominators for a given PLDE.