Two Quick Proofs of a Catalan Lemma Needed by Lisa Sauermann and Yuval Wigderson

2020/11/15 by Shalosh B. Ekhad, Doron Zeilberger, Ekhad, Shalosh B. +1
Computer Science · Engineering · Mathematics · #Advanced Combinatorial Mathematics #Combinatorics (math.CO) #FOS: Mathematics #Graph Labeling and Dimension Problems #graph theory and CDMA systems

paper · pdf · doi:10.48550/arxiv.2011.07625

openalex publication_date 2020/11/15 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

We present two proofs each, all shorter than the original proofs, of two elegant combinatorial identities that came up in the beautiful article arXiv:2010.00077 .

Related

• Revitalized automatic proofs: demonstrations
• Two New Identities Involving the Catalan Numbers: A classical approach
• A Very Short (Bijective!) Proof of Touchard's Catalan Identity
• Are the Catalan Numbers a Linear Recurrence Sequence?
• Bijective Proofs of Identities from Colored Binary Trees