𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On generalised catalan numbers

✍ Scribed by A.D. Sands


Publisher
Elsevier Science
Year
1978
Tongue
English
Weight
549 KB
Volume
21
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

✦ Synopsis


The Catalan numb;r C, is defined to be 2n

( >I (n + 1). One of its occurrences is as the n number of ways of bracketing a product of n + 1 terms taken from a set with binaqr operation. In. this note the corresponding result for a set with a k-ary operation is considered. A combinatorial proof is given which does not involve generating functions or inversion formulae. The result is further ~~neralised to obtain a simpler proof of a formula of Erdelyi and Etherington [2], interpreted here as a result coscerning a set with several k,-ary operations.


πŸ“œ SIMILAR VOLUMES


Catalan numbers revisited
✍ Daniel Rubenstein πŸ“‚ Article πŸ“… 1994 πŸ› Elsevier Science 🌐 English βš– 204 KB
Catalan numbers in process synthesis
✍ Mahnoosh Shoaei; J. T. Sommerfeld πŸ“‚ Article πŸ“… 1986 πŸ› American Institute of Chemical Engineers 🌐 English βš– 194 KB
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
Ears of triangulations and Catalan numbe
✍ F. Hurtado; M. Noy πŸ“‚ Article πŸ“… 1996 πŸ› Elsevier Science 🌐 English βš– 232 KB

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