Human and constructive proof of combinatorial identities: an example from RomikReport as inadecuate




Human and constructive proof of combinatorial identities: an example from Romik - Download this document for free, or read online. Document in PDF available to download.

1 DSI - Dipartimento di Sistemi e Informatica

Abstract : It has become customary to prove binomial identities by means of the method for automated proofs as developed by Petkovšek, Wilf and Zeilberger. In this paper, we wish to emphasize the role of -human- and constructive proofs in contrast with the somewhat lazy attitude of relaying on -automated- proofs. As a meaningful example, we consider the four formulas by Romik, related to Motzkin and central trinomial numbers. We show that a proof of these identities can be obtained by using the method of coefficients, a human method only requiring hand computations.

Keywords : WZ-method Combinatorial identities method of coefficients Lagrange inversion Riordan Arrays





Author: D. Merlini - R. Sprugnoli - M. C. Verri -

Source: https://hal.archives-ouvertes.fr/



DOWNLOAD PDF




Related documents