English

A proof of Catalan's Convolution formula

Combinatorics 2011-09-06 v1

Abstract

We give a new proof of the kk-fold convolution of the Catalan numbers. This is done by enumerating a certain class of polygonal dissections called kk-in-nn dissections. Furthermore, we give a formula for the average number of cycles in a triangulation.

Keywords

Cite

@article{arxiv.1109.0571,
  title  = {A proof of Catalan's Convolution formula},
  author = {Alon Regev},
  journal= {arXiv preprint arXiv:1109.0571},
  year   = {2011}
}
R2 v1 2026-06-21T18:59:10.969Z