Next Article in Journal
Fractional Modeling for Quantitative Inversion of Soil-Available Phosphorus Content
Next Article in Special Issue
Some Symmetric Identities Involving the Stirling Polynomials Under the Finite Symmetric Group
Previous Article in Journal
Global Dynamics of an SIQR Model with Vaccination and Elimination Hybrid Strategies
Previous Article in Special Issue
Some Properties of the Fuss–Catalan Numbers
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Higher-Order Convolutions for Apostol-Bernoulli, Apostol-Euler and Apostol-Genocchi Polynomials

1
Faculty of Science, Kunming University of Science and Technology, Kunming 650500, Yunnan, China
2
Faculty of Economics, Administrative and Social Sciences, Hasan Kalyoncu University, Gaziantep TR-27410, Turkey
3
Department of Mathematics and Statistics, University of Victoria, Victoria, BC V8W 3R4, Canada
4
Department of Medical Research, China Medical University, Taichung 40402, Taiwan
5
Zewail City of Science andTechnology, University of Science and Technology, Cairo 82524, Egypt
*
Author to whom correspondence should be addressed.
Submission received: 20 November 2018 / Revised: 6 December 2018 / Accepted: 10 December 2018 / Published: 14 December 2018
(This article belongs to the Special Issue Special Functions and Applications)

Abstract

:
In this paper, we present a systematic and unified investigation for the Apostol-Bernoulli polynomials, the Apostol-Euler polynomials and the Apostol-Genocchi polynomials. By applying the generating-function methods and summation-transform techniques, we establish some higher-order convolutions for the Apostol-Bernoulli polynomials, the Apostol-Euler polynomials and the Apostol-Genocchi polynomials. Some results presented here are the corresponding extensions of several known formulas.

1. Introduction

Throughout this paper, C and C × denote the set of complex numbers and the set of complex numbers excluding zero, respectively. We also denote by N and N * the set of positive integers and the set of non-negative integers, respectively. For α , λ C , the generalized Apostol-Bernoulli polynomials B n ( α ) ( x ; λ ) , the generalized Apostol-Euler polynomials E n ( α ) ( x ; λ ) and the generalized Apostol-Genocchi polynomials G n ( α ) ( x ; λ ) of order α are defined by the following generating functions (see, e.g., [1,2,3,4]):
( t λ e t 1 ) α e x t = n = 0 B n ( α ) ( x ; λ ) t n n !
| t | < 2 π when λ = 1 ; | t | < | log λ | when λ 1 ; 1 α : = 1 ,
( 2 λ e t + 1 ) α e x t = n = 0 E n ( α ) ( x ; λ ) t n n !
| t | < π when λ = 1 ; | t | < | log ( λ ) | when λ 1 ; 1 α : = 1
and
( 2 t λ e t + 1 ) α e x t = n = 0 G n ( α ) ( x ; λ ) t n n !
| t | < π when λ = 1 ; | t | < | log ( λ ) | when λ 1 ; 1 α : = 1 .
In particular, the polynomials B n ( x ; λ ) , E n ( x ; λ ) and G n ( x ; λ ) given by
B n ( x ; λ ) = B n ( 1 ) ( x ; λ ) , E n ( x ; λ ) = E n ( 1 ) ( x ; λ )
and
G n ( x ; λ ) = G n ( 1 ) ( x ; λ )
are called the Apostol-Bernoulli polynomials, the Apostol-Euler polynomials and the Apostol-Genocchi polynomials, respectively. The Apostol-Bernoulli numbers B n ( λ ) , the Apostol-Euler numbers E n ( λ ) and the Apostol-Genocchi numbers G n ( λ ) are expressed by means of the Apostol-Bernoulli polynomials, the Apostol-Euler polynomials and the Apostol-Genocchi polynomials, as follows:
B n ( λ ) = B n ( 0 ; λ ) , E n ( λ ) = 2 n E n 1 2 ; λ and G n ( λ ) = G n ( 0 ; λ ) .
Furthermore, the case α = λ = 1 in (1), (2) and (3) gives the Bernoulli polynomials B n ( x ) , the Euler polynomials E n ( x ) and the Genocchi polynomials G n ( x ) , that is,
B n ( x ) = B n ( 1 ) ( x ; 1 ) , E n ( x ) = E n ( 1 ) ( x ; 1 ) and G n ( x ) = G n ( 1 ) ( x ; 1 ) .
Also the case λ = 1 in (4) gives the Bernoulli numbers B n , the Euler numbers E n and the Genocchi numbers G n as follows:
B n = B n ( 0 ) , E n = 2 n E n 1 2 and G n = G n ( 0 ) .
Recently, the above-defined generalized Apostol-Bernoulli polynomials, the generalized Apostol-Euler polynomials and the generalized Apostol-Genocchi polynomials was unified by the following generating function (see, for example, [5]):
2 1 κ t κ β b e t a b α e x t = n = 0 Y n , β ( α ) ( x ; κ , a , b ) t n n !
( | t | < 2 π when β = a ; | t | < log ( β a ) when β a ; κ , β C ; a , b C × ; 1 α : = 1 ) .
It is worth mentioning that the case α = 1 in (5) was constructed by Ozden et al. [6,7]. It is easily seen that the polynomials Y n , β ( x ; κ , a , b ) given by
Y n , β ( x ; κ , a , b ) = Y n , β ( 1 ) ( x ; κ , a , b )
can be regarded as a generalization and unification of the Apostol-Bernoulli polynomials, the Apostol-Euler polynomials and the Apostol-Genocchi polynomials with, of course, suitable choices of the parameter a, b and β . We refer to the recent works [8,9,10,11,12,13] on these Apostol-type polynomials and numbers.
In the present paper, we shall be concerned with some higher-order convolutions for the Apostol-Bernoulli polynomials, the Apostol-Euler polynomials and the Apostol-Genocchi polynomials. The idea stems from the higher-order convolutions for the Bernoulli polynomials due to Agoh and Dilcher [14], Bayad and Kim [15] and Bayad and Komatsu [16]. We establish several higher-order convolutions for the Apostol-Bernoulli polynomials, the Apostol-Euler polynomials and the Apostol-Genocchi polynomials by making use of the generating-function methods and summation-transform techniques. It turns out that several interesting known results are obtainable as special cases of our main results.
This paper is organized as follows. In Section 2, we first give the higher-order convolution for the polynomials defined by (5) Y n , β ( x ; κ , a , b ) and then present the corresponding higher-order convolutions for the Apostol-Bernoulli polynomials, the Apostol-Euler polynomials and the Apostol-Genocchi polynomials. Moreover, several corollaries and consequences of our main theorems are also deduced. Section 3 is devoted to the proofs of the main results by applying the generating-function methods and summation-transform techniques.

2. Main Results

As usual, by λ n we denote the binomial coefficients given, for λ C , by
λ 0 = 1 and λ n = λ ( λ 1 ) ( λ n + 1 ) n ! ( n N ) .
The multinomial coefficient
n r 1 , , r k
is given, for n , r 1 , , r k N * ( k N ) , by
n r 1 , , r k = n ! r 1 ! r k ! ( k N ) .
We also denote by s ( n , k ) the Stirling numbers of the first kind and by S ( n , k ) the Stirling numbers of the second kind, which are usually defined by the following generating functions (see, for example, [17,18]):
ln ( 1 + t ) k k ! = n = k s ( n , k ) t n n ! and ( e t 1 ) k k ! = n = k S ( n , k ) t n n ! .
For k N and i 1 , , i k , n N * , we write
f i 1 ( x 1 ) + + f i k ( x k ) n = l 1 + + l k = n ( l 1 , , l k 0 ) n l 1 , , l k f i 1 + l 1 ( x 1 ) f i k + l k ( x k ) ,
where f i j ( x j ) ( 1 j k ) is a sequence of polynomials. The case when f n ( x ) = B n ( x ) in (7) was first studied by Agoh and Dilcher [14] who proved an existence theorem and also derived some explicit expressions for k = 3 involving the Bernoulli polynomials. We now state the following higher-order convolution for the general Apostol-type polynomials Y n , β ( x ; κ , a , b ) defined by (5).
Theorem 1.
Let d be a positive integer and let
y = x 1 + + x d .
Then, for an integer κ and for m , n N * ,
i 1 + + i d = m ( i 1 , , i d 0 ) m i 1 , , i d Y i 1 , β ( x 1 ; κ , a , b ) + + Y i d , β ( x d ; κ , a , b ) n = 2 1 κ a b d 1 ( m + n ) ! ( d 1 ) ! i = 1 d s ( d , i ) j = 0 i 1 j ! · i 1 j κ + j 1 j · l = 0 i 1 j i 1 j l ( 1 ) l y i 1 j l m + n + j ( d 1 ) κ ! · Y m + n + j + l ( d 1 ) κ , β ( y ; κ , a , b ) .
We first deduce some special cases of Theorem 1. By taking
α = 1 , β = λ , κ = 0 , a = 1 and b = 1
in (5), we have
Y n , λ ( x ; 0 , 1 , 1 ) = E n ( x ; λ ) ( n N * ) .
Thus, by applying (8) to Theorem 1, we get the following higher-order convolution for the Apostol-Euler polynomials.
Corollary 1.
Let d be a positive integer and let
y = x 1 + + x d .
Then, for m , n N * ,
i 1 + + i d = m ( i 1 , , i d 0 ) m i 1 , , i d [ E i 1 ( x 1 ; λ ) + + E i d ( x d ; λ ) ] n = ( 2 ) d 1 ( d 1 ) ! i = 1 d s ( d , i ) l = 0 i 1 i 1 l ( 1 ) l y i 1 l E m + n + l ( y ; λ ) .
Obviously, in the case when m = 0 , Corollary 1 yields the following further special case for d N and n N * :
E 0 ( x 1 ; λ ) + + E 0 ( x d ; λ ) n = ( 2 ) d 1 ( d 1 ) ! i = 1 d s ( d , i ) l = 0 i 1 i 1 l ( 1 ) l y i 1 l E n + l ( y ; λ ) ,
which, upon setting i i + 1 , corresponds to the following result for the Apostol-Euler polynomials due to Bayad and Kim [15] Theorem 4:
l 1 + + l d = n ( l 1 , , l d 0 ) n l 1 , , l d E l 1 ( x 1 ; λ ) E l d ( x d ; λ ) = ( 2 ) d 1 ( d 1 ) ! i = 0 d 1 ( 1 ) i s ( d , i + 1 ) l = 0 i i l ( y ) l E n + i l ( y ; λ ) .
If we change the order of the summation on the right-hand side of (9), we get
E 0 ( x 1 ; λ ) + + E 0 ( x d ; λ ) n = 2 d 1 ( d 1 ) ! l = 0 d 1 ( 1 ) d 1 l E n + l ( y ; λ ) i = l + 1 d i 1 l s ( d , i ) y i 1 l = 2 d 1 ( d 1 ) ! l = 0 d 1 ( 1 ) l E n + d l 1 ( y ; λ ) i = d l d i 1 d 1 l s ( d , i ) y i d + l .
In particular, upon setting λ = 1 in (10), we find for d N and n N * that (see, for example, ref. [19] Theorem 5)
l 1 + + l d = n ( l 1 , , l d 0 ) n l 1 , , l d E l 1 ( x 1 ) E l d ( x d ) = 2 d 1 ( d 1 ) ! l = 0 d 1 ( 1 ) l E n + d l 1 ( y ) i = 0 l d + i l 1 i s ( d , d + i l ) y i .
If we take α = κ = b = 1 in (5), we obtain the following relationships for n N * :
Y n , λ ( x ; 1 , 1 , 1 ) = B n ( x ; λ ) and Y n , λ / 2 x ; 1 , 1 2 , 1 = G n ( x ; λ ) .
Consequently, Theorem 1 can be applied in conjunction with (11) in order to obtain the corresponding higher-order convolutions for the Apostol-Bernoulli polynomials and the Apostol-Genocchi polynomials. We proceed now to give here some much simpler expressions for the higher-order convolutions for the Apostol-Bernoulli polynomials and the Apostol-Genocchi polynomials.
Theorem 2.
Let d N and let
y = x 1 + + x d .
Then, for m , n N * ( m + n d ) ,
i 1 + + i d = m ( i 1 , , i d 0 ) m i 1 , , i d B i 1 ( x 1 ; λ ) + + B i d ( x d ; λ ) n = ( m + n ) ! ( m + n d ) ! · ( d 1 ) ! i = 1 d s ( d , i ) j = 0 i 1 i 1 j ( 1 ) j y i 1 j m + n + j + 1 d B m + n + j + 1 d ( y ; λ ) .
For λ = 1 , Theorem 2 reduces to the following higher-order convolution for the Bernoulli polynomials:
i 1 + + i d = m ( i 1 , , i d 0 ) m i 1 , , i d B i 1 ( x 1 ) + + B i d ( x d ) n = ( m + n ) ! ( m + n d ) ! · ( d 1 ) ! i = 1 d s ( d , i ) j = 0 i 1 i 1 j ( 1 ) j y i 1 j m + n + j + 1 d B m + n + j + 1 d ( y )
( y = x 1 + + x d ; d N ; m , n N * ; m + n d ) .
For a different expression than that given by (12) in its special case when
x 1 = = x d = x ,
see a known result [16] Corollary 4.
If we set m = 0 in Theorem 2, we get
B 0 ( x 1 ; λ ) + + B 0 ( x d ; λ ) n = n ! ( n d ) ! · ( d 1 ) ! i = 1 d ( 1 ) i 1 s ( d , i ) j = 0 i 1 i 1 j ( y ) i 1 j n + j + 1 d B n + j + 1 d ( y ; λ )
( y = x 1 + + x d ; n , d N ; n d ) .
For r N and m , n N * , it is known that (see, for example, [20] Theorem 1.2)
k = 0 m m k x m k f n + k + r ( y ) n + k + 1 r k = 0 n n k ( x ) n k f m + k + r ( x + y ) m + k + 1 r = ( 1 ) n + 1 x m + n + 1 ( r 1 ) ! 0 1 t m ( 1 t ) n f r 1 ( x + y x t ) d t ,
where λ n denotes the rising factorial of order n given by
λ 0 = 1 and λ n = λ ( λ + 1 ) ( λ + n 1 ) ( n N ; λ C ) ,
and { f n ( x ) } n = 0 is a sequence of polynomials generated by
n = 0 f n ( x ) t n n ! = F ( t ) e x 1 2 t ,
with F ( t ) being a formal power series. Thus, by taking
F ( t ) = t e t 2 λ e t 1
in (15) and substituting n d for m, i 1 for n, y for x and 0 for y in (14), we find (for positive integers i , d , n with n d ) that
j = 0 n d n d j y n d j B i + j ( λ ) i + j j = 0 i 1 i 1 j ( y ) i 1 j B n + j + 1 d ( y ; λ ) n + j + 1 d = ( 1 ) i y n d + i 0 1 t n d ( 1 t ) i 1 B 0 ( y y t ) d t .
It is easily seen from the properties of the Beta function B ( α , β ) and the Gamma function Γ ( z ) that
B ( m + 1 , n + 1 ) = 0 1 t m ( 1 t ) n d t = Γ ( m + 1 ) Γ ( n + 1 ) Γ ( m + n + 2 ) = m ! · n ! ( m + n + 1 ) ! ( m , n N * ) .
Let δ 1 , λ be a Kronecker symbol given by
δ 1 , λ = 1 ( λ = 1 ) 0 ( λ 1 ) .
Since B 0 ( x ; λ ) = 1 when λ = 1 and B 0 ( x ; λ ) = 0 when λ 1 (see, for example, [3]), by setting
B 0 ( x ; λ ) = δ 1 , λ
in (16), with the help of (17), we have
j = 0 i 1 i 1 j ( y ) i 1 j B n + j + 1 d ( y ; λ ) n + j + 1 d = j = 0 n d n d j y n d j B i + j ( λ ) i + j ( 1 ) i y n d + i δ 1 , λ ( n d ) ! · ( i 1 ) ! ( n d + i ) ! .
We find from (13) and (18) the following formula due to Bayad and Kim [15] Theorem 5 for sums of products of the Apostol-Bernoulli polynomials:
i 1 + + i d = n ( i 1 , , i d 0 ) n i 1 , , i d B i 1 ( x 1 ; λ ) B i d ( x d ; λ ) = n ! ( d 1 ) ! i = 1 d ( 1 ) i 1 s ( d , i ) j = 0 n d B i + j ( λ ) j ! · ( n d j ) ! · ( i + j ) y n d j + δ 1 , λ n ! ( d 1 ) ! i = 1 d s ( d , i ) ( i 1 ) ! ( n d + i ) ! y n d + i
( y = x 1 + + x d ; n , d N ; n d ) .
Upon changing the order of the summation on the right-hand side of (13), we get
B 0 ( x 1 ; λ ) + + B 0 ( x d ; λ ) n = n ! ( n d ) ! · ( d 1 ) ! j = 0 d 1 ( 1 ) j B n + j + 1 d ( y ; λ ) n + j + 1 d i = j + 1 d i 1 j s ( d , i ) y i 1 j = ( 1 ) d 1 n ! ( n d ) ! · ( d 1 ) ! j = 0 d 1 ( 1 ) j B n j ( y ; λ ) n j i = d 1 j d 1 i d 1 j s ( d , i + 1 ) y i ( d 1 j ) ,
which, in the special case when λ = 1 , yields the following famous formula for the Bernoulli polynomials due to Dilcher [19] Theorem 3:
i 1 + + i d = n ( i 1 , , i d 0 ) n i 1 , , i d B i 1 ( x 1 ) B i d ( x d ) = ( 1 ) d 1 n d d j = 0 d 1 ( 1 ) j i = 0 j d + i j 1 i s ( d , d + i j ) y i B n j ( y ) n j
( y = x 1 + + x d ; n , d N ; n d ) .
Let p n , m ( x ) denote a polynomial given by (see, for example [21,22])
p n , m ( x ) = ( 1 ) n m 1 ( n 1 ) ! k = m n 1 k m s ( n , k + 1 ) x k m .
Then, by applying (20) and (22), we get
i 1 + + i d = n ( i 1 , , i d 0 ) n i 1 , , i d B i 1 ( x 1 ; λ ) B i d ( x d ; λ ) = ( 1 ) d 1 n ! ( n d ) ! j = 0 d 1 p d , d 1 j ( y ) B n j ( y ; λ ) n j
( y = x 1 + + x d ; n , d N ; n d ) ,
which is a generalization of the following result given by Kim and Hu [22] Theorem 1.2 for the Apostol-Bernoulli numbers:
i 1 + + i d = n ( i 1 , , i d 0 ) n i 1 , , i d B i 1 ( λ ) B i d ( λ ) = ( 1 ) n + d + 1 n ! ( n d ) ! j = 0 d 1 p d , d 1 j ( d ) B n j 1 λ n j ( n > d ) n ! · p n , 0 ( n ) B 1 ( λ ) n ! j = 0 n 2 p n , n 1 j ( n ) B n j ( 1 λ ) n j ( n = d ) .
Theorem 3.
Let d N and let
y = x 1 + + x d .
Then, for m , n N * ( m + n d ) ,
i 1 + + i d = m ( i 1 , , i d 0 ) m i 1 , , i d G i 1 ( x 1 ; λ ) + + G i d ( x d ; λ ) n = ( 2 ) d 1 · ( m + n ) ! ( m + n d ) ! · ( d 1 ) ! i = 1 d s ( d , i ) j = 0 i 1 i 1 j ( 1 ) j y i 1 j m + n + j + 1 d G m + n + j + 1 d ( y ; λ ) .
In its special case when m = 0 , Theorem 3 immediately yields
G 0 ( x 1 ; λ ) + + G 0 ( x d ; λ ) n = ( 2 ) d 1 · n ! ( n d ) ! · ( d 1 ) ! i = 1 d s ( d , i ) j = 0 i 1 i 1 j ( 1 ) j y i 1 j n + j + 1 d G n + j + 1 d ( y ; λ )
( y = x 1 + + x d ; n , d N ; n d ) .
By a similar consideration to that for (19), we can obtain the following formula for the Apostol-Genocchi polynomials:
i 1 + + i d = n ( i 1 , , i d 0 ) n i 1 , , i d G i 1 ( x 1 ; λ ) G i d ( x d ; λ ) = ( 2 ) d 1 · n ! ( d 1 ) ! i = 1 d ( 1 ) i 1 s ( d , i ) j = 0 n d G i + j ( λ ) j ! · ( n d j ) ! · ( i + j ) y n d j
( y = x 1 + + x d ; n , d N ; n d ) .
By changing the order of the summation on the right-hand side of (23), we find that
i 1 + + i d = n ( i 1 , , i d 0 ) n i 1 , , i d G i 1 ( x 1 ; λ ) G i d ( x d , λ ) = 2 d 1 n d d j = 0 d 1 ( 1 ) j i = 0 j d + i j 1 i s ( d , d + i j ) y i G n j ( y ; λ ) n j
( y = x 1 + + x d ; n , d N ; n d ) .
Finally, upon setting λ = 1 in (24), gives a formula for sums of products of the Genocchi polynomials, which is analogous to (21).

3. Proofs of Theorems

Before giving the proofs of Theorems 1–3, we recall the following auxiliary results which will be needed in our proofs.
Lemma 1.
([23] Theorem 3.1 and Theorem 3.2) Let α , λ C and n N * . Then
n t n 1 1 λ e α t = α n k = 1 n + 1 ( 1 ) n + k 1 ( 1 λ e α t ) k ( k 1 ) ! · S ( n + 1 , k ) .
Furthermore, for n N ,
1 ( 1 λ e α t ) n = k = 1 n ( 1 ) n k ( n 1 ) ! · α k 1 k 1 t k 1 1 1 λ e α t · s ( n , k ) .
Lemma 2.
([20] Equations (2.6) and (3.11)) Let n N * . Then
e x t n t n F ( y , t ) = m = 0 k = 0 n n k ( x ) n k f m + k ( x + y ) t m m ! .
Moreover, for r N ,
e x t n t n G ( y , t ) = m = 0 k = 0 n n k ( x ) n k f m + k + r ( x + y ) m + k + 1 r + ( 1 ) n + 1 x m + n + 1 ( r 1 ) ! 0 1 t m ( 1 t ) n f r 1 ( x + y x t ) d t t m m ! ,
where
F ( y , t ) = m = 0 f m ( y ) t m m ! ,
G ( y , t ) = m = 0 f m + r ( y ) m + 1 r t m m ! ,
and the sequence { f n ( x ) } n = 0 is given as in Equation (15).
Proof of Theorem 1.
First of all, by setting α = 1 in (25), we get
1 ( λ e t 1 ) n = k = 1 n ( 1 ) k 1 ( n 1 ) ! k 1 t k 1 1 λ e t 1 · s ( n , k ) ( n N ) ,
which, for d N , yields
2 1 κ a b d · t κ d e ( x 1 + + x d ) t ( β a ) b e t 1 d = 2 1 κ a b d · i = 1 d ( 1 ) i 1 ( d 1 ) ! t κ d e y t i 1 t i 1 1 ( β a ) b e t 1 · s ( d , i ) .
Let ν N and let the function f ν ( t ) be differentiable with respect to t. If we set
f ν ( t ) = 2 1 κ t κ β b e t a b e x ν t ,
then it is clear from (5) that for l N * ,
l t l f ν ( t ) = n = 0 Y n + l , β ( x ν ; κ , a , b ) t n n ! .
By differentiating both sides of (28) m times with respect to t, with the help of the general Leibniz rule presented in [18] (pp. 130–133), we obtain
i 1 + + i d = m ( i 1 , , i d 0 ) m i 1 , , i d i 1 t i 1 f 1 ( t ) i d t i d f d ( t ) = 2 1 κ a b d i = 1 d ( 1 ) i 1 ( d 1 ) ! m t m t κ d e y t i 1 t i 1 1 ( β a ) b e t 1 · s ( d , i ) .
We now denote by [ t n ] f ( t ) the coefficient of t n in f ( t ) for n N * . Then, by making use of the operation t n n ! on both sides of (30) in conjunction with (29), we find that
i 1 + + i d = m ( i 1 , , i d 0 ) m i 1 , , i d Y i 1 , β ( x 1 ; κ , a , b ) + + Y i d , β ( x d ; κ , a , b ) n = 2 1 κ a b d 1 i = 1 d ( 1 ) i 1 ( d 1 ) ! · s ( d , i ) t n n ! m t m t κ d e y t i 1 t i 1 2 1 κ β b e t a b .
Also, by using the Leibniz rule, we have
i 1 t i 1 2 1 κ β b e t a b = i 1 t i 1 2 1 κ t κ β b e t a b · 1 t κ = j = 0 i 1 i 1 j i 1 j t i 1 j 2 1 κ t κ β b e t a b · j t j 1 t κ ( i N )
and
j t j 1 t κ = ( 1 ) j j ! · κ + j 1 j 1 t κ + j ( j N * ) .
It follows from the above two identities that
t κ d e y t i 1 t i 1 2 1 κ β b e t a b = j = 0 i 1 ( 1 ) j j ! · i 1 j e y t i 1 j t i 1 j 2 1 κ t κ β b e t a b · κ + j 1 j t ( d 1 ) κ j .
If we replace F ( y , t ) in (26) by
F ( 0 , t ) = 2 1 κ t κ β b e t a b = l = 0 Y l , β ( 0 ; κ , a , b ) t l l ! ,
we find for n N * that
e x t n t n 2 1 κ t κ β b e t a b = l = 0 ν = 0 n n ν ( x ) n ν Y l + ν , β ( x ; κ , a , b ) t l l ! .
Thus, by applying (33) to (32), we obtain
t κ d e y t i 1 t i 1 2 1 κ β b e t a b = l = 0 j = 0 i 1 ν = 0 i 1 j j ! · i 1 j i 1 j ν κ + j 1 j · ( 1 ) i 1 ν y i 1 j ν Y l + ν , β ( y ; κ , a , b ) t ( d 1 ) κ + l j l ! ,
which readily yields
m t m t κ d e y t i 1 t i 1 2 1 κ β b e t a b = m ! · l = 0 j = 0 i 1 ν = 0 i 1 j ( 1 ) i 1 ν j ! · i 1 j i 1 j ν κ + j 1 j ( d 1 ) κ + l j m · y i 1 j ν Y l + ν , β ( y ; κ , a , b ) t ( d 1 ) κ + l m j l ! ,
that is, for n N * ,
t n n ! m t m t κ d e y t i 1 t i 1 2 1 κ β b e t a b = ( m + n ) ! · j = 0 i 1 ν = 0 i 1 j ( 1 ) i 1 ν j ! · i 1 j i 1 j ν κ + j 1 j · y i 1 j ν Y m + n + j + ν ( d 1 ) κ , β ( y ; κ , a , b ) ( m + n + j ( d 1 ) κ ) ! .
Finally, Theorem 1 would follow by applying (34) to (31). □
Proof of Theorem 2.
It is easily seen from (11) and (31) that, for d N and m , n N * ,
i 1 + + i d = m ( i 1 , , i d 0 ) m i 1 , , i d [ B i 1 ( x 1 ; λ ) + + B i d ( x d ; λ ) ] n = i = 1 d ( 1 ) i 1 ( d 1 ) ! t n n ! m t m t d e y t i 1 t i 1 1 λ e t 1 · s ( d , i ) .
Since B 0 ( x ; λ ) = 1 when λ = 1 and B 0 ( x ; λ ) = 0 when λ 1 , by setting
B 0 ( x ; λ ) = δ 1 , λ ,
we get
1 λ e t 1 δ 1 , λ t = l = 0 B l + 1 ( 0 ; λ ) t l ( l + 1 ) ! ,
where δ 1 , λ is the Kronecker symbol. Hence, by putting r = 1 and replacing G ( y , t ) in (27) by
G ( 0 , t ) = 1 λ e t 1 δ 1 , λ t = l = 0 B l + 1 ( 0 ; λ ) t l ( l + 1 ) ! ,
and making use of (17), we find for n N * that
e x t n t n ( 1 λ e t 1 δ 1 , λ t ) = l = 0 ν = 0 n n ν ( x ) n ν B l + ν + 1 ( x ; λ ) l + ν + 1 + ( 1 ) n + 1 δ 1 , λ n ! · l ! ( n + l + 1 ) ! x n + l + 1 t l l ! ,
which, together with the exponential series for e x t , yields
e x t n t n 1 λ e t 1 = l = 0 ν = 0 n n ν ( x ) n ν B l + ν + 1 ( x ; λ ) l + ν + 1 t l l ! + ( 1 ) n n ! · δ 1 , λ l = 0 n x l t l n 1 l ! .
It follows from (36) that
t d e y t i 1 t i 1 1 λ e t 1 = l = 0 ν = 0 i 1 i 1 ν ( y ) i 1 ν B l + ν + 1 ( y ; λ ) l + ν + 1 t d + l l ! + ( 1 ) i 1 ( i 1 ) ! · δ 1 , λ l = 0 i 1 y l l ! t d + l i ( d , i N ) .
If we now partially differentiate both sides of (37) m times with respect to t, then
m t m t d e y t i 1 t i 1 1 λ e t 1 = m ! · l = 0 d + l m ν = 0 i 1 i 1 ν ( y ) i 1 ν B l + ν + 1 ( y ; λ ) l + ν + 1 t d + l m l ! + ( 1 ) i 1 ( i 1 ) ! · m ! · δ 1 , λ l = 0 i 1 d + l i m y l l ! t d + l i m ,
which, for m , n N * ( m + n d ) , yields
t n n ! m t m t d e y t i 1 t i 1 1 λ e t 1 = ( m + n ) ! ( m + n d ) ! ν = 0 i 1 i 1 ν ( y ) i 1 ν B m + n + ν + 1 d ( y ; λ ) m + n + ν + 1 d .
By applying (38) to (35), we are led to Theorem 2. □
Proof of Theorem 3.
From (11) and (31), we find for d N and m , n N * that
i 1 + + i d = m ( i 1 , , i d 0 ) m i 1 , , i d G i 1 ( x 1 ; λ ) + + G i d ( x d ; λ ) n = ( 2 ) d 1 · i = 1 d ( 1 ) i 1 ( d 1 ) ! t n n ! m t m t d e y t i 1 t i 1 2 λ e t + 1 · s ( d , i ) .
Since (see, for example, [2])
G 0 ( x ; λ ) = 0 ,
by applying (3) we have
2 λ e t + 1 = n = 0 G n + 1 ( 0 ; λ ) t n ( n + 1 ) ! .
Hence, by setting r = 1 and taking
G ( 0 , t ) = 2 λ e t + 1
in (27), we find for n N that
e x t n t n 2 λ e t + 1 = l = 0 ν = 0 n n ν ( x ) n ν G l + ν + 1 ( x ; λ ) l + ν + 1 t l l ! .
It follows from (40) that
t d e y t i 1 t i 1 2 λ e t + 1 = l = 0 ν = 0 i 1 i 1 ν ( y ) i 1 ν G l + ν + 1 ( y ; λ ) l + ν + 1 t d + l l ! ,
which implies, for m N * and i , d N , that
m t m t d e y t i 1 t i 1 2 λ e t + 1 = m ! · l = 0 d + l m ν = 0 i 1 i 1 ν ( y ) i 1 ν G l + ν + 1 ( y ; λ ) l + ν + 1 t d + l m l ! .
By making use of (41), we find for m , n N * and i , d N that
t n n ! m t m t d e y t i 1 t i 1 1 λ e t + 1 = ( m + n ) ! ( m + n d ) ! ν = 0 i 1 i 1 ν ( y ) i 1 ν G m + n + ν + 1 d ( y ; λ ) m + n + ν + 1 d .
Finally, by applying (42) to (39), we conclude the proof of Theorem 3. □

4. Conclusions and Observation

In the paper, we have given a systematic and unified investigation for the Apostol-Bernoulli polynomials, the Apostol-Euler polynomials and the Apostol-Genocchi polynomials. By applying the generating-function methods and summation-transform techniques, we have established some higher-order convolutions for the Apostol-Bernoulli polynomials, the Apostol-Euler polynomials and the Apostol-Genocchi polynomials.
The methods shown in this paper may be applied to other families of special polynomials. In a similar way, some results may be obtained.

Author Contributions

All authors contributed equally.

Funding

Dr. Serkan Araci was supported by the Research Fund of Hasan Kalyoncu University in 2018.

Conflicts of Interest

The authors declare no conflict of interest.

References

  1. He, Y.; Kim, T. General convolution identities for Apostol-Bernoulli, Euler and Genocchi polynomials. J. Nonlinear Sci. Appl. 2016, 9, 4780–4797. [Google Scholar] [Green Version]
  2. Luo, Q.-M. Extension for the Genocchi polynomials and its Fourier expansions and integral representations. Osaka J. Math. 2011, 48, 291–309. [Google Scholar]
  3. Luo, Q.-M.; Srivastava, H.M. Some generalizations of the Apostol-Bernoulli and Apostol-Euler polynomials. J. Math. Anal. Appl. 2005, 308, 290–302. [Google Scholar] [CrossRef]
  4. Luo, Q.-M.; Srivastava, H.M. Some relationships between the Apostol-Bernoulli and Apostol-Euler polynomials. Comput. Math. Appl. 2006, 51, 631–642. [Google Scholar] [CrossRef]
  5. Özarslan, M.A. Unified Apostol-Bernoulli, Euler and Genocchi polynomials. Comput. Math. Appl. 2011, 62, 2452–2462. [Google Scholar] [CrossRef]
  6. Ozden, H. Unification of generating function of the Bernoulli, Euler and Genocchi numbers and polynomials. AIP Conf. Proc. 2010, 1281, 1125–1128. [Google Scholar]
  7. Ozden, H.; Simsek, Y.; Srivastava, H.M. A unified presentation of the generating functions of the generalized Bernoulli, Euler and Genocchi polynomials. Comput. Math. Appl. 2010, 60, 2779–2787. [Google Scholar] [CrossRef] [Green Version]
  8. Lu, D.-Q.; Srivastava, H.M. Some series identities involving the generalized Apostol type and related polynomials. Comput. Math. Appl. 2011, 62, 3591–3602. [Google Scholar] [CrossRef]
  9. Luo, Q.-M. Elliptic extensions of the Apostol-Bernoulli and Apostol-Euler polynomials. Appl. Math. Comput. 2015, 261, 156–166. [Google Scholar] [CrossRef]
  10. Bayad, A.; Navas, L. Möbius inversion formulas related to the Fourier expansions of two-dimensional Apostol-Bernoulli polynomials. J. Number Theory 2016, 163, 457–473. [Google Scholar] [CrossRef]
  11. Luo, Q.-M.; Srivastava, H.M. Some generalization of the Apostol-Genocchi polynomials and the Stirling numbers of the second kind. Appl. Math. Comput. 2011, 217, 5702–5728. [Google Scholar] [CrossRef]
  12. Navas, L.M.; Ruiz, F.J.; Varona, J.L. Asymptotic estimates for Apostol-Bernoulli and Apostol-Euler polynomials. Math. Comput. 2011, 81, 1707–1722. [Google Scholar] [CrossRef]
  13. Ozden, H.; Simsek, Y. Modification and unification of the Apostol-type numbers and polynomials and their applications. Appl. Math. Comput. 2014, 235, 338–351. [Google Scholar] [CrossRef]
  14. Agoh, T.; Dilcher, K. Higher-order recurrences for Bernoulli numbers. J. Number Theory 2009, 129, 1837–1847. [Google Scholar] [CrossRef] [Green Version]
  15. Bayad, A.; Kim, T. Higher recurrences for Apostol-Bernoulli-Euler numbers. Russian J. Math. Phys. 2012, 19, 1–10. [Google Scholar] [CrossRef]
  16. Bayad, A.; Komatsu, T. Zeta functions interpolating the convolution of the Bernoulli polynomials. Integral Transforms Spec. Funct. 2018, 29, 611–622. [Google Scholar] [CrossRef] [Green Version]
  17. He, Y.; Kim, T. A higher-order convolution for Bernoulli polynomials of the second kind. Appl. Math. Comput. 2018, 324, 51–58. [Google Scholar] [CrossRef]
  18. Comtet, L. Advanced Combinatorics: The Art of Finite and Infinite Expansions; D. Reidel Publishing Company: Dordrecht, The Netherlands, 1974. [Google Scholar]
  19. Dilcher, K. Sums of products of Bernoulli numbers. J. Number. Theory 1996, 60, 23–41. [Google Scholar] [CrossRef]
  20. He, Y.; Zhang, W.-P. Some symmetric identities involving a sequence of polynomials. Electron. J. Combin. 2010, 17, 1–7. [Google Scholar]
  21. Kim, M.-S. A note on sums of products of Bernoulli numbers. Appl. Math. Lett. 2011, 24, 55–61. [Google Scholar] [CrossRef]
  22. Kim, M.-S.; Hu, S. Sums of products of Apostol-Bernoulli numbers. Ramanujan J. 2012, 28, 113–123. [Google Scholar] [CrossRef]
  23. Xu, A.-M.; Cen, Z.-D. Some identities involving exponential functions and Stirling numbers and applications. J. Comput. Appl. Math. 2014, 260, 201–207. [Google Scholar] [CrossRef]

Share and Cite

MDPI and ACS Style

He, Y.; Araci, S.; Srivastava, H.M.; Abdel-Aty, M. Higher-Order Convolutions for Apostol-Bernoulli, Apostol-Euler and Apostol-Genocchi Polynomials. Mathematics 2018, 6, 329. https://0-doi-org.brum.beds.ac.uk/10.3390/math6120329

AMA Style

He Y, Araci S, Srivastava HM, Abdel-Aty M. Higher-Order Convolutions for Apostol-Bernoulli, Apostol-Euler and Apostol-Genocchi Polynomials. Mathematics. 2018; 6(12):329. https://0-doi-org.brum.beds.ac.uk/10.3390/math6120329

Chicago/Turabian Style

He, Yuan, Serkan Araci, Hari M. Srivastava, and Mahmoud Abdel-Aty. 2018. "Higher-Order Convolutions for Apostol-Bernoulli, Apostol-Euler and Apostol-Genocchi Polynomials" Mathematics 6, no. 12: 329. https://0-doi-org.brum.beds.ac.uk/10.3390/math6120329

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop