Skip to Main content Skip to Navigation
New interface
Conference papers

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

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.
Complete list of metadata

Cited literature [17 references]  Display  Hide  Download

https://hal.inria.fr/hal-01184212
Contributor : Coordination Episciences Iam Connect in order to contact the contributor
Submitted on : Thursday, August 13, 2015 - 1:34:31 PM
Last modification on : Friday, November 25, 2022 - 6:54:49 PM
Long-term archiving on: : Saturday, November 14, 2015 - 10:22:31 AM

File

dmAD0136.pdf
Publisher files allowed on an open archive

Identifiers

Collections

Citation

D. Merlini, R. Sprugnoli, M. C. Verri. Human and constructive proof of combinatorial identities: an example from Romik. 2005 International Conference on Analysis of Algorithms, 2005, Barcelona, Spain. pp.383-392, ⟨10.46298/dmtcs.3377⟩. ⟨hal-01184212⟩

Share

Metrics

Record views

46

Files downloads

446