We consider a large class of sequences, called admissible 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 admissible 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 |
|---|
| Place of Publication | Johannes Kepler University, Altenberger Str. 69, 4040 Linz |
|---|
| Publisher | SFB |
|---|
| Number of pages | 23 |
|---|
| Publication status | Published - Dec 2005 |
|---|
| Name | SFB F013 Reports |
|---|
| No. | 2005-20 |
|---|
- 101 Mathematics
- 101001 Algebra
- 101005 Computer algebra
- 101009 Geometry
- 101012 Combinatorics
- 101013 Mathematical logic
- 101020 Technical mathematics