𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Generating trees and the Catalan and Schröder numbers

✍ Scribed by Julian West

Publisher
Elsevier Science
Year
1995
Tongue
English
Weight
1015 KB
Volume
146
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Catalan-like Numbers and Determinants
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

Ears of triangulations and Catalan numbe
Ears of triangulations and Catalan numbers
✍ 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

Catalan numbers and branched coverings b
Catalan numbers and branched coverings by the Riemann sphere
✍ Lisa R Goldberg 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 601 KB

We prove that the number of PGL(2. C) equivalence classes of degree d rational maps with a fixed branch set is generically equal to the "Catalan number" p(d) = (l/d)( 2j:f). Several (previously known) applications of Catalan numbers to combinatorics and algebraic geometry are discussed throughout t

Congruences for Catalan and Motzkin numb
Congruences for Catalan and Motzkin numbers and related sequences
✍ 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