Combinatorial and automated proofs of certain identities (Q547809)

From MaRDI portal
Revision as of 01:34, 5 March 2024 by Import240304020342 (talk | contribs) (Set profile property.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Combinatorial and automated proofs of certain identities
scientific article

    Statements

    Combinatorial and automated proofs of certain identities (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    24 June 2011
    0 references
    Summary: This paper focuses on two binomial identities. The proofs illustrate the power and elegance in enumerative/algebraic combinatorial arguments, modern machineassisted techniques of Wilf-Zeilberger and the classical tools of generatingfunctionology.
    0 references
    0 references
    recurrence equations
    0 references
    combinatorial identities
    0 references
    Zeilberger algorithm
    0 references
    WZ
    0 references
    generatingfunctionology
    0 references
    0 references
    0 references