@article{10.1145/1240233.1240241,
    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 lefthand-side and righthand-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 high complexity, an implementation of the algorithm can be successfully applied to nontrivial examples.},
    Address = {New York, NY, USA},
    Author = {Kauers, Manuel},
    File = {An Algorithm for Deciding Zero Equivalence of Nested Polynomially Recurrent Sequences - kauers06p.pdf},
    ISSN = {1549-6325},
    Journal = {ACM Trans. Algorithms},
    Keywords = {nested polynomially recurrent sequences, combinatorial sequences, Symbolic computation, zero equivalence},
    Month = {may},
    Number = {2},
    Pages = {18--es},
    Publisher = {Association for Computing Machinery},
    Title = {An Algorithm for Deciding Zero Equivalence of Nested Polynomially Recurrent Sequences},
    URL = {https://doi.org/10.1145/1240233.1240241},
    Volume = {3},
    Year = {2007},
    bdsk-url-1 = {https://doi.org/10.1145/1240233.1240241},
    date-added = {2021-12-01 11:35:21 +0100},
    date-modified = {2021-12-01 11:35:21 +0100},
    file-2 = {An Algorithm for Deciding Zero Equivalence of Nested Polynomially Recurrent Sequence - 1240233.1240241.pdf},
    issue_date = {May 2007},
    numpages = {14},
    doi = {10.1145/1240233.1240241}
}

@article{10.1145/1240233.1240241, 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 lefthand-side and righthand-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 high complexity, an implementation of the algorithm can be successfully applied to nontrivial examples.}, Address = {New York, NY, USA}, Author = {Kauers, Manuel}, File = {An Algorithm for Deciding Zero Equivalence of Nested Polynomially Recurrent Sequences - kauers06p.pdf}, ISSN = {1549-6325}, Journal = {ACM Trans. Algorithms}, Keywords = {nested polynomially recurrent sequences, combinatorial sequences, Symbolic computation, zero equivalence}, Month = {may}, Number = {2}, Pages = {18--es}, Publisher = {Association for Computing Machinery}, Title = {An Algorithm for Deciding Zero Equivalence of Nested Polynomially Recurrent Sequences}, URL = {https://doi.org/10.1145/1240233.1240241}, Volume = {3}, Year = {2007}, bdsk-url-1 = {https://doi.org/10.1145/1240233.1240241}, date-added = {2021-12-01 11:35:21 +0100}, date-modified = {2021-12-01 11:35:21 +0100}, file-2 = {An Algorithm for Deciding Zero Equivalence of Nested Polynomially Recurrent Sequence - 1240233.1240241.pdf}, issue_date = {May 2007}, numpages = {14}, doi = {10.1145/1240233.1240241} }