𝔖 Bobbio Scriptorium
✦   LIBER   ✦

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


Catalan-like Numbers and Determinants
✍ Martin Aigner πŸ“‚ Article πŸ“… 1999 πŸ› Elsevier Science 🌐 English βš– 190 KB

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

Some more properties of Catalan numbers
✍ Elena Barcucci; M.Cecilia Verri πŸ“‚ Article πŸ“… 1992 πŸ› Elsevier Science 🌐 English βš– 492 KB
Catalan numbers in process synthesis
✍ Mahnoosh Shoaei; J. T. Sommerfeld πŸ“‚ Article πŸ“… 1986 πŸ› American Institute of Chemical Engineers 🌐 English βš– 194 KB
Congruences for Catalan and Motzkin numb
✍ Emeric Deutsch; Bruce E. Sagan πŸ“‚ Article πŸ“… 2006 πŸ› Elsevier Science 🌐 English βš– 238 KB

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