1 Introduction and results required

The generalized hypergeometric function with p numeratorial and q denominatorial parameters is defined by [13]

F q p [ α 1 , , α p ; β 1 , , β q ; z ] = F q p [ α 1 , , α p ; β 1 , , β q ; z ] = n = 0 ( α 1 ) n ( α p ) n ( β 1 ) n ( β q ) n z n n ! ,
(1.1)

where ( α ) n denotes the well-known Pochhammer symbol defined for any αC by

( α ) n ={ α ( α + 1 ) ( α + 2 ) ( α + n 1 ) ( n N = { 1 , 2 , 3 , } ) , 1 ( n = 0 ) ,
(1.2)

and Γ is the well-known Gamma function defined by

Γ(s)= 0 e x x s 1 dx ( ( s ) > 0 ) .
(1.3)

For details as regards convergence etc. of F q p , we refer to [2].

It is interesting to mention here that whenever a generalized hypergeometric function reduces to gamma functions, the results are very important from the application point of view. Thus well-known classical summation theorems such as those of Gauss, Gauss second, Kummer, and Bailey for the series F 1 2 ; Watson, Dixon, Whipple and Saalschütz for the series F 2 3 and others play an important role in the theory of hypergeometric, generalized hypergeometric series and other branches of applied mathematics.

Recently a good deal of progress has been made in the direction of generalizations and extensions of the above mentioned classical summation theorems. For this, we refer to the research papers [4, 5] and the references therein.

This function has been extensively studied in great detail by many authors such as Exton [6] and Slater [3]. Here we shall mention some of the classical summation theorems, their generalizations, and their extensions so that the paper can be self-contained: Gauss’ summation theorem [2, 7]:

F 1 2 [ a , b ; c ; 1 ] = Γ ( c ) Γ ( c a b ) Γ ( c a ) Γ ( c b ) ,
(1.4)

provided that (cab)>0.

Kummer’s summation theorem [2, 7]:

F 1 2 [ a , b ; 1 + a b ; 1 ] = Γ ( 1 + 1 2 a ) Γ ( 1 + a b ) Γ ( 1 + a ) Γ ( 1 + 1 2 a b ) .
(1.5)

Contiguous Kummer’s summation theorems [7]:

F 1 2 [ a , b ; a b ; 1 ] = Γ ( 1 2 ) Γ ( a b ) 2 a [ 1 Γ ( 1 2 a ) Γ ( 1 2 a b + 1 2 ) + 1 Γ ( 1 2 a + 1 2 ) Γ ( 1 2 a b ) ] ,
(1.6)
F 1 2 [ a , b ; a b 1 ; 1 ] = Γ ( 1 2 ) Γ ( a b 1 ) 2 a F 1 2 [ a , b ; a b 1 ; 1 ] = × [ ( a b 1 ) Γ ( 1 2 a b ) Γ ( 1 2 a + 1 2 ) + 2 Γ ( 1 2 a b 1 2 ) Γ ( 1 2 a ) ] .
(1.7)

Extension of Gauss’ summation theorem [4, 7]:

F 2 3 [ a , b , d + 1 ; c + 1 , d ; 1 ] = Γ ( c + 1 ) Γ ( c a b ) Γ ( c a + 1 ) Γ ( c b + 1 ) [ ( c a b ) + a b d ] ,
(1.8)

provided (cab)>0 and d0,1,2, .

Extension of Kummer’s summation theorem [4]:

F 2 3 [ a , b , d + 1 ; 2 + a b , d ; 1 ] = Γ ( 1 2 ) Γ ( 2 + a b ) 2 a ( 1 b ) [ ( 1 + a b d 1 ) Γ ( 1 2 a ) Γ ( 1 2 a b + 3 2 ) + ( 1 a d ) Γ ( 1 2 a + 1 2 ) Γ ( 1 2 a b + 1 ) ] .
(1.9)

Extension of contiguous Kummer’s theorem (1.7):

F 2 3 [ a , b , d + 1 ; a b , d ; 1 ] = Γ ( 1 2 ) Γ ( a b ) 2 a [ ( 1 b d ) Γ ( 1 2 a ) Γ ( 1 2 a b + 1 2 ) + 1 Γ ( 1 2 a + 1 2 ) Γ ( 1 2 a b ) ] ,
(1.10)

for d0,1,2, .

We remark in passing that the result (1.10) is a presumably new result.

Proof In order to derive (1.10) we proceed as follows. Denoting the left-hand side of (1.10) by S, expressing F 2 3 as a series, after some simplifications, we have

S = n = 0 ( a ) n ( b ) n ( 1 ) n ( a b ) n n ! ( 1 + n d ) = F 1 2 [ a , b ; a b ; 1 ] + 1 d n = 1 ( a ) n ( b ) n ( 1 ) n ( a b ) n ( n 1 ) ! .

Now replacing n1=N in the second term and using the result ( a ) n + 1 =a ( a + 1 ) n and simplifying and finally summing up the second series, we get

S= F 1 2 [ a , b ; a b ; 1 ] a b d ( a b ) F 1 2 [ a + 1 , b + 1 ; 1 + a b ; 1 ] .
(1.11)

Now we observe that the first F 1 2 on the right-hand side of (1.11) can be evaluated with the help of the known result (1.6) while the second F 1 2 on the right-hand side of (1.11) can be evaluated with the help of Kummer’s summation theorem (1.5), after some simplification, we easily arrive at the right-hand side of (1.10). This completes the proof of (1.10). □

Remark In (1.10), if we set d=ab1 we recover (1.7).

It is not out of place to mention here that in many branches of pure and applied mathematics, engineering, and mathematical physics, the Laguerre polynomial defined by

L n ( ν ) (x)= ( ν + 1 ) n n ! F 1 1 [ n ; ν + 1 ; x ] ,
(1.12)

which is a terminating form of the confluent hypergeometric function F 1 1 , has frequently occurred [[8], p.268].

On the other hand, by elementary manipulation of series, very recently, Kim et al. [9] have obtained the following interesting and general transformation involving the generalized hypergeometric function viz.:

n = 0 ( a 1 ) n ( a p ) n ( b 1 ) n ( b q ) n ( d ) n n ! x n y n F 1 1 [ d + n ; f ; x ] = n = 0 ( d ) n ( f ) n x n n ! p + 2 F q [ n , 1 f n , a 1 , , a b ; b 1 , , b q ; y ] .
(1.13)

Using Kummer’s first transformation [2], viz.

F 1 1 [ a ; c ; x ] = e x F 1 1 [ c a ; c ; x ] ,
(1.14)

in (1.13) and employing Kummer’s summation theorem (1.5) and Gauss’ summation theorem (1.4), they have also obtained the following interesting summation formulas involving the Laguerre polynomial viz.:

e x n = 0 x n ( ν + 1 ) n L n ( ν ) (x)= F 1 0 [ ; ν + 1 ; x 2 ] ,
(1.15)

where ν1,2 ,

e x n = 0 x n ( 1 ν ) n L n ( ν ) ( x ) = F 2 1 [ 1 2 ν + 1 2 ; 1 2 , 1 1 2 ν ; x 2 ] + 2 x ν 1 ν F 1 1 [ 1 2 ν + 1 ; 3 2 , 3 2 1 2 ν ; x 2 ] ,
(1.16)

where ν1,2, ,

e x n = 0 ( x ) n ( μ ) n L n ( ν ) (x)= F 2 2 [ 1 2 μ + 1 2 ν , 1 2 μ + 1 2 ν + 1 2 ; μ , μ + ν ; 4 x ] .
(1.17)

Remark 1. In fact, the results (1.13), (1.15), (1.16), and (1.17) are the corrected forms of those obtained earlier by Exton [10].

  1. 2.

    For several new and interesting results closely related to (1.15) and (1.16), see Kim et al. [9].

The following extension of Kummer’s first transformation (1.14) established by Paris [11] will be required in our present investigation:

e x F 2 2 [ a , 1 + d ; b + 1 , d ; x ] = F 2 2 [ b a , f + 1 ; b + 1 , f ; x ] ,

where f= d ( a b ) a d .

The aim of this research paper is to first establish a general transformation formula which generalizes (1.13). Then by employing extensions of Gauss’ summation theorem, Kummer’s summation theorem, and its contiguous results, we establish three new and interesting summation formulas for the generalized hypergeometric F 2 2 polynomial which generalize the results (1.15), (1.16), and (1.17).

We conclude this section by remarking that the results established in this research paper are simple, interesting, easily established, and (potentially) useful.

2 Main transformation formula

The transformation formula involving the generalized hypergeometric function to be established in this paper is

n = 0 ( a 1 ) n ( a p ) n ( b 1 ) n ( b q ) n ( d ) n n ! x n y n F 2 2 [ d + n , e + 1 ; f + 1 , e ; x ] = n = 0 ( d ) n ( e + 1 ) n ( f + 1 ) n ( e ) n x n n ! × F q + 1 p + 3 [ n , 1 e n , f n , a 1 , , a p ; e n , b 1 , , b q ; y ] .
(2.1)

Proof In order to prove (2.1), we proceed as follows. If we denote the left-hand side of (2.1) by S and express F 2 2 as a series, we have

S= n = 0 m = 0 ( a 1 ) n ( a p ) n ( b 1 ) n ( b q ) n ( d ) n ( d + n ) m ( e + 1 ) m ( f + 1 ) m ( e ) m n ! m ! x n + m y n ,

which, upon use of the identity

( d ) n ( d + n ) m = ( d ) m + n ,

becomes

S= m = 0 n = 0 ( a 1 ) n ( a p ) n ( b 1 ) n ( b q ) n ( d ) n + m ( e + 1 ) m ( f + 1 ) m ( e ) m n ! m ! x n + m y n .

Now replacing m by mn and making use of a simple manipulation for the double series [[2], p.56]

n = 0 k = 0 A(k,n)= n = 0 k = 0 n A(k,nk),

we have

S= m = 0 n = 0 m ( a 1 ) n ( a p ) n ( b 1 ) n ( b q ) n ( d ) m ( e + 1 ) m n ( f + 1 ) m n ( e ) m n x m y n n ! ( m n ) ! .

Using the series identities

( a ) m n = ( 1 ) n ( a ) m ( 1 a m ) n

and

(mn)!= ( 1 ) n m ! ( m ) n

in the last summation, after little simplifications, we get

S= m = 0 ( d ) m ( e + 1 ) m ( f + 1 ) m ( e ) n m x m m ! n = 0 m ( a 1 ) n ( a p ) n ( f m ) n ( 1 e m ) n ( m ) n ( b 1 ) n ( b q ) n ( e m ) n n ! y n .

Finally, expressing the inner series as a F q + 2 p + 3 (y) hypergeometric function, we then easily arrive at the right-hand side of (2.1). This completes the proof of (2.1). □

Remark 1. Our main transformation formula (2.1) is a special case of a general transformation formula given by Slater [[3], p.60].

  1. 2.

    In our main transformation formula (2.1), if we take f=e, we get at once the result due to Kim et al. [[9], p.437, Eq. (2.1)].

3 New class of summation formulas involving the generalized hypergeometric F 2 2 polynomial

The summation formulas to be established in this section are given by the following theorems.

Theorem 1 The following formula holds true:

e x n = 0 x n n ! F 2 2 [ n , e + 1 ; ν + 2 , e ; x ] = F 3 2 [ 1 2 ν + 1 2 , 1 2 e + 1 ; ν + 1 , 1 2 e , 1 2 ν + 3 2 ; x 2 ] + ( e ν 1 ) x e ( ν + 2 ) F 2 1 [ 1 2 ν + 1 ; ν + 2 , 1 2 ν + 2 ; x 2 ] .
(3.1)

Theorem 2 The following formula holds true:

e x n = 0 ( 1 + ν ) n ( 1 ν ) n x n n ! F 2 2 [ n , e + 1 ; ν + 2 , e ; x ] = Γ ( 1 2 ) Γ ( 1 ν ) e 2 ν 1 { ( e ν 1 ) Γ ( 1 2 ν ) Γ ( 1 2 1 2 ν ) F 3 2 [ 1 2 ν + 1 2 , 1 2 ν + 1 ; 3 2 , 1 2 ν + 3 2 , 1 2 1 2 ν ; x 2 ] ( e ν ) Γ ( 1 2 ν 1 2 ) Γ ( 1 1 2 ν ) F 3 2 [ 1 2 ν + 1 2 , 1 2 e 1 2 ν + 1 ; 3 2 , 1 2 e 1 2 ν , 1 1 2 ν ; x 2 ] } x ( ν + 1 ) ( ν + 2 ) Γ ( 1 2 ) Γ ( 1 ν ) e 2 ν 1 { ( e ν 1 ) Γ ( 1 2 ν 1 2 ) Γ ( 1 1 2 ν ) × F 4 3 [ 1 , 1 2 ν + 1 , 1 2 ν + 3 2 ; 2 , 3 2 , 1 2 ν + 2 , 1 1 2 ν ; x 2 ] ( 1 + e ν ) Γ ( 1 2 ν 1 ) Γ ( 3 2 1 2 ν ) F 4 3 [ 1 , 1 2 ν + 1 , 3 2 + 1 2 e 1 2 ν ; 2 , 3 2 , 1 2 + 1 2 e 1 2 ν , 3 2 1 2 ν ; x 2 ] } .
(3.2)

Theorem 3 The following formula holds true:

e x n = 0 ( 1 + ν ) n ( μ ) n ( x ) n n ! F 2 2 [ n , e + 1 ; ν + 2 , e ; x ] = F 5 5 [ ν + 1 , 1 2 μ + 1 2 ν , 1 2 μ + 1 2 ν + 1 2 , e + 1 2 μ 1 2 A + 1 2 , e + 1 2 μ + 1 2 A + 1 2 ; ν + 2 , μ , μ + ν + 1 , e + 1 2 μ 1 2 A 1 2 , e + 1 2 μ + 1 2 A 1 2 ; 4 x ] ,
(3.3)

where A 2 = ( μ 1 + 2 e ) 2 4e(μ+ν).

Proof In order to establish Theorem 1, we proceed as follows. If we apply the extension of Kummer’s first transformation (1.14) to (2.1), we obtain

e x n = 0 ( a 1 ) n ( a p ) n ( b 1 ) n ( b q ) n ( d ) n n ! x n y n F 2 2 [ f d n , e + 1 ; f + 1 , e ; x ] = n = 0 ( d ) n ( e + 1 ) n ( f + 1 ) n ( e ) n x n n ! F q + 1 p + 3 [ n , 1 e n , f n , a 1 , , a p ; e n , b 1 , , b p ; y ] .
(3.4)

Putting d=f in (3.4), we get

e x n = 0 ( a 1 ) n ( a p ) n ( b 1 ) n ( b q ) n ( f ) n n ! x n y n F 2 2 [ n , e + 1 ; f + 1 , e ; x ] = n = 0 ( f ) n ( e + 1 ) n ( f + 1 ) n ( e ) n x n n ! F q + 1 p + 3 [ n , 1 e n , f n , a 1 , , a p ; e n , b 1 , , b p ; y ] .

Now, replacing x by −x and putting f=ν+1, we have

e x n = 0 ( a 1 ) n ( a p ) n ( b 1 ) n ( b q ) n ( ν + 1 ) n n ! ( x ) n y n F 2 2 [ n , e + 1 ; ν + 2 , e ; x ] = n = 0 ( ν + 1 ) n ( e + 1 ) n ( ν + 2 ) n ( e ) n ( x ) n n ! F q + 1 p + 3 [ n , 1 e n , ν 1 n , a 1 , , a p ; e n , b 1 , , b q ; y ] .
(3.5)

Now, set p=0, q=1, b 1 =ν+1, and y=1 in (3.5), and we get

e x n = 0 x n n ! F 2 2 [ n , e + 1 ; ν + 2 , e ; x ] = n = 0 ( ν + 1 ) n ( e + 1 ) n ( ν + 2 ) n ( e ) n ( x ) n n ! F 2 3 [ n , ν 1 n , 1 e n ; ν + 1 , e n ; 1 ] ,
(3.6)

which is valid for |x|<.

Now, it is readily seen that the F 2 3 on the right-hand side of (3.6) can be evaluated with the help of the contiguous extension of Kummer’s summation theorem in (1.10) to yield

e x n = 0 x n n ! F 2 2 [ n , e + 1 ; ν + 2 , e ; x ] = n = 0 ( ν + 1 ) n ( e + 1 ) n ( ν + 2 ) n ( e ) n ( x ) n n ! [ Γ ( 1 2 ) Γ ( ν + 1 ) 2 n Γ ( 1 2 n ) Γ ( 1 2 n + ν + 3 2 ) ( 1 ν + 1 + n e + n ) + Γ ( 1 2 ) Γ ( ν + 1 ) 2 n Γ ( 1 2 n + 1 2 ) Γ ( 1 2 n + ν + 1 ) ] .
(3.7)

Now, separating the terms appearing on the right-hand side of (3.7) into even and odd powers of x and making use of the following elementary identities:

Γ ( a n ) = ( 1 ) n Γ ( a ) ( 1 n ) n , 2 n ! = 2 2 n n ! ( 1 2 ) n , ( 2 n + 1 ) ! = 2 2 n n ! ( 3 2 ) , ( a ) 2 n = 2 2 n ( 1 2 a ) n ( 1 2 a + 1 2 ) n , ( a ) 2 n + 1 = a 2 2 n ( 1 2 a + 1 2 ) n ( 1 2 a + 1 ) n ,
(3.8)

and after some straightforward calculation, we have

e x n = 0 x n n ! F 2 2 [ n , e + 1 ; ν + 2 , e ; x ] = n = 0 ( 1 2 ν + 1 2 ) n ( 1 2 e + 1 ) n ( ν + 1 ) n ( 1 2 e ) n ( 1 2 ν + 3 2 ) n ( 1 ) n x 2 n n ! + ( e 1 ν ) x e ( ν + 2 ) n = 0 ( 1 2 ν + 1 ) n ( 1 ) n ( ν + 2 ) n ( 1 2 + 2 ) n x 2 n n ! .
(3.9)

Finally, summing up the two series on the right-hand side, we easily arrive at the desired result (2.1). This completes the proof of Theorem 1.

In order to establish Theorem 2, if we set p=0, q=1, b 1 =1ν and y=1 in (3.5), we have

e x n = 0 ( ν + 1 ) n ( 1 ν ) n x n n ! F 2 2 [ n , e + 1 ; ν + 2 , e ; x ] = n = 0 ( ν + 1 ) n ( e + 1 ) n ( ν + 2 ) n ( e ) n ( x ) n n ! F 2 3 [ n , ν 1 n , 1 e n ; 1 ν , e n ; 1 ] ,
(3.10)

which is valid for |x|<.

It is now easy to see that the F 2 3 on the right-hand side of (3.10) can be evaluated with the help of the extension of Kummer’s summation theorem (1.9); we get

e x n = 0 ( ν + 1 ) n ( 1 ν ) n x n n ! F 2 2 [ n , e + 1 ; ν + 2 , e ; x ] = Γ ( 1 2 ) Γ ( 1 ν ) 2 ν 1 n = 0 ( ν + 1 ) n ( e + 1 ) n ( x ) n ( ν + 2 ) n ( e ) n ( e + n ) 2 n Γ ( n + 2 ) × { ( e ν 1 ) Γ ( 1 2 n 1 2 ν ) Γ ( 1 2 n 1 2 ν + 1 2 ) ( e ν + n ) Γ ( 1 2 n 1 2 ν 1 2 ) Γ ( 1 2 n 1 2 ν + 1 ) } .
(3.11)

Now, separating the terms appearing on the right-hand side of (3.11) into even and odd powers of x and making use of the elementary identities given in (3.8) and after some straightforward algebra, we get

e x n = 0 ( 1 + ν ) n ( 1 ν ) n x n n ! F 2 2 [ n , e + 1 ; ν + 2 , e ; x ] = Γ ( 1 2 ) Γ ( 1 ν ) e 2 ν 1 { ( e ν 1 ) Γ ( 1 2 ν ) Γ ( 1 2 1 2 ν ) n = 0 ( 1 2 ν + 1 2 ) n ( 1 2 ν + 1 ) n ( 1 ) n x 2 n ( 3 2 ) n ( 1 2 ν + 3 2 ) n ( 1 2 1 2 ν ) n n ! ( e v ) Γ ( 1 2 ν 1 2 ) Γ ( 1 1 2 ν ) n = 0 ( 1 2 ν + 1 2 ) n ( 1 2 e 1 2 ν + 1 ) n ( 1 ) n x 2 n ( 3 2 ) n ( 1 2 e 1 2 ν ) n ( 1 1 2 ν ) n n ! } x ( ν + 1 ) ( ν + 2 ) Γ ( 1 2 ) Γ ( 1 ν ) e 2 ν 1 { ( e ν 1 ) Γ ( 1 2 ν 1 2 ) Γ ( 1 1 2 ν ) × n = 0 ( 1 ) n ( 1 2 ν + 1 ) n ( 1 2 ν + 3 2 ) n ( 1 ) n x 2 n ( 2 ) n ( 3 2 ) n ( 1 2 ν + 2 ) n ( 1 1 2 ν ) n n ! ( 1 + e ν ) Γ ( 1 2 ν + 1 ) Γ ( 3 2 1 2 ν ) n = 0 ( 1 ) n ( 1 2 ν + 1 ) n ( 3 2 + 1 2 e 1 2 ν ) n ( 1 ) n x 2 n ( 2 ) n ( 3 2 ) n ( 1 2 + 1 2 e 1 2 ν ) n ( 3 2 1 2 ν ) n n ! } .
(3.12)

Finally, summing up the four series on the right-hand side, we arrive at the desired result (3.2). This completes the proof of Theorem 2.

In order to prove Theorem 3, if we set p=0, q=1, b 1 =μ, and y=1 in (3.5), we have

e x n = 0 ( 1 + ν ) n ( μ ) n ( x ) n n ! F 2 2 [ n , e + 1 ; ν + 2 , e ; x ] = n = 0 ( ν + 1 ) n ( e + 1 ) n ( ν + 2 ) ( e ) n ( x ) n n ! F 2 3 [ n , ν 1 n , 1 e n ; μ , e n ; 1 ] .
(3.13)

Now, if we make use of extension of Gauss summation theorem (1.8), after some simplification, we easily arrive at the desired results (3.3). This completes the proof of Theorem 3. □

We also note that if one puts μ=1ν, one obtains Theorem 2, and if μ=1+ν one obtains Theorem 1.

4 Special cases

  1. (a)

    In (3.1), if we set e=ν+1, we have

    e x n = 0 x n n ! F 1 1 [ n ; ν + 1 ; x ] = F 1 0 [ ; ν + 1 ; x 2 ] ,
    (4.1)

which, upon using the result (1.12) reduces to the well-known result (1.15).

  1. (b)

    In (3.2), if we set e=ν+1, we have

    e x n = 0 ( ν + 1 ) n ( 1 ν ) n x n n ! F 1 1 [ n ; ν + 1 ; x ] = F 2 1 [ 1 2 ν + 1 2 ; 1 2 , 1 1 2 ν ; x 2 ] + 2 x ν 1 ν F 2 1 [ 1 2 ν + 1 ; 3 2 , 3 2 1 2 ν ; x 2 ] ,
    (4.2)

which upon using the result (1.12) reduces to the well-known result (1.16).

  1. (c)

    In (3.3), if we set e=ν+1 so that A=1μ, we have

    e x n = 0 ( 1 + ν ) n ( μ ) n ( x ) n n ! F 1 1 [ n ; ν + 1 ; x ] = F 2 2 [ 1 2 μ + 1 2 ν , 1 2 μ + 1 2 ν + 1 2 ; μ , μ + ν ; 4 x ] ,
    (4.3)

which upon using the result (1.12) reduces to the well-known result (1.17).

Similarly, other results can also be obtained.