Narayana polynomials

From testwiki
Revision as of 09:23, 8 January 2025 by 213.55.240.207 (talk) (Properties)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

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 k0, the Narayana number N(n,k) is defined by

N(n,k)=1n(nk)(nk1).

The number N(0,k) is defined as 1 for k=0 and as 0 for k0.

For a nonnegative integer n, the n-th Narayana polynomial Nn(z) is defined by

Nn(z)=k=0nN(n,k)zk.

The associated Narayana polynomial 𝒩n(z) is defined as the reciprocal polynomial of Nn(z):

𝒩n(z)=znNn(1z).

Examples

The first few Narayana polynomials are

N0(z)=1
N1(z)=z
N2(z)=z2+z
N3(z)=z3+3z2+z
N4(z)=z4+6z3+6z2+z
N5(z)=z5+10z4+20z3+10z2+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]

  • Nn(z)=k=0n1n+1(n+1k)(2nkn)(z1)k

Special values

  • Nn(1) is the n-th Catalan number Cn=1n+1(2nn). The first few Catalan numbers are 1,1,2,5,14,42,132,429,. Template:OEIS.[5]
  • Nn(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,. Template:OEIS.[5]
  • For integers n0, let dn denote the number of underdiagonal paths from (0,0) to (n,n) in a n×n grid having step set S={(k,0):k+}{(0,k):k+}. Then dn=𝒩(4).[6]

Recurrence relations

  • For n3, 𝒩n(z) satisfies the following nonlinear recurrence relation:[6]
𝒩n(z)=(1+z)Nn1(z)+zk=1n2𝒩k(z)𝒩nk1(z).
  • For n3, 𝒩n(z) satisfies the following second order linear recurrence relation:[6]
(n+1)𝒩n(z)=(2n1)(1+z)𝒩n1(z)(n2)(z1)2𝒩n2(z) with 𝒩1(z)=1 and 𝒩2(z)=1+z.

Generating function

The ordinary generating function the Narayana polynomials is given by

n=0Nn(z)tn=1+ttz12(1+z)t+(1z)2t22t.

Integral representation

The n-th degree Legendre polynomial Pn(x) is given by

Pn(x)=2nk=0n2(1)k(nkk)(2n2knk)xn2k

Then, for n > 0, the Narayana polynomial Nn(z) can be expressed in the following form:

  • Nn(z)=(z1)n+10zz1Pn(2x1)dx.

See also

References

Template:Reflist