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.
| Original language | English |
|---|---|
| Pages (from-to) | 217-227 |
| Number of pages | 11 |
| Journal | Theoretical Computer Science |
| Volume | 401 |
| Issue number | 1-3 |
| DOIs | |
| Publication status | Published - 23 Jul 2008 |
Fields of science
- 101 Mathematics
- 101001 Algebra
- 101005 Computer algebra
- 101009 Geometry
- 101012 Combinatorics
- 101013 Mathematical logic
- 101020 Technical mathematics