Zur Hauptnavigation wechseln Zur Suche wechseln Zum Hauptinhalt wechseln

Computing the Algebraic Relations of C-finite Sequences and Multisequences

Publikation: Preprints, Working Paper und ForschungsberichteForschungsbericht

Abstract

We present an algorithm for computing generators for the ideal of algebraic relations among sequences which are given by homogeneous linear recurrence equations with constant coefficients. Knowing these generators makes it possible to use Gr\"obner basis methods for carrying out certain basic operations in the ring of such sequences effectively. In particular, one can answer the question whether a given sequence can be represented in terms of other given sequences. A collection of examples, which were done with an implementation of our algorithm, is included.
OriginalspracheEnglisch
ErscheinungsortAltenbergerstrasse 69, 4040 Linz, Austria
HerausgeberJohannes Kepler Universität
Seitenumfang23
PublikationsstatusVeröffentlicht - 2006

Publikationsreihe

NameSFB F013 Reports
Nr.2006-24

Wissenschaftszweige

  • 101 Mathematik
  • 101001 Algebra
  • 101005 Computeralgebra
  • 101009 Geometrie
  • 101012 Kombinatorik
  • 101013 Mathematische Logik
  • 101020 Technische Mathematik

Dieses zitieren