Abstract
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.
| Original language | English |
|---|---|
| Article number | 1240241 |
| Pages (from-to) | 1-13 |
| Number of pages | 18 |
| Journal | ACM Transactions on Algorithms |
| Volume | 3 |
| Issue number | 2 |
| DOIs | |
| Publication status | Published - 01 May 2007 |
Fields of science
- 101 Mathematics
- 101001 Algebra
- 101005 Computer algebra
- 101009 Geometry
- 101012 Combinatorics
- 101013 Mathematical logic
- 101020 Technical mathematics