Solving Difference Equations whose Coefficients are not Transcendental

Research output: Working paper and reportsResearch report

Abstract

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 languageEnglish
Place of PublicationJohannes Kepler University, Altenberger Str. 69, 4040 Linz
PublisherSFB
Number of pages23
Publication statusPublished - Dec 2005

Publication series

NameSFB F013 Reports
No.2005-20

Fields of science

  • 101 Mathematics
  • 101001 Algebra
  • 101005 Computer algebra
  • 101009 Geometry
  • 101012 Combinatorics
  • 101013 Mathematical logic
  • 101020 Technical mathematics

Cite this