Skip to main content

Generalized Meixner-Pollaczek polynomials

Abstract

We consider the generalized Meixner-Pollaczek (GMP) polynomials P n λ (x;θ,ψ) of a variable xR and parameters λ>0, θ(0,π), ψR, defined via the generating function

G λ (x;θ,ψ;z)= 1 ( 1 z e i θ ) λ i x ( 1 z e i ψ ) λ + i x = n = 0 P n λ (x;θ,ψ) z n ,|z|<1.

We find the three-term recurrence relation, the explicité formula, the hypergeometric representation, the difference equation and the orthogonality relation for GMP polynomials P n λ (x;θ,ψ). Moreover, we study the special case of P n λ (x;θ,ψ) corresponding to the choice ψ=π+θ and ψ=πθ, which leads to some interesting families of polynomials. The limiting case (λ0) of the sequences of polynomials P n λ (x;θ,π+θ) is obtained, and the orthogonality relation in the strip S={zC:|(z)|<1} is shown.

MSC:33C45, 30C10, 30C45, 39A60.

1 Introduction

The classical Koebe function is a function holomorphic in D={z:|z|<1} and given by the formula

k 2 (z)= z ( 1 z ) 2 = 1 4 { ( 1 + z 1 z ) 2 1 } =z+2 z 2 +3 z 3 +,zD.

The importance of k 2 follows from the extremality for the famous Bieberbach conjecture. The Koebe function is univalent and starlike in D and maps the unit disk D onto the complex plane minus a slit (, 1 4 ].

Several generalizations of k 2 appeared in the literature. Robertson [1] proved that k 2 ( 1 α ) (z)= z ( 1 z ) 2 ( 1 α ) (0α<1) is the extremal function for the class of functions starlike of order α. The function

k α (z)= 1 2 α { ( 1 + z 1 z ) α 1 } ,αR{0},zD,

was extensively studied by Pommerenke [2], who investigated a universal invariant family U α .

The definition of k α was extended for a nonzero complex number α by Yamashita [3]. The classical result of Hille [4] ascertains that k α is univalent in D if and only if α0 is in the union A of the closed disks {|z+1|1} and {|z1|1}. Making use of geometric properties, Yamashita [3] described how k α tends to be univalent in the whole D as α tends to each boundary point of A from outside.

The properties of log k c , where

k c (z)= 1 2 c [ ( 1 + z 1 z ) c 1 ] ,cC{0}, k 0 (z)= 1 2 log 1 + z 1 z ,zD,
(1.1)

were studied in [5] by Campbell and Pfaltzgraff. Pommerenke [2] examined the special case of (1.1), i.e.,

k i γ (z)= 1 2 i γ [ ( 1 + z 1 z ) i γ 1 ] ,γ>0,zD,

for which

k i γ (z)= 1 ( 1 + z ) 1 i γ ( 1 z ) 1 i γ .

An evident and important extension of (1.1) was given by the following formulas (θR, ψR):

k c (θ,ψ;z)= 1 ( e i ψ e i θ ) c [ ( 1 z e i θ 1 z e i ψ ) c 1 ] ,cC{0}, e i ψ e i θ ,zD,

and for the case when c=0,

k 0 (θ,ψ;z)= 1 ( e i ψ e i ϕ ) log 1 z e i θ 1 z e i ψ , e i ψ e i θ ,zD.

We have

k c (θ,ψ;z)= 1 ( 1 z e i θ ) 1 c ( 1 z e i ψ ) 1 + c ,cC.

Comparing k i γ (θ,ψ;z)= 1 ( 1 z e i θ ) 1 i γ ( 1 z e ψ ) 1 + i γ with the generating function for Meixner-Pollaczek polynomials P n λ (x;θ) [6],

G λ (x;θ,θ;z)= 1 ( 1 z e i θ ) λ i x ( 1 z e i θ ) λ + i x = n = 0 P n λ (x;θ) z n ,zD,

where λ>0, θ(0,π), xR, we were motivated to introduce the generalized Meixner-Pollaczek polynomials (GMP) [7] P n λ (x;θ,ψ) of a variable xR and parameters λ>0, θ(0,π), ψR via the generating function

G λ (x;θ,ψ;z)= 1 ( 1 z e i θ ) λ i x ( 1 z e i ψ ) λ + i x = n = 0 P n λ (x;θ,ψ) z n ,zD.
(1.2)

Obviously, we have P n λ (x;θ,θ)= P n λ (x;θ).

2 Orthogonal polynomials

Let L denote the moment functional that is a linear map C[x]C. A sequence of polynomials { P n ( x ) } n = 0 is an orthogonal polynomials sequence (OPS) with respect to L if P n (x) has degree n, L[ P m (x) P n (x)]=0 for mn and L[ P n 2 (x)]0 for all n.

In this paper we consider orthogonal polynomial systems defined recursively. Every monic OPS P n ( x ) n = 0 may be described by a recurrence formula of the form

P n (x)=(x c n ) P n 1 (x) λ n P n 2 (x),n=1,2,3,,
(2.1)

where P 1 (x)=0, P 0 (x)=1, the numbers c n and λ n are constants, λ n 0 for n>1 and λ 1 is arbitrary (see [[8], Ch. I, Theorem 4.1]). The sequences of orthogonal polynomials are symmetric if P n (x)= ( 1 ) n P n (x) for all n (see [[8], Ch. I, Theorem 4.3]) or that c n in (2.1) are all zero.

Polynomials with exponential generating functions are among the most often studied polynomials. One of them is the Meixner-Pollaczek polynomials. The Meixner-Pollaczek polynomials were first invented by Meixner [9]. The same polynomials were also considered independently by Pollaczek [10]. These polynomials are classified in the Askey-scheme of orthogonal polynomials [6, 11].

Some of the main properties of these polynomials are presented in Erdélyi et al. [12], Chihara [8], Askey and Wilson [11] and in the report by Koekoek and Swarttouw [6]. Detailed analyses with applications of these polynomials are also made by several authors. Among others, the works of Rahman [13], Atakishiyev and Suslov [14], Bender et al. [15], Koornwinder [16] and the extensive work of Li and Wong [17] may be included.

This paper is mainly concerned about the generalized Meixner-Pollaczek (GMP) polynomials. We also study the special cases of P n λ (x;θ,ψ), corresponding to the choice ψ=π+θ and ψ=πθ, which lead to some interesting families of polynomials.

For complex numbers a, b and c (c0,1,2,), the Gaussian hypergeometric function F 1 2 (a,b,c;z) is defined by

F 1 2 (a,b,c;z)= k = 0 + ( a ) k ( b ) k ( c ) k z k k ! ,zD,
(2.2)

where ( a ) n is the Pochhammer symbol described by

( a ) n =a(a+1)(a+2)(a+n1),nN, ( a ) 0 =1.

Notice that F 1 2 (a,b,c;z) is symmetric in a and b, and the series terminates if either a or b is zero or a negative integer. In general, the series F 1 2 (z) is absolutely convergent in D. If (cab)>0, it is also convergent on D, and it is known that

F 1 2 (a,b;c;1)= Γ ( c ) Γ ( c a b ) Γ ( c a ) Γ ( c b ) ,Re(cab)>0;c0,1,2,.
(2.3)

3 Generalized Meixner-Pollaczek polynomials

In this section we find the three-term recurrence relation, the explicité formula, the hypergeometric representation, the difference equation and the orthogonality relation for (GMP) polynomials P n λ (x;θ,ψ).

Theorem 1 Let us set P 1 λ =0. The polynomials P n λ = P n λ (x;θ,ψ) have the following properties:

  1. (a)

    P n λ satisfy the three-term recurrence relation

    P 0 λ = 1 , n P n λ = [ ( λ i x ) e i θ + ( λ + i x ) e i ψ + ( n 1 ) ( e i θ + e i ψ ) ] P n 1 λ n P n λ = ( 2 λ + n 2 ) e i ( θ + ψ ) P n 2 λ , n 1 .
  2. (b)

    P n λ are given by the formula

    P n λ ( x ; θ , ψ ) = e i n θ j = 0 n ( λ + i x ) j ( λ i x ) n j j ! ( n j ) ! e i j ( ψ θ ) , n N { 0 } .
    (3.1)
  3. (c)

    P n λ have the hypergeometric representation

    n ! P n λ ( x ; θ , ψ ) = ( 2 λ ) n e i n θ 2 F 1 ( n , λ + i x , 2 λ ; 1 e i ( ψ θ ) ) .
    (3.2)
  4. (d)

    Let y(x)= P n λ (x;θ,ψ). The function y(x) satisfies the following difference equation:

    e i θ ( λ i x ) y ( x + i ) + [ i x ( e i θ + e i ψ ) ( n + λ ) ( e i θ e i ψ ) ] y ( x ) e i ψ ( λ + i x ) y ( x i ) = 0 .
    (3.3)

Proof

  1. (a)

    We differentiate the formula (1.2) with respect to z, and after multiplication by (1z e i θ )(1z e i ψ ), we compare the leading coefficients of z n 1 .

  2. (b)

    The Cauchy product of the power series

    ( 1 z e i θ ) ( λ i x ) = n = 0 ( λ i x ) n e i n θ n ! z n

and

( 1 z e i ψ ) ( λ + i x ) = n = 0 ( λ + i x ) n e i n ψ n ! z n

gives (3.1).

  1. (c)

    Applying the formula from [[12], vol.1, p.82],

    ( 1 s ) a c ( 1 s + s z ) a = n = 0 ( c ) n n ! 2 F 1 (n,a;c;z) s n ,|s|<1, | s ( 1 z ) | <1,

with s=z e i θ , a=λ+ix, c=2λ, z=1 e i ( ψ θ ) , one obtains

( 1 z e i θ ) ( λ i x ) ( 1 z e i ψ ) ( λ + i x ) = n = 0 e i n θ ( 2 λ ) n n ! 2 F 1 ( n , λ + i x , 2 λ ; 1 e i ( ψ θ ) ) z n .

Comparing the coefficients of the power series, we get (3.2).

  1. (d)

    Inserting (x+i) and (xi) instead of x into the generating function (1.2), we find that

    y ( x + i ) = k = 0 n 1 P k λ ( x ; θ , ψ ) [ e i ( n k ) θ e i [ ( n k 1 ) θ + ψ ] ] + P n λ , y ( x i ) = k = 0 n 1 P k λ ( x ; θ , ψ ) [ e i ( n k ) ψ e i [ ( n k 1 ) ψ + θ ] ] + P n λ ,

which implies that

e i θ ( λ i x ) y ( x + i ) e i ψ ( λ + i x ) y ( x i ) = ( e i θ e i ψ ) k = 0 n 1 P k λ ( x ; θ , ψ ) [ ( λ i x ) e i ( n k ) θ + ( λ + i x ) e i ( n k ) ψ ] + [ e i θ ( λ i x ) e i ψ ( λ + i x ) ] P n λ .
(3.4)

Differentiation of the generating function (1.2) with respect to z and equating the leading coefficient of z n 1 yields

n P n λ (x;θ,ψ)= k = 0 n 1 P k λ (x;θ,ψ) [ ( λ i x ) e i ( n k ) θ + ( λ + i x ) e i ( n k ) ψ ] ,

which together with (3.4) gives (3.3).

 □

Theorem 2 The polynomials P n λ (x;θ,ψ) are orthogonal on (,+) with the weight w θ , ψ λ (x)= 1 2 π e ( θ ψ + π ) x | Γ ( λ + i x ) | 2 , for λ>0, θ( π 2 , π 2 ), and

+ w θ , ψ λ (x) P n λ (x;θ,ψ) P m λ ( x ; θ , ψ ) ¯ dx= δ n m Γ ( n + 2 λ ) n ! ( 2 cos ( θ ψ + π ) / 2 ) 2 λ .

Proof Let F(s) and G(s) be the Mellin transforms of f(x) and g(x), i.e.,

{Mf}(s)=F(s)= 0 f(x) x s 1 dx,{Mg}(s)=G(s)= 0 g(x) x s 1 dx.

Then the following formula (Parseval’s identity) holds [18]:

1 2 π i c i c + i F(s)G(1s)ds= 0 f(x)g(x)dx
(3.5)

and [12]

0 + u α 1 e p u e i q u du=Γ(α) ( p 2 + q 2 ) α 2 e i α arctan ( p / q ) .
(3.6)

For f(x)=2 x 2 ( λ + j ) e x 2 and g(x)=2 x 2 ( λ + k ) 1 e x 2 , we have F(s)=Γ(λ+j+ s 2 ), G(s)=Γ(λ+k+ s 1 2 ). By the well-known property

{Mf} ( e i θ x ) = e i θ s F(s),

we have

{Mf} ( e i ( θ ψ + π ) / 2 x ) = e i s ( θ ψ + π ) / 2 F(s).

Consecutively, applying first the formula ( a ) j = Γ ( a + j ) Γ ( a ) (j=1,2,) and (3.5), and then setting α=2λ+k+j, p=cos(θψ+π)+1, q=sin(θψ+π) in (3.6), we have

1 2 π + e ( θ ψ + π ) x ( λ + i x ) j ( λ i x ) k | Γ ( λ + i x ) | 2 d x = 1 2 π + e ( θ ψ + π ) x Γ ( λ + j + i x ) Γ ( λ + k i x ) d x = 1 4 π i + e i x ( θ ψ + π ) / 2 Γ ( λ + j + x 2 ) Γ ( λ + k x 2 ) d x = 2 e i ( θ ψ + π ) ( λ + j ) 0 + x 2 ( 2 λ + k + j ) 1 exp ( ( e ( θ ψ + π ) i + 1 ) x 2 ) d x = e i ( θ ψ + π ) ( λ + j ) 0 + x 2 λ + k + j 1 exp ( ( e ( θ ψ + π ) i + 1 ) x ) d x = e i ( j k ) ( θ ψ + π ) / 2 Γ ( 2 λ + k + j ) ( 2 cos ( ( θ ψ + π ) / 2 ) ) 2 λ + k + j .
(3.7)

Set

P n λ (x;θ,ψ)= k = 0 n A k ( λ + i x ) k ,

where

A k = e i k θ ( 2 λ ) k ( k ) k ( 1 e i ( ψ θ ) ) k k ! ( 2 λ ) k k ! .

Then

J : = 1 2 π + P n λ ( x ; θ , ψ ) ( λ i x ) k e ( θ ψ + π ) x | Γ ( λ + i x ) | 2 d x = 1 2 π + j = 0 n A j ( λ + i x ) j ( λ i x ) k e ( θ ψ + π ) x | Γ ( λ + i x ) | 2 d x = 1 2 π j = 0 n A j + ( λ + i x ) j ( λ i x ) k e ( θ ψ + π ) x | Γ ( λ + i x ) | 2 d x = ( 2 λ ) n e i n θ n ! j = 0 n ( n ) j ( 1 e i ( ψ θ ) ) j ( 2 λ ) j ! 1 2 π + ( λ + i x ) j ( λ i x ) k e ( θ ψ + π ) x | Γ ( λ + i x ) | 2 d x .

Using (3.7) and (2.2), we obtain

J = ( 2 λ ) n e i n θ n ! j = 0 n ( n ) j ( 1 e i ( ψ θ ) ) j ( 2 λ ) j ! e i ( j k ) ( θ ψ + π ) / 2 Γ ( 2 λ + k + j ) ( 2 cos ( ( θ ψ + π ) / 2 ) ) 2 λ + k + j = ( 2 λ ) n e i n θ n ! Γ ( 2 λ + k ) e i k ( θ ψ + π ) / 2 ( 2 cos ( ( θ ψ + π ) / 2 ) ) 2 λ + k × j = 0 n ( n ) j ( 2 λ + k ) j ( 2 λ ) j ! ( 1 e i ( ψ θ ) ) j ( e i ( θ ψ + π ) / 2 + e i ( θ ψ + π ) / 2 ) j ( e i ( θ ψ + π ) / 2 ) j = ( 2 λ ) n e i n θ n ! Γ ( 2 λ + k ) e i k ( θ ψ + π ) / 2 ( 2 cos ( ( θ ψ + π ) / 2 ) ) 2 λ + k 2 F 1 ( n , 2 λ + k ; 2 λ ; 1 ) .

By the formula (2.3), the above reduces to

1 2 π + P n λ ( x ; θ , ψ ) ( λ i x ) k e ( θ ψ + π ) x | Γ ( λ + i x ) | 2 d x = e i ( n θ k ( θ ψ + π ) / 2 ) Γ ( 2 λ + k ) n ! ( 2 cos ( ( θ ψ + π ) / 2 ) ) 2 λ + k ( k ) n .
(3.8)

Since ( k ) n =0 for k<n, then (3.8) is nonzero only for the case k=n. Then

1 2 π + P n λ ( x ; θ , ψ ) ( λ i x ) k e ( θ ψ + π ) x | Γ ( λ + i x ) | 2 d x = e i ( n θ k ( θ ψ + π ) / 2 ) Γ ( 2 λ + k ) n ! ( 2 cos ( ( θ ψ + π ) / 2 ) ) 2 λ + k ( n ) n .

From this and relation (3.7), it follows that

+ P n λ ( x ; θ , ψ ) P m λ ( x ; θ , ψ ) ¯ w θ λ ( x ) d x = δ n m e i n θ ( 2 λ ) n ( n ) n ( 1 e i ( ψ θ ) ) n n ! ( 2 λ ) n n ! e i ( n θ n 2 ( θ ψ + π ) ) Γ ( 2 λ + n ) n ! ( 2 cos θ ψ + π 2 ) 2 λ + n ( n ) n = δ n m Γ ( n + 2 λ ) n ! ( 2 cos θ ψ + π 2 ) 2 λ .

 □

Remark 1 For xR, ψR, λ>0 and nN, the following explicité formula holds:

P n λ (x;θ,ψ)= e i θ n k = 0 [ n 2 ] ( λ i x ) n 2 k ( λ + i x ) k ( n 2 k ) ! k ! ( e i ψ e 2 i θ ) k .
(3.9)

Proof Consider the following:

n = 0 P n λ ( x ; θ , ψ ) z n = ( 1 z e i θ ) λ + i x ( 1 z e i ψ ) λ i x = n = 0 k = 0 n z n ( λ i x ) n k ( n k ) ! e i θ ( n k ) ( λ + i x ) k k ! e i ψ k = n = 0 z n k = 0 [ n 2 ] ( λ i x ) n 2 k ( n 2 k ) ! e i θ ( n 2 k ) ( λ + i x ) k k ! e i ψ k .

Comparing both sides of the above, we get the equality (3.9). □

Proposition 1 The family of generalized Meixner-Pollaczek polynomials P n λ (x;θ,ψ) can be extended to the case λ=0 as follows:

P 0 0 ( x ; θ , ψ ) = 1 , n P n 0 ( x ; θ , ψ ) = ( e i θ e i ψ i ) x P n 1 1 ( x ; θ , ψ ) , n 1 .
(3.10)

Proof Since

lim λ 0 P n λ ( x ; θ , ψ ) = lim λ 0 ( 2 λ ) n e i n θ 2 F 1 ( n , λ + i x , 2 λ ; 1 e i ψ e i θ ) = 1 n ! e i n θ ( 1 e i ( ψ θ ) ) Γ ( n ) ( n ) ( i x ) 2 F 1 ( n + 1 , i x + 1 , 2 ; 1 e i ( ψ θ ) ) = 1 n ! e i n θ ( 1 e i ( ψ θ ) ) Γ ( n ) ( n ) ( i x ) P n 1 1 ( x ; θ , ψ ) n 1 ( 2 ) n 1 e i ( n 1 ) θ = 1 n ( e i θ e i ψ i ) x P n 1 1 ( x ; θ , ψ ) ,

then (3.10) is a natural consequence. □

4 The case ψ=π+θ

Let us consider now the case ψ=π+θ. We observe that such a case leads to the very interesting family of symmetric polynomials. Some special cases of P n λ (x;θ,π+θ;z) are known in the literature for θ= π 2 . These are the symmetric Meixner-Pollaczek polynomials, denoted by P n λ (x/2;θ), λ>0. For instance, Bender et al. [15] and Koornwinder [16] have shown that there is a connection between the symmetric Meixner-Pollaczek polynomials P n 1 2 ( x 2 , π 2 ) and the Heisenberg algebra. Another example is [19], where the symmetric Meixner-Pollaczek polynomials are considered.

We define the symmetric generalized Meixner-Pollaczek (SGMP) polynomials S n λ (x;θ) by the following generating function:

G λ ( x ; θ , π + θ ; z ) = 1 ( 1 z e i θ ) λ i x ( 1 + z e i θ ) λ + i x = e 2 x arctan ( z e i ( θ + π / 2 ) ) ( 1 z 2 e 2 i θ ) λ = n = 0 S n λ ( x ; θ ) z n , z D .

This sequence of polynomials has a hypergeometric representation

S n λ (x;θ)= e i n θ ( 2 λ ) n n ! 2 F 1 (n,λ+ix,2λ;2),
(4.1)

and an integral representation

S n λ (x;θ)= 1 2 π i e 2 x arctan ( z e i ( θ + π / 2 ) ) ( 1 z 2 e 2 i θ ) λ d z z n + 1 .

In this section we mainly consider the strip S={zC:|z|<1}. There are several reasons why the strip is of special interest. Let w(x)= 1 2 cosh ( π x / 2 ) . The function w(x) is a density function of a probability measure on S. We describe an orthogonal basis for the basis in the Hilbert space H 2 (S,P), where P is the Poisson measure for 0. The inner product for any two functions f,g H 2 (S,P) is given by the formula

( f , g ) H 2 ( S , P ) := R f ( x + i ) g ( x + i ) ¯ + f ( x i ) g ( x i ) ¯ 4 cosh π 2 x dx.

Now, we consider the system { σ n (x)} given by the recursion relation

σ 1 =0, σ 0 =1,(n+1) σ n + 1 (z)+i e i θ z σ n (z) e 2 i θ (n1) σ n 1 (z)=0.
(4.2)

Theorem 3 Let the system { σ n ( x ) } n = 0 be given by (4.2), then:

  1. (a)

    the system satisfies

    G σ (z,s)= k = 0 σ k (z) s k = e z arctan s e i ( θ + π 2 ) ,
  2. (b)

    the sequence of polynomials { σ n } 0 is an orthogonal basis in the Hilbert space H 2 (S,P),

  3. (c)

    the norm of polynomials σ n is 2 if k1 and 1 if k=0.

Proof

  1. (a)

    By (4.2) we have

    (k+1) σ k + 1 (z)+i e i θ z σ k (z) e 2 i θ (k1) σ k 1 (z)=0.

Multiplying the above relations by s k , summing over k and simplifying, we obtain

0 = k = 0 [ ( k + 1 ) σ k + 1 ( z ) + i e i θ z σ k ( z ) e 2 i θ ( k 1 ) σ k 1 ( z ) ] s k = k = 0 ( k + 1 ) σ k + 1 ( z ) s k + i e i θ z k = 0 σ k ( z ) s k e 2 i θ k = 0 ( k 1 ) σ k 1 ( z ) s k = G σ ( z , s ) s + i e i θ z G σ ( z , s ) e 2 i θ s 2 G σ ( z , s ) s .

This implies that

( 1 e 2 i θ s 2 ) G σ ( z , s ) s =i e i θ z G σ (z,s),

which in turn implies

G σ ( z , s ) s = i e i θ z 1 e 2 i θ s 2 G σ (z,s).

Integrating both sides with respect to s with the condition G σ (0,0)=1, we obtain

G σ (z,s)= ( 1 e i θ s 1 + e i θ s ) i z 2 = e z arctan s e i ( θ + π 2 ) .
  1. (b)

    In order to prove the orthogonality of σ n (x) polynomials and compute their norms, it suffices to show that

    S G σ (z,s) G σ ( z , t ) ¯ d P z = 1 + s t ¯ 1 s t ¯ .
    (4.3)

To this end, let take α=arctans e i ( θ + π 2 ) , β=arctan t ¯ e i ( θ + π 2 ) and the formula e ( α + β ) x 2 cosh π 2 x dx= 1 cos ( α + β ) . Then

S G σ ( z , s ) G σ ( z , t ) ¯ d P z = e ( x + i ) α + ( x i ) β + e ( x i ) α + ( x + i ) β 4 cosh ( π 2 x ) d x = e i ( α β ) + e i ( α β ) 2 e ( α + β ) x 2 cosh ( π 2 x ) d x = cos ( α β ) cos ( α + β ) = 1 + tan α tan β 1 tan α tan β = 1 + s t ¯ 1 s t ¯ .
  1. (c)

    In the light of (a) and equation (4.3), we have

    + G σ ( z , s ) G σ ( z , t ) ¯ d x 2 cosh π 2 x d x = + ( k = 0 σ k ( x ) s k ) ( n = 0 σ n ( x ) t ¯ n ) d x 2 cosh π 2 x d x = k = 0 n = 0 s k t ¯ n + σ k ( x ) σ n ( x ) d x 2 cosh π 2 x d x = 1 + 2 k = 0 ( s t ¯ ) k .

Comparing the coefficients of the powers of s and t ¯ , we obtain the desired result. □

Remark 2 Applying Cauchy’s integral formula to the generating function of the system, one obtains the integral representation

σ n (x)= 1 2 π i K e z arctan ( t e i ( θ + π 2 ) ) d t t n + 1

around a closed contour K about the origin with radius less than 1.

Remark 3 Let y(x)= σ n (x). The function y(x) satisfies the following difference equation:

y ( x + i ) y ( x i ) 2 i = n y ( x ) x .

Proposition 2 The system { σ n } satisfies the following relation:

σ n (2x)= lim λ 0 + S n λ (x;θ).

Proof By (4.1) and by the definition of F 1 2 (a,b,c;z), we have

lim λ 0 + S n λ ( x ; θ ) = lim λ 0 + e i n θ ( 2 λ ) n n ! 2 F 1 ( n , λ + i x , 2 λ ; 2 ) = lim λ 0 + e i n θ ( 2 λ ) n n ! k = 0 n ( n ) k ( λ + i x ) k ( 2 λ ) k 2 k k ! = e i n θ n ! lim λ 0 + k = 0 n ( n ) k ( λ + i x ) k ( 2 λ + k ) n k 2 k k ! = e i n θ n ! k = 0 n ( n ) k ( i x ) k ( k ) n k 2 k k ! = σ n ( 2 x ) .

 □

Remark 4 From Proposition 1 we get

σ n (x)= x e i θ i n S n 1 1 ( x 2 ; θ ) .

5 The case ψ=πθ

We define quasi-symmetric Meixner-Pollaczek (QMP) polynomials Q n λ (x;θ) by the generating function

G λ (x;θ,πθ;z)= 1 ( 1 z e i θ ) λ i x ( 1 + z e i θ ) λ + i x = n = 0 Q n λ (x;θ) z n ,zD.

Remark 5

  1. (a)

    The QMP polynomials Q n λ = Q n λ (x;θ) satisfy the three-term recurrence relation

    Q 1 λ = 0 , Q 0 λ = 1 , n Q n λ = 2 i [ ( λ + n 1 ) sin θ x cos θ ] Q n 1 λ + ( 2 λ + n 2 ) Q n 2 λ , n 1 .
  2. (b)

    The polynomials Q n λ = Q n λ (x;θ) are given by the formula

    Q n λ (x;θ)= e i n θ j = 0 n ( 1 ) j ( λ + i x ) j ( λ i x ) n j j ! ( n j ) ! e 2 i j θ ,nN{0}.
  3. (c)

    The polynomials Q n λ = Q n λ (x;θ) have the hypergeometric representation

    Q n λ (x;θ)= e i n θ ( 2 λ ) n n ! 2 F 1 ( n , λ + i x , 2 λ ; 1 + e 2 i θ ) .
    (5.1)
  4. (d)

    The polynomials y(x)= Q n λ (x;θ) satisfy the following difference equation:

    e i θ (λix)y(x+i)2 [ x sin θ + ( n + λ ) cos θ ] y(x)+ e i θ (λ+ix)y(xi)=0.
  5. (e)

    The polynomials Q n λ (x;θ) are orthogonal on (,+) with the weight

    w θ λ (x)= 1 2 π e 2 θ x | Γ ( λ + i x ) | 2

for λ>0 and θ( π 2 , π 2 ) and

1 2 π + e 2 θ x | Γ ( λ + i x ) | 2 Q n λ (x;θ) Q m λ ( x ; θ ) ¯ dx= δ m n Γ ( n + 2 λ ) ( cos θ ) 2 λ n ! .
(5.2)

The Fisher information I θ (μ) of a random variable X with distribution μ(x;θ), where θ is a continuous parameter, is defined by [20]

I θ (μ)=E { [ x ln ( μ ) ] 2 } .

It is named after RA Fisher who invented the concept of maximum likelihood estimator and discovered several of its properties. Over the years, the concept of Fisher information has found many application in physics [21], biology [22], engineering, etc. In [23] Dominici considered a sequence P n (x) of orthogonal polynomials with respect to the weight function ρ(x) satisfying

x = 0 P n (x) P m (x)ρ(x)= h n δ n m ,n,m=0,1,.

Introducing the functions

ρ n (x)= [ P n ( x ) ] 2 ρ ( x ) h n ,n N 0 ,
(5.3)

the Fisher information corresponding to the functions (5.3) may be described as follows:

I θ ( P n )= x = 0 [ θ ρ n ( x ) ] 2 1 ρ n ( x ) ,n N 0 .

For the family P n (x) of polynomials defined by

P n (x) = 2 F 1 [ n , x , c ; z ( θ ) ] ,n N 0 ,

in [23], it was computed that

P n θ = n z z θ [ P n ( x ) P n 1 ( x ) ] ,n N 0 .
(5.4)

In this work we use the ideas of [23] to compute the Fisher information of QMP polynomials.

Theorem 4 The Fisher information of QMP polynomials is given by

I θ ( Q n λ ) = [ θ ρ n ( x ) ] 2 1 ρ n ( x ) dx= 2 [ n 2 + ( 2 n + 1 ) λ ] cos 2 θ ,n N 0 ,

with ρ n (x) defined as in (5.3).

Proof For GMP we have ρ(x)= w θ λ (x)= 1 2 π e 2 θ x | Γ ( λ + i x ) | 2 .

From (5.4) and (5.1), we have

Q n λ θ =ntan(θ) Q n λ +i 2 λ + n 1 cos θ Q n 1 λ ,

while (5.3) and (5.2) give

ρ n (x)= e 2 θ x | Γ ( λ + i x ) | 2 ( cos θ ) 2 λ n ! [ Q n ( x ) ] 2 2 π Γ ( n + 2 λ ) .
(5.5)

Note that

ρ n (x)dx=1,n N 0 .
(5.6)

Differentiating (5.5) with respect to θ, we obtain

ρ n ( x ) θ = i ρ n ( x ) cos θ Q n λ [ ( n + 1 ) Q n + 1 λ ( 2 λ + n 1 ) Q n 1 λ ] .

Therefore

[ θ ρ n ( x ) ] 2 1 ρ n ( x ) = ρ n ( x ) cos 2 θ ( Q n λ ) 2 × [ ( n + 1 ) 2 ( Q n + 1 λ ) 2 2 ( n + 1 ) ( 2 λ + n 1 ) Q n + 1 λ Q n 1 λ + ( 2 λ + n 1 ) ( Q n 1 λ ) 2 ] = 1 cos 2 θ [ ( n + 1 ) ( n + 2 λ ) ρ n + 1 ( x ) + n ( n + 2 λ 1 ) ρ n 1 2 ( n + 1 ) ( 2 λ + n 1 ) ( cos θ ) 2 λ n ! Γ ( n + 2 λ ) ρ ( x ) Q n + 1 λ Q n 1 λ ] .
(5.7)

Integrating (5.7) and using the orthogonality relation (5.2), and (5.6), we get

I θ ( Q n λ ) = [ θ ρ n ( x ) ] 2 1 ρ n ( x ) dx= 1 cos 2 θ [ ( n + 1 ) ( n + 2 λ ) + n ( n + 2 λ 1 ) ]

and the result follows. □

References

  1. 1.

    Robertson MS: On the theory of univalent functions. Ann. Math. 1936, 37: 374–408. 10.2307/1968451

    Article  Google Scholar 

  2. 2.

    Pommerenke C: Linear-invariant Familien analytischer Funktionen. Math. Ann. 1964, 155: 108–154. 10.1007/BF01344077

    MathSciNet  Article  Google Scholar 

  3. 3.

    Yamashita S: Nonunivalent generalized Koebe function. Proc. Jpn. Acad., Ser. A, Math. Sci. 2003, 79(1):9–10. 10.3792/pjaa.79.9

    Article  Google Scholar 

  4. 4.

    Hille E: Remarks on a paper by Zeev Nehari. Bull. Am. Math. Soc. 1949, 55: 552–553. 10.1090/S0002-9904-1949-09243-1

    MathSciNet  Article  Google Scholar 

  5. 5.

    Campbell DM, Pfaltzgraff JA:Mapping properties of log g (z). Colloq. Math. 1974, 32: 267–276.

    MathSciNet  Google Scholar 

  6. 6.

    Koekoek, R, Swarttouw, RF: The Askey-scheme of hypergeometric orthogonal polynomials and its q-analogue. Report 98–17, Delft University of Technology (1998)

    Google Scholar 

  7. 7.

    Naraniecka I, Szynal J, Tatarczak A: The generalized Koebe function. Tr. Petrozavodsk. Gos. Univ. Ser. Mat. 2010, 17: 62–66.

    MathSciNet  Google Scholar 

  8. 8.

    Chihara TS: An Introduction to Orthogonal Polynomials. Gordon and Breach, New York; 1978.

    Google Scholar 

  9. 9.

    Meixner J: Orthogonale Polynomsysteme mit einer besonderen Gestalt der erzeugenden Funktion. J. Lond. Math. Soc. 1934, 9: 6–13.

    MathSciNet  Article  Google Scholar 

  10. 10.

    Pollaczak F: Sur une famille de polynomes orthogonaux qui contient les polynomes d’Hermite et de Laguerre comme cas limites. C. R. Acad. Sci. Paris 1950, 230: 1563–1565.

    MathSciNet  Google Scholar 

  11. 11.

    Askey R, Wilson J: Some basic hypergeometric orthogonal polynomials that generalize Jacobi polynomials. Mem. Am. Math. Soc. 1985., 54: Article ID 319

    Google Scholar 

  12. 12.

    Erdélyi A, et al. I. In Higher Transcendental Functions. McGraw-Hill, New York; 1953. Bateman Manuscript Project.

    Google Scholar 

  13. 13.

    Rahman M: A generalization of Gasper’s kernel for Hahn polynomials: application to Pollaczek polynomials. Can. J. Math. 1978, 30(1):133–146. 10.4153/CJM-1978-011-7

    Article  Google Scholar 

  14. 14.

    Atakishiyev NM, Suslov SK: The Hahn and Meixner polynomials of an imaginary argument and some of their applications. J. Phys. A, Math. Gen. 1985, 18: 1583–1596. 10.1088/0305-4470/18/10/014

    MathSciNet  Article  Google Scholar 

  15. 15.

    Bender CM, Mead LR, Pinsky S: Continuous Hahn polynomials and the Heisenberg algebra. J. Math. Phys. 1987, 28(3):509–513. 10.1063/1.527635

    MathSciNet  Article  Google Scholar 

  16. 16.

    Koornwinder TH: Meixner-Pollaczek polynomials and the Heisenberg algebra. J. Math. Phys. 1989, 30(4):767–769. 10.1063/1.528394

    MathSciNet  Article  Google Scholar 

  17. 17.

    Li X, Wong R: On the asymptotics of the Meixner-Pollaczek polynomials and their zeros. Constr. Approx. 2001, 17: 59–90.

    MathSciNet  Article  Google Scholar 

  18. 18.

    Poularikas AD: The Handbook of Formulas and Tables for Signal Processing. CRC Press, Boca Raton; 1999.

    Google Scholar 

  19. 19.

    Araaya, TK: The symmetric Meixner-Pollaczek polynomials. Uppsala Dissertations in Mathematics, Department of Mathematics, Uppsala University (2003)

    Google Scholar 

  20. 20.

    Fisher RA: Statistical Methods and Scientific Inference. Hafner Press, New York; 1973.

    Google Scholar 

  21. 21.

    Friden BR: Science from Fisher Information. Cambridge University Press, Cambridge; 2004.

    Book  Google Scholar 

  22. 22.

    Zheng G, Gastwirth JL: Fisher information in randomly sampled sib pairs and extremely discordant sib pairs in genetic analysis for a quantitative trait locus. J. Stat. Plan. Inference 2005, 130(1–2):299–315. 10.1016/j.jspi.2003.08.019

    MathSciNet  Article  Google Scholar 

  23. 23.

    Dominici D: Fisher information of orthogonal polynomials. J. Comput. Appl. Math. 2010, 233(6):1511–1518. 10.1016/j.cam.2009.02.066

    MathSciNet  Article  Google Scholar 

Download references

Author information

Affiliations

Authors

Corresponding author

Correspondence to Stanislawa Kanas.

Additional information

Competing interests

The authors declare that they have no competing interests.

Authors’ contributions

The authors declare that the study was realized in collaboration with the same responsibility. All authors read and approved the final manuscript.

Rights and permissions

Open Access This article is distributed under the terms of the Creative Commons Attribution 2.0 International License (https://creativecommons.org/licenses/by/2.0), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Reprints and Permissions

About this article

Cite this article

Kanas, S., Tatarczak, A. Generalized Meixner-Pollaczek polynomials. Adv Differ Equ 2013, 131 (2013). https://doi.org/10.1186/1687-1847-2013-131

Download citation

Keywords

  • Meixner-Pollaczek polynomials
  • difference equation
  • generating function
  • orthogonal polynomials
  • Fisher information