A class of numbers, called Catalan-like numbers, are introduced which unify many well-known counting coefficients, such as the Catalan numbers, the Motzkin numbers, the middle binomial coefficients, the hexagonal numbers, and many more. Generating functions, recursions and determinants of Hankel mat
Ears of triangulations and Catalan numbers
β Scribed by F. Hurtado; M. Noy
- Publisher
- Elsevier Science
- Year
- 1996
- Tongue
- English
- Weight
- 232 KB
- Volume
- 149
- Category
- Article
- ISSN
- 0012-365X
No coin nor oath required. For personal study only.
β¦ Synopsis
It is known that a convex polygon of n sides admits C.-2 triangulations, where C, is a Catalan number. We classify these triangulations (considered as outerplanar graphs) according to their dual trees, and prove the following formula for the number of triangulations of a convex n-gon whose dual tree has exactly k leaves:
The proof is bijective and provides a recursive formula for the Catalan numbers similar to, but different from, a classical identity of Touchard. An averaging argument allows one to deduce Touchard's formula from ours.
π SIMILAR VOLUMES
We prove various congruences for Catalan and Motzkin numbers as well as related sequences. The common thread is that all these sequences can be expressed in terms of binomial coefficients. Our techniques are combinatorial and algebraic: group actions, induction, and Lucas' congruence for binomial co