An algorithm for deciding zero equivalence of nested polynomially recurrent sequences (Q2944555)

From MaRDI portal
Revision as of 18:59, 19 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)





scientific article
Language Label Description Also known as
English
An algorithm for deciding zero equivalence of nested polynomially recurrent sequences
scientific article

    Statements

    An algorithm for deciding zero equivalence of nested polynomially recurrent sequences (English)
    0 references
    0 references
    2 September 2015
    0 references
    symbolic computation
    0 references
    combinatorial sequences
    0 references
    nested polynomially recurrent sequences
    0 references
    zero equivalence
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references