Skip to main contentSkip to search
Episciences
Open Access Journals
Sign in(new window)
Discrete Mathematics & Theoretical Computer Science logo
Discrete Mathematics & Theoretical Computer Science
Discrete Mathematics & Theoretical Computer Science logo
Discrete Mathematics & Theoretical Computer Science
Sign in(new window)
Articles & Issues
All articlesAll accepted articlesAll volumesLast volumeSectionsSpecial issuesAuthors
About
The journalIndexing
Boards
Publish
For authorsEthical charter
Submit
Discrete Mathematics & Theoretical Computer Science logo
Contact
|
Credits
eISSN 1365-8050
|
RSS
|
Atom
Episciences
Documentation
|
Acknowledgements
|
Publishing policy
Accessibility: non-compliant
|
Legal mentions
|
Privacy statement
|
Terms of use
  1. Home > Articles & Issues >
  2. Articles >
  3. Human and constructi ...
Conference paper

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

D. Merlini (1), R. Sprugnoli (1), M. C. Verri (1)
(1) Dipartimento di Sistemi e Informatica
Download article
Open on HAL
Imported on
May 10, 2017
Published on
December 31, 2004
Last modified on
March 31, 2025
Volume 0
DMTCS Proceedings vol. AD, International Conference on Analysis of Algorithms
Proceedings
DOI
10.46298/dmtcs.3377
License
https://about.hal.science/hal-authorisation-v1
Indicators
564
Views
415
Downloads

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

D. Merlini (1), R. Sprugnoli (1), M. C. Verri (1)
(1) 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
  • [INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS]
  • [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM]
  • [MATH.MATH-CO]Mathematics [math]/Combinatorics [math.CO]
  • [INFO.INFO-CG]Computer Science [cs]/Computational Geometry [cs.CG]
  • Combinatorial identities
  • method of coefficients
  • Lagrange inversion
  • Riordan Arrays
  • WZ-method
Cited by

Source: OpenCitations

  • Combinatorial inversions and implicit Riordan arrays

    Electronic Notes in Discrete Mathematics

    Authors : Donatella Merlini ORCID, Renzo Sprugnoli, Maria Cecilia Verri ORCID

    Journal reference : Volume 26, 2006, pp. 103-110

    DOI : 10.1016/j.endm.2006.08.019
  • Generalized Riordan arrays

    Discrete Mathematics

    Authors : Weiping Wang ORCID, Tianming Wang ORCID

    Journal reference : Volume 308, 2008, pp. 6466-6500

    DOI : 10.1016/j.disc.2007.12.037
  • Combinatorial Sums and Inversions

    Springer monographs in mathematics

    Authors : Louis Shapiro, Renzo Sprugnoli, Paul Barry ORCID, Gi-Sang Cheon ORCID, Tian-Xiao He ORCID, Donatella Merlini ORCID, Weiping Wang ORCID

    Journal reference : Volume , 2022, pp. 101-122

    DOI : 10.1007/978-3-030-94151-2_5
Preview
Loading PDF preview...