Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
401728 | Journal of Symbolic Computation | 2008 | 17 Pages |
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öbner 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.
Related Topics
Physical Sciences and Engineering
Computer Science
Artificial Intelligence