Catalan-like Numbers and Determinants
β Scribed by Martin Aigner
- Publisher
- Elsevier Science
- Year
- 1999
- Tongue
- English
- Weight
- 190 KB
- Volume
- 87
- Category
- Article
- ISSN
- 0097-3165
No coin nor oath required. For personal study only.
β¦ Synopsis
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 matrices are computed, and some interpretations are given as to what these numbers count.
each have determinant 1, for all n. It was shown in [1] that, for the Motzkin numbers, the determinant of the first Hankel matrix is again 1 for all n, while the determinant of the second matrix is 1, 0, &1, &1, 0, 1 for n=1, ..., 6, repeating modulo 6 thereafter.
π SIMILAR VOLUMES
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 gi
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