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
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
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