Skip to main navigation Skip to search Skip to main content

The Narayana distribution

  • Robert A. Sulanke

Research output: Contribution to journalArticlepeer-review

42 Scopus citations

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 languageEnglish
Pages (from-to)311-326
Number of pages16
JournalJournal of Statistical Planning and Inference
Volume101
Issue number1-2
DOIs
StatePublished - 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