Human and constructive proof of combinatorial identities: an example from Romik

MaRDI QIDQ5485308zbMATH OpenFDO

Authors Donatella Merlini, Renzo Sprugnoli, Maria Cecilia Verri

Publication date 29 August 2006

zbMATH Keywords

Riordan arraysLagrange inversionWZ-methodmethod of coefficients

Mathematics Subject Classification ID

Combinatorics in computer science (68R05) Combinatorial identities, bijective combinatorics (05A19)

Recommendations

• Some questions concerning computer-generated proofs of a binomial double- sum identity
• A \textit{Mathematica} version of Zeilberger's algorithm for proving binomial coefficient identities
• Rational Functions Certify Combinatorial Identities
• The Art of Proving Binomial Identities
• Binomial identities -- combinatorial and algorithmic aspects

Cited in

(5)

• Generalized Riordan arrays
• Combinatorial sums and implicit Riordan arrays
• Lagrange inversion: when and how
• Applications of Lehmer's infinite series involving reciprocals of the central binomial coefficients
• Combinatorial inversions and implicit Riordan arrays

Describes a project that uses

Uses Software

• HYP

This page was built for publication: Human and constructive proof of combinatorial identities: an example from Romik

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5485308)