Name
Abstract | ||
|---|---|---|
We want to illustrate some correspondences between Catalan numbers and combinatoric objects, such as plane walks, binary trees and some particular words. By means of under-diagonal walks, we give a combinatorial interpretation of the formula C n = 1 n+1 2n n defining Catalan numbers. These numbers also enumerate both words in a particular language defined on a four character alphabet and the corresponding walks made up of four different types of steps. We illustrate a bijection between n -long words in this language and binary trees having n + 1 nodes, after which we give a simple proof of Touchard's formula. |
Year | DOI | Venue |
|---|---|---|
1992 | 10.1016/0012-365X(92)90117-X | Discrete Mathematics |
Keywords | Field | DocType |
catalan number | Discrete mathematics,Combinatorics,Bijection,Lattice path,Catalan number,Binary tree,Combinatorial analysis,Mathematics,Alphabet | Journal |
Volume | Issue | ISSN |
102 | 3 | Discrete Mathematics |
Citations | PageRank | References |
6 | 0.74 | 4 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Elena Barcucci | 1 | 306 | 59.66 |
| M. Cecilia Verri | 2 | 70 | 10.23 |