Narayana polynomials

Narayana polynomials are a class of polynomials whose coefficients are the Narayana numbers. The Narayana numbers and Narayana polynomials are named after the Canadian mathematician T. V. Narayana (1930–1987). They appear in several combinatorial problems.^[1]^[2]^[3]

Definitions

For a positive integer $n$ and for an integer $k$ such that $1\leq k\leq n$ , the Narayana number $N(n,k)$ is defined by

N(n,k)={\frac {1}{n}}{n \choose k}{n \choose k-1}.

The number $N(0,0)$ is defined as $1$ . For a positive integer $n$ , the $n$ -th Narayana polynomial $N_{n}(z)$ is defined by

N_{n}(z)=\sum _{k=1}^{n}N(n,k)z^{n}

.

The polynomial $N_{0}(z)$ is defined as the constant polynomial $1$ . The associated Narayana polynomial ${\mathcal {N}}_{n}(z)$ is defined by

{\mathcal {N}}_{n}(z)=z^{n}N_{n}\left({\tfrac {1}{z}}\right)

.

The first few Narayana polynomials are

N_{0}(z)=1

N_{1}(z)=z

N_{2}(z)=z^{2}+z

N_{3}(z)=z^{3}+3z^{2}+z

N_{4}(z)=z^{4}+6z^{3}+6z^{2}+z

N_{5}(z)=z^{5}+10z^{4}+20z^{3}+10z^{2}+z

Properties

A few of the properties of the Narayana polynomials and the associated Narayana polynomials are collected below. Further information on the properties of these polynomials are available in the references cited.

Alternative form of the Narayana polynomials

The Narayana polynomials can be expressed in the following alternative form:^[4]

$N_{n}(z)=\sum _{0}^{n}{\frac {1}{n+1}}{n+1 \choose k}{2n-k \choose n}(z-1)^{k}$

Special values

$N_{n}(1)$ is the $n$ -th Catalan number $C_{n}={\frac {1}{n+1}}{2n \choose n}$ . The first few Catalan numbers are $1,1,2,5,14,42,132,429,\ldots$ . (sequence A000108 in the OEIS).^[5]
$N_{n}(2)$ is the $n$ -th large Schröder number. This is the number of plane trees having $n$ edges with leaves colored by one of two colors. The first few Schröder numbers are $1,2,6,22,90,394,1806,8558,\ldots$ . (sequence A006318 in the OEIS).^[5]
For integers $n\geq 0$ , let $d_{n}$ denote the number of underdiagonal paths from $(0,0)$ to $(n,n)$ in a $n\times n$ grid having step set $S=\{(k,0):k\in \mathbb {N} ^{+}\}\cup \{(0,k):k\in \mathbb {N} ^{+}\}$ . Then $d_{n}={\mathcal {N}}(4)$ .^[6]

Recurrence relations

For $n\geq 3$ , ${\mathcal {N}}_{n}(z)$ satisfies the following nonlinear recurrence relation:^[6]

{\mathcal {N}}_{n}(z)=(1+z)N_{n-1}(z)+z\sum _{k=1}^{n-2}{\mathcal {N}}_{k}(z){\mathcal {N}}_{n-k-1}(z)

.

For $n\geq 3$ , ${\mathcal {N}}_{n}(z)$ satisfies the following second order linear recurrence relation:^[6]

(n+1){\mathcal {N}}_{n}(z)=(2n-1)(1+z){\mathcal {N}}_{n-1}(z)-(n-2)(z-1)^{2}{\mathcal {N}}_{n-2}(z)

with

{\mathcal {N}}_{1}(z)=1

and

{\mathcal {N}}_{2}(z)=1+z

.

Integral representation

The $n$ -th degree Legendre polynomial $P_{n}(x)$ is given by

P_{n}(x)=2^{-n}\sum _{k=0}^{\left\lfloor {\frac {n}{2}}\right\rfloor }(-1)^{k}{n-k \choose k}{2n-2k \choose n-k}x^{n-2k}

Then, the Narayana polynomial $N_{n}(z)$ can be expressed in the following form:

$N_{n}(z)=(z-1)^{n+1}\int _{0}^{\frac {z-1}{z}}P_{n}(2x-1)\,dx$ .

References

↑ D. G. Rogers (1981). "Rhyming schemes: Crossings and coverings" (PDF). Discrete Mathematics. 33: 67–77. doi:10.1016/0012-365X(81)90259-4. Retrieved 2 December 2023.
↑ R.P. Stanley (1999). Enumerative Combinatorics, Vol. 2. Cambridge University Press.
↑ Rodica Simian and Daniel Ullman (1991). "On the structure of the lattice of noncrossing partitions" (PDF). Discrete Mathematics. 98 (3): 193–206. doi:10.1016/0012-365X(91)90376-D. Retrieved 2 December 2023.
↑ Ricky X. F. Chen and Christian M. Reidys (2014). "Narayana polynomials and some generalizations". arXiv:1411.2530 [math.CO].
1 2 Toufik Mansour, Yidong Sun (2008). "Identities involving Narayana polynomials and Catalan numbers". arXiv:0805.1274 [math.CO].
1 2 3 Curtis Coker (2003). "Enumerating a class oflattice paths" (PDF). Discrete Mathematics. 271 (1–3): 13–28. doi:10.1016/S0012-365X(03)00037-2. Retrieved 1 December 2023.

This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.

[1] D. G. Rogers (1981). "Rhyming schemes: Crossings and coverings" (PDF). Discrete Mathematics. 33: 67–77. doi:10.1016/0012-365X(81)90259-4. Retrieved 2 December 2023.

[2] R.P. Stanley (1999). Enumerative Combinatorics, Vol. 2. Cambridge University Press.

[3] Rodica Simian and Daniel Ullman (1991). "On the structure of the lattice of noncrossing partitions" (PDF). Discrete Mathematics. 98 (3): 193–206. doi:10.1016/0012-365X(91)90376-D. Retrieved 2 December 2023.

[Chen-4] Ricky X. F. Chen and Christian M. Reidys (2014). "Narayana polynomials and some generalizations". arXiv:1411.2530 [math.CO].

[Sun-5] 1 2 Toufik Mansour, Yidong Sun (2008). "Identities involving Narayana polynomials and Catalan numbers". arXiv:0805.1274 [math.CO].

[Coker-6] 1 2 3 Curtis Coker (2003). "Enumerating a class oflattice paths" (PDF). Discrete Mathematics. 271 (1–3): 13–28. doi:10.1016/S0012-365X(03)00037-2. Retrieved 1 December 2023.

[1]

[2]

[3]

[4]

[5]

[6]