| Postal address: |
Dr Koo-Guan Choo
|
|---|---|
| Office: | Room 614 Carslaw Building |
| Email: | kooc@maths.usyd.edu.au |
| Telephone: | +61 2 9351 4221 |
| Department Fax: | +61 2 9351 4534 |
For example, the Catalan number of order 3 is 5. That is, c[n] = 5 and we have 5 balanced strings: ((())) ()(()) (())() (()()) ()()()
The Catalan numbers count many other types of finite structures, such as planar diagrams or smiling faces, hand shaking problem, mountain ranges, balanced paths stacking of dominos, railway wagon problem or 231-avoiding permutations, planted planar trees or rooted plane trees, Murasaki diagrams, standard Young tableaux, stacking of coins, increasing functions, well-parenthesized products, river systems, full binary trees, polygon dissections, sequences with non-negative partial sums, and so on. For want of a better name I shall call them Catalan structures. Here are some examples.