Article ID Journal Published Year Pages File Type
439241 Theoretical Computer Science 2008 11 Pages PDF
Abstract

We consider a large class of sequences which are defined by systems of (possibly nonlinear) difference equations. A procedure for recursively enumerating the algebraic dependencies of such sequences is presented. Also a procedure for solving linear difference equations with such sequences as coefficients is proposed. The methods are illustrated on some problems arising in the literature on special functions and combinatorial sequences.

Related Topics
Physical Sciences and Engineering Computer Science Computational Theory and Mathematics