A holonomic systems approach to special functions identities
Journal of Computational and Applied Mathematics
GFUN: a Maple package for the manipulation of generating and holonomic functions in one variable
ACM Transactions on Mathematical Software (TOMS)
A course in computational algebraic number theory
A course in computational algebraic number theory
RComp: a Mathematica package for computing with recursive sequences
Journal of Symbolic Computation - Special issue on symbolic computation in combinatorics
Journal of the ACM (JACM)
Solving difference equations whose coefficients are not transcendental
Theoretical Computer Science
Aligator: A Mathematica Package for Invariant Generation (System Description)
IJCAR '08 Proceedings of the 4th international joint conference on Automated Reasoning
Summing symbols in mutual recurrences
COCOON'11 Proceedings of the 17th annual international conference on Computing and combinatorics
A complete invariant generation approach for p-solvable loops
PSI'09 Proceedings of the 7th international Andrei Ershov Memorial conference on Perspectives of Systems Informatics
| Hi-index | 0.00 |
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 Grobner 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.