Narayana number

The Narayana numbers can be expressed in terms of binomial coefficients:

${\displaystyle \operatorname {N} (n,k)={\frac {1}{n}}{n \choose k}{n \choose k-1}}$ 

The first eight rows of the Narayana triangle read:

(sequence A001263 in the OEIS)

An example of a counting problem whose solution can be given in terms of the Narayana numbers ${\displaystyle \operatorname {N} (n,k)}$ , is the number of words containing ⁠${\displaystyle n}$ ⁠ pairs of parentheses, which are correctly matched (known as Dyck words) and which contain ⁠${\displaystyle k}$ ⁠ distinct nestings. For instance, ${\displaystyle \operatorname {N} (4,2)=6}$ , since with four pairs of parentheses, six sequences can be created which each contain two occurrences the sub-pattern ():

(()(()))  ((()()))  ((())())
()((()))  (())(())  ((()))()

From this example it should be obvious that ${\displaystyle \operatorname {N} (n,1)=1}$ , since the only way to get a single sub-pattern () is to have all the opening parentheses in the first ⁠${\displaystyle n}$ ⁠ positions, followed by all the closing parentheses. Also ${\displaystyle \operatorname {N} (n,n)=1}$ , as ⁠${\displaystyle n}$ ⁠ distinct nestings can be achieved only by the repetitive pattern ()()()…().

More generally, it can be shown that the Narayana triangle is symmetric:

${\displaystyle \operatorname {N} (n,k)=\operatorname {N} (n,n-k+1)}$ 

The sum of the rows in this triangle equal the Catalan numbers:

${\displaystyle \operatorname {N} (n,1)+\operatorname {N} (n,2)+\operatorname {N} (n,3)+\cdots +\operatorname {N} (n,n)=C_{n}}$ 

The Narayana numbers also count the number of lattice paths from ${\displaystyle (0,0)}$  to ${\displaystyle (2n,0)}$ , with steps only northeast and southeast, not straying below the x-axis, with ⁠${\displaystyle k}$ ⁠ peaks.

The following figures represent the Narayana numbers ${\displaystyle \operatorname {N} (4,k)}$ , illustrating the above mentioned symmetries.

${\displaystyle \operatorname {N} (4,k)}$	Paths
N(4, 1) = 1 path with 1 peak
N(4, 2) = 6 paths with 2 peaks:
N(4, 3) = 6 paths with 3 peaks:
N(4, 4) = 1 path with 4 peaks:

The sum of ${\displaystyle \operatorname {N} (4,k)}$  is 1 + 6 + 6 + 1 = 14, which is the 4th Catalan number, ${\displaystyle C_{4}}$ . This sum coincides with the interpretation of Catalan numbers as the number of monotonic paths along the edges of an ${\displaystyle n\times n}$  grid that do not pass above the diagonal.

 

The number of unlabeled ordered rooted trees with ${\displaystyle n}$  edges and ${\displaystyle k}$  leaves is equal to ${\displaystyle \operatorname {N} (n,k)}$ .

This is analogous to the above examples:

• Each Dyck word can be represented as a rooted tree. We start with a single node – the root node. This is initially the active node. Reading the word from left to right, when the symbol is an opening parenthesis, add a child to the active node and set this child as the active node. When the symbol is a closing parenthesis, set the parent of the active node as the active node. This way we obtain a tree, in which every non-root node corresponds to a matching pair of parentheses, and its children are the nodes corresponding to the successive Dyck words within these parentheses. Leaf nodes correspond to empty parentheses: (). In analogous fashion, we can construct a Dyck word from a rooted tree via a depth-first search. Thus, there is an isomorphism between Dyck words and rooted trees.

• In the above figures of lattice paths, each upward edge from the horizontal line at height ⁠${\displaystyle y}$ ⁠ to ⁠${\displaystyle y}$ ⁠⁠${\displaystyle +1}$ ⁠ corresponds to an edge between node ⁠${\displaystyle y}$ ⁠ and its child. A node ⁠${\displaystyle y}$ ⁠ has as many children, as there are upward edges leading from the horizontal line at height ⁠${\displaystyle y}$ ⁠. For example, in the first path for ${\displaystyle \operatorname {N} (4,3)}$ , the nodes 0 and 1 will have two children each; in the last (sixth) path, node 0 will have three children and node 1 will have one child. To construct a rooted tree from a lattice path and vice versa, we can employ an algorithm similar to the one mentioned the previous paragraph. As with Dyck words, there is an isomorphism between lattice paths and rooted trees.

 

In the study of partitions, we see that in a set containing ⁠${\displaystyle n}$ ⁠ elements, we may partition that set in ${\displaystyle B_{n}}$  different ways, where ${\displaystyle B_{n}}$  is the ⁠${\displaystyle n}$ ⁠^th Bell number. Furthermore, the number of ways to partition a set into exactly ⁠${\displaystyle k}$ ⁠ blocks we use the Stirling numbers ${\displaystyle S(n,k)}$ . Both of these concepts are a bit off-topic, but a necessary foundation for understanding the use of the Narayana numbers. In both of the above two notions crossing partitions are accounted for.

To reject the crossing partitions and count only the non-crossing partitions, we may use the Catalan numbers to count the non-crossing partitions of all ⁠${\displaystyle n}$ ⁠ elements of the set, ${\displaystyle C_{n}}$ . To count the non-crossing partitions in which the set is partitioned in exactly ⁠${\displaystyle k}$ ⁠ blocks, we use the Narayana number ${\displaystyle \operatorname {N} (n,k)}$ .

The generating function for the Narayana numbers is ^[1]

${\displaystyle \sum _{n=1}^{\infty }\sum _{k=1}^{n}\operatorname {N} (n,k)z^{n}t^{k-1}={\frac {1-z(t+1)-{\sqrt {1-2z(t+1)+z^{2}(t-1)^{2}}}}{2tz}}\;.}$ 

• Catalan number
• Delannoy number
• Motzkin number
• Narayana polynomials
• Schröder number
• Pascal's triangle
•   Learning materials related to Partition related number triangles at Wikiversity

• P. A. MacMahon (1915–1916). Combinatorial Analysis. Cambridge University Press.
• Petersen, T. Kyle (2015). "Narayana numbers" (PDF). Eulerian Numbers. Birkhäuser Advanced Texts Basler Lehrbücher. Basel: Birkhäuser. doi:10.1007/978-1-4939-3091-3. ISBN 978-1-4939-3090-6.