Sciweavers

CASC
2010
Springer
160views Mathematics» more  CASC 2010»
13 years 3 months ago
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 ...
Sergei A. Abramov, A. Gheffar, D. E. Khmelnov
CORR
2006
Springer
87views Education» more  CORR 2006»
13 years 4 months ago
Low Complexity Algorithms for Linear Recurrences
We consider two kinds of problems: the computation of polynomial and rational solutions of linear recurrences with coefficients that are polynomials with integer coefficients; ind...
Alin Bostan, Frédéric Chyzak, Bruno ...
CORR
2010
Springer
85views Education» more  CORR 2010»
13 years 4 months ago
Partial Denominator Bounds for Partial Linear Difference Equations
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 polynom...
Manuel Kauers, Carsten Schneider