Abstract
The Narayana distribution is Nn,k = 1/n(k-1n)(kn) for 1 ≤ k ≤ n. This paper concerns structures counted by the Narayana distribution and bijective relationships between them. Here the statistic counting pairs of ascent steps on Catalan paths is prominently considered. Defining the nth Narayana polynomial as Nn(w) = ∑1≤k≤n Nn,kWk, for n ≥ 1, the paper gives a combinatorial proof of a three term recurrence for these polynomials. It examines the Schröder numbers and the Kirkman numbers and establishes a sequence of bijections linking dissections of polygons to large Schröder paths.
| Original language | English |
|---|---|
| Pages (from-to) | 311-326 |
| Number of pages | 16 |
| Journal | Journal of Statistical Planning and Inference |
| Volume | 101 |
| Issue number | 1-2 |
| DOIs | |
| State | Published - 15 Feb 2002 |
Keywords
- Catalan numbers
- Lattice paths
- Schröder numbers
Fingerprint
Dive into the research topics of 'The Narayana distribution'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver