"An Algorithm for Deciding Zero Equivalence of Nested Polynomially Recurrent Sequences"
, in Transactions on Algorithms, Vol. 3, Nummer 2, Seite(n) 1--13, 2007, ISBN: 1549-6325
An Algorithm for Deciding Zero Equivalence of Nested Polynomially Recurrent Sequences
Sprache des Titels:
We introduce the class of nested polynomially recurrent sequences which includes a large number of sequences that are of combinatorial interest. We present an algorithm for deciding zero equivalence of these sequences, thereby providing a new algorithm for proving identities among combinatorial sequences: in order to prove an identity, decide by the algorithm whether the difference of left hand side and right hand side is identically zero. This algorithm is able to treat mathematical objects which are not covered by any other known symbolic method for proving combinatorial identities. Despite its theoretical flavor and its high complexity, an implementation of the algorithm can be successfully applied to nontrivial examples.
Sprache der Kurzfassung:
Transactions on Algorithms
Anzahl der Seiten:
Notiz zur Publikation:
Aufsatz / Paper in sonstiger referierter Fachzeitschrift