@**article**{RISC2987,author = {Manuel Kauers},

title = {{An Algorithm for Deciding Zero Equivalence of Nested Polynomially Recurrent Sequences}},

language = {english},

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.
},

journal = {Transactions on Algorithms},

volume = {3},

number = {2},

pages = {1--13},

isbn_issn = {1549-6325},

year = {2007},

note = {article 18},

refereed = {yes},

length = {18}

}