 
Summary: On Solutions of Linear Functional Systems
Sergei A. Abramov \Lambda
Computer Center of the
Russian Academy of Science
Vavilova 40, Moscow 117967, Russia
abramov@ccas.ru
Manuel Bronstein
INRIA  Projet Caf#
2004, Route des Lucioles, B.P. 93
F06902 Sophia Antipolis Cedex, France
Manuel.Bronstein@sophia.inria.fr
ABSTRACT
We describe a new direct algorithm for transforming a linear
system of recurrences into an equivalent one with nonsingu
lar leading or trailing matrix. Our algorithm, which is an
improvement to the EG elimination method [2], uses only
elementary linear algebra operations (ranks, kernels and de
terminants) to produce an equation satisøed by the degrees
of the solutions with ønite support. As a consequence, we
can bound and compute the polynomial and rational solu
