Skip to main content

Advertisement

New recurrence formulae for the Apostol-Bernoulli and Apostol-Euler polynomials

Article metrics

Abstract

The main purpose of this paper is by using the generating function methods and some combinatorial techniques to establish some new recurrence formulae for the Apostol-Bernoulli and Apostol-Euler polynomials. It turns out that some known results in (He and Wang in Adv. Differ. Equ. 2012:209, 2012) are obtained as special cases.

MSC:11B68, 05A19.

1 Introduction

The classical Bernoulli polynomials B n (x) and Euler polynomials E n (x) are usually defined by means of the following generating functions

t e x t e t 1 = n = 0 B n (x) t n n ! ( | t | < 2 π )
(1.1)

and

2 e x t e t + 1 = n = 0 E n (x) t n n ! ( | t | < π ) .
(1.2)

In particular, the rational numbers B n = B n (0) and integers E n = 2 n E n (1/2) are called the classical Bernoulli numbers and Euler numbers, respectively. These polynomials and numbers play important roles in various branches of mathematics including number theory, combinatorics, special functions and analysis, and there exist numerous interesting properties for them, see, for example, [13].

In 2007, Agoh and Dilcher [4] made use of some connections between the classical Bernoulli numbers and the Stirling numbers of the second kind to establish a quadratic recurrence formula on the classical Bernoulli numbers, which was generalized to the classical Bernoulli polynomials by He and Zhang [5]. More recently, He and Wang [6] extended the Agoh and Dilcher’s quadratic recurrence formula on the classical Bernoulli numbers to the Apostol-Bernoulli and Apostol-Euler polynomials. As further applications, they derived some corresponding results related to some formulae of products of the classical Bernoulli and Euler polynomials and numbers stated in Nielsen’s book [1].

We begin by recalling now the Apostol-Bernoulli polynomials B n ( α ) (x;λ) and Apostol-Euler polynomials E n ( α ) (x;λ) of (real or complex) higher order α, which were introduced by Luo and Srivastava [7, 8]

( t λ e t 1 ) α e x t = n = 0 B n ( α ) (x;λ) t n n ! ( | t + log λ | < 2 π ; 1 α : = 1 )
(1.3)

and

( 2 λ e t + 1 ) α e x t = n = 0 E n ( α ) (x;λ) t n n ! ( | t + log λ | < π ; 1 α : = 1 ) .
(1.4)

Especially, the case α=1 in (1.3) and (1.4) is called the Apostol-Bernoulli polynomials B n (x;λ) and Apostol-Euler polynomials E n (x;λ), respectively. Moreover, we call B n (λ)= B n (0;λ) the Apostol-Bernoulli numbers and E n (λ)= 2 n E n (1/2;λ) the Apostol-Euler numbers. It is worth of mentioning that the Apostol-Bernoulli polynomials were introduced by Apostol [9] (see also Srivastava [10] for a systematic study) in order to evaluate the value of the Hurwitz-Lerch zeta function. For more results on these polynomials and numbers, one is referred to [1116].

In this paper, we only consider the Apostol-Bernoulli polynomials B n (x;λ) and Apostol-Euler polynomials E n (x;λ). By applying the generating function methods and some combinatorial techniques, developed in [6, 17], we establish some new recurrence formulae for the Apostol-Bernoulli and Apostol-Euler polynomials, by virtue of which, some known results including the ones presented in [6], are obtained as special cases.

2 Recurrence formulae for Apostol-Bernoulli polynomials

In what follows, we shall always denote by δ 1 , λ the Kronecker symbol given by δ 1 , λ =0 or 1, according to λ1 or λ=1, and we also denote by β n (x;λ)= B n + 1 (x;λ)/(n+1) for any non-negative integer n. We first state the following.

Theorem 2.1 Let k, m, n be any non-negative integers. Then

j = 0 k ( k j ) i = 0 n ( n i ) β i + j ( x ; μ ) β k + m + n i j ( y ; λ μ ) = i = 0 m ( m i ) ( 1 ) m i β m i ( x ; 1 λ ) β k + n + i ( x + y ; λ μ ) + β m ( y ; λ ) β k + n ( x + y ; μ ) δ 1 , λ β k + m + n + 1 ( x + y ; λ μ ) m + 1 δ 1 , μ β k + m + n + 1 ( y ; λ μ ) k + n + 1 δ 1 , λ μ ( 1 ) m m ! ( k + n ) ! ( k + m + n + 1 ) ! β k + m + n + 1 ( x ; 1 λ ) .
(2.1)

Proof Multiplying both sides of the identity

1 λ e u 1 1 μ e v 1 = ( λ e u λ e u 1 + 1 μ e v 1 ) 1 λ μ e u + v 1
(2.2)

by e x v + y ( u + v ) yields

e x v μ e v 1 e y ( u + v ) λ μ e u + v 1 = e y u λ e u 1 e ( x + y ) v μ e v 1 λ e ( 1 x ) u λ e u 1 e ( x + y ) ( u + v ) λ μ e u + v 1 .
(2.3)

Since B 0 (x;λ)=1 when λ=1 and B 0 (x;λ)=0 when λ1 (see, e.g., [7]), then by setting B 0 (x;λ)= δ 1 , λ , we get

e x u λ e u 1 δ 1 ; λ u = m = 0 β m (x;λ) u m m ! .
(2.4)

More generally, the Taylor theorem gives

e x ( u + v ) λ e u + v 1 δ 1 ; λ u + v = n = 0 n u n ( e x u λ e u 1 δ 1 ; λ u ) v n n ! = m = 0 n = 0 β m + n ( x ; λ ) u m m ! v n n ! .
(2.5)

Hence, applying (2.4) and (2.5) to (2.3), we get

( n = 0 β n ( x ; μ ) v n n ! + δ 1 , μ v ) ( m = 0 n = 0 β m + n ( y ; λ μ ) u m m ! v n n ! + δ 1 , λ μ u + v ) = ( m = 0 β m ( y ; λ ) u m m ! + δ 1 , μ u ) ( n = 0 β n ( x + y ; μ ) v n n ! + δ 1 , μ v ) λ ( m = 0 β m ( 1 x ; λ ) u m m ! + δ 1 , λ u ) × ( m = 0 n = 0 β m + n ( x + y ; λ μ ) u m m ! v n n ! + δ 1 , λ μ u + v ) .
(2.6)

Obverse that

m = 0 n = 0 β m + n ( x ; λ ) u m 1 m ! v n n ! = m = 0 n = 0 β m + n + 1 ( x ; λ ) m + 1 u m m ! v n n ! + 1 u n = 0 β n ( x ; λ ) v n n !
(2.7)

and

m = 0 n = 0 β m + n ( x ; λ ) u m m ! v n 1 n ! = m = 0 n = 0 β m + n + 1 ( x ; λ ) n + 1 u m m ! v n n ! + 1 v m = 0 β m ( x ; λ ) u m m ! .
(2.8)

It follows from (2.6)-(2.8) that

( n = 0 β n ( x ; μ ) v n n ! ) ( m = 0 n = 0 β m + n ( y , λ μ ) u m m ! v n n ! ) = ( m = 0 ( 1 ) m β m ( x ; 1 λ ) u m m ! ) ( m = 0 n = 0 β m + n ( x + y ; λ μ ) u m m ! v n n ! ) + m = 0 n = 0 { β m ( y , λ ) β n ( x + y ; μ ) δ 1 , μ β m + n + 1 ( y , λ μ ) n + 1 δ 1 , λ β m + n + 1 ( x + y , λ μ ) m + 1 } u m m ! v n n ! + M ,
(2.9)

where M is denoted by

M = δ 1 , μ v m = 0 β m ( y ; λ ) u m m ! + δ 1 , λ u n = 0 β n ( x + y ; μ ) v n n ! + δ 1 , λ δ 1 , μ u v δ 1 , μ v m = 0 β m ( y ; λ μ ) u m m ! δ 1 , λ μ u + v n = 0 β n ( x ; μ ) v n n ! δ 1 , μ δ 1 , λ μ v ( u + v ) λ δ 1 , λ μ u + v m = 0 β m ( 1 x ; λ ) u m m ! δ 1 , λ u n = 0 β n ( x + y ; λ μ ) v n n ! δ 1 , λ δ 1 , λ μ u ( u + v ) .
(2.10)

In view of (2.4), we have

M = δ 1 , μ v ( e y u λ e u 1 δ 1 , λ u ) + δ 1 , λ u ( e ( x + y ) v μ e v 1 δ 1 , μ v ) + δ 1 , λ δ 1 , μ u v δ 1 , μ v ( e y u λ μ e u 1 δ 1 , λ μ u ) δ 1 , λ μ u + v ( e x v μ e v 1 δ 1 , μ v ) δ 1 , μ δ 1 , λ μ v ( u + v ) λ δ 1 , λ μ u + v ( e ( 1 x ) u λ e u 1 δ 1 , λ u ) δ 1 , λ u ( e ( x + y ) v λ μ e v 1 δ 1 , λ μ v ) δ 1 , λ δ 1 , λ μ u ( u + v ) = δ 1 , λ μ u + v ( λ e ( 1 x ) u λ e u 1 δ 1 , λ u + e x v 1 λ e v 1 δ 1 , 1 λ v ) .
(2.11)

If applying u n = k = 0 n ( n k ) ( u + v ) k ( v ) n k to (2.4), in view of changing the order of the summation, we obtain

e ( 1 x ) u λ e u 1 δ 1 , λ u = k = 0 n = k β n ( 1 x ; λ ) n ! ( n k ) ( u + v ) k ( v ) n k = k = 0 n = k + 1 β n ( 1 x ; λ ) n ! ( n k + 1 ) ( u + v ) k + 1 ( v ) n ( k + 1 ) + n = 0 β n ( 1 x ; λ ) ( v ) n n ! .
(2.12)

So from (2.4), (2.11), (2.12) and the symmetric distributions for the Apostol-Bernoulli polynomials λ B n (1x;λ)= ( 1 ) n B n (x; 1 λ ), n0 (see, e.g., [7]), we get

M= δ 1 , λ μ k = 0 n = k + 1 ( 1 ) k β n ( x ; 1 λ ) n ! ( n k + 1 ) ( u + v ) k v n ( k + 1 ) .
(2.13)

Since ( u + v ) k = m = 0 k ( k m ) u m v k m for non-negative integer k, then the identity above can be rewritten as

M= δ 1 , λ μ m = 0 k = m n = k + 1 ( 1 ) k β n ( x ; 1 λ ) n ! ( n k + 1 ) ( k m ) u m v n m 1 .
(2.14)

It follows from (2.14) that

M = δ 1 , λ μ m = 0 n = m + 1 ( 1 ) m β n ( x ; 1 λ ) n ! u m v n m 1 = δ 1 , λ μ m = 0 n = 0 ( 1 ) m m ! n ! β m + n + 1 ( x ; 1 λ ) ( m + n + 1 ) ! u m m ! v n n ! .
(2.15)

Thus, combining (2.9) and (2.15), and then making k-times derivative with respect to v, we get

j = 0 k ( k j ) ( n = 0 β n + j ( x ; μ ) v n n ! ) ( m = 0 n = 0 β m + n + k j ( y , λ μ ) u m m ! v n n ! ) = ( m = 0 ( 1 ) m β m ( x ; 1 λ ) u m m ! ) ( m = 0 n = 0 β k + m + n ( x + y ; λ μ ) u m m ! v n n ! ) + m = 0 n = 0 { β m ( y , λ ) β k + n ( x + y ; μ ) δ 1 , μ β k + m + n + 1 ( y , λ μ ) k + n + 1 δ 1 , λ β k + m + n + 1 ( x + y , λ μ ) m + 1 δ 1 , λ μ ( 1 ) m m ! ( k + n ) ! β k + m + n + 1 ( x ; 1 λ ) ( k + m + n + 1 ) ! } u m m ! v n n ! ,
(2.16)

which together with the Cauchy product arises the desired result after comparing the coefficients of u m v n /m!n!. □

It follows that we show a special case of Theorem 2.1. We have the following formula of products of the Apostol-Bernoulli polynomial due to He and Wang [17].

Corollary 2.2 Let m, n be any positive integers. Then

B m ( x ; λ ) B n ( y ; μ ) = n i = 0 m ( m i ) ( 1 ) m i B m i ( y x ; 1 λ ) B n + i ( y ; λ μ ) n + i + m i = 0 n ( n i ) B n i ( y x ; μ ) B m + i ( x ; λ μ ) m + i + ( 1 ) m + 1 δ 1 , λ μ m ! n ! ( m + n ) ! B m + n ( y x ; 1 λ ) .
(2.17)

Proof Setting k=0 in Theorem 2.1, we get

i = 0 n ( n i ) B n + 1 i ( x ; μ ) n + 1 i B m + 1 + i ( y ; λ μ ) m + 1 + i = i = 0 m ( m i ) ( 1 ) m i B m + 1 i ( x ; 1 λ ) m + 1 i B n + 1 + i ( x + y ; λ μ ) n + 1 + i + B m + 1 ( y ; λ ) m + 1 B n + 1 ( x + y ; μ ) n + 1 δ 1 , λ B m + n + 2 ( x + y ; λ μ ) ( m + 1 ) ( m + n + 2 ) δ 1 , μ B m + n + 2 ( y ; λ μ ) ( n + 1 ) ( m + n + 2 ) δ 1 , λ μ ( 1 ) m m ! n ! ( m + n + 2 ) ! B m + n + 2 ( x ; 1 λ ) .
(2.18)

Note that for any negative integers i, n,

1 n + 1 i ( n i ) = 1 n + 1 ( n + 1 i ) .
(2.19)

It follows from (2.18) and (2.19) that

1 n + 1 i = 0 n + 1 ( n + 1 i ) B n + 1 i ( x ; μ ) B m + 1 + i ( y ; λ μ ) m + 1 + i = 1 m + 1 i = 0 m + 1 ( m + 1 i ) ( 1 ) m + 1 i B m + 1 i ( x ; 1 λ ) B n + 1 + i ( x + y ; λ μ ) n + 1 + i + B m + 1 ( y ; λ ) m + 1 B n + 1 ( x + y ; μ ) n + 1 δ 1 , λ μ ( 1 ) m m ! n ! ( m + n + 2 ) ! B m + n + 2 ( x ; 1 λ ) .
(2.20)

Thus, replacing x by yx and y by x in (2.20) gives the desired result. □

We now use Theorem 2.1 to give another new recurrence formula for the Apostol-Bernoulli polynomials.

Theorem 2.3 Let k, m, n be any non-negative integers. Then for x+y+z=1,

( 1 ) k i = 0 k ( k i ) β m + i ( x ; μ ) β k + n i ( y ; λ μ ) + ( 1 ) m μ i = 0 m ( m i ) β n + i ( y ; λ ) β k + m i ( z ; 1 μ ) + ( 1 ) n λ μ i = 0 n ( n i ) β k + i ( z ; 1 λ μ ) β m + n i ( x ; 1 λ ) = { δ 1 , λ μ ( 1 ) k + n k ! n ! ( k + n + 1 ) ! β k + m + n + 1 ( x ; 1 λ ) + δ 1 , μ ( 1 ) k + m k ! m ! ( k + m + 1 ) ! β k + m + n + 1 ( y ; λ μ ) + δ 1 , λ λ μ ( 1 ) m + n m ! n ! ( m + n + 1 ) ! β k + m + n + 1 ( z ; 1 λ μ ) } .
(2.21)

Proof We firstly prove that for any non-negative integers k, m, n,

i = 0 n ( n i ) β k + i ( x ; μ ) β m + n i ( y ; λ μ ) = i = 0 k ( k i ) ( 1 ) k i β n + i ( x + y ; μ ) β k + m i ( y ; λ ) + i = 0 m ( m i ) ( 1 ) m i β n + i ( x + y ; λ μ ) β k + m i ( x ; 1 λ ) δ 1 , λ k ! m ! ( k + m + 1 ) ! β k + m + n + 1 ( x + y ; λ μ ) δ 1 , μ ( 1 ) k k ! n ! ( k + n + 1 ) ! β k + m + n + 1 ( y ; λ μ ) δ 1 , λ μ ( 1 ) m m ! n ! ( m + n + 1 ) ! β k + m + n + 1 ( x ; 1 λ ) .
(2.22)

We shall use induction on k. Clearly, (2.22) holds trivially when k=0 in Theorem 2.1. Now assume (2.22) for any smaller value of k. In light of (2.1), we have

i = 0 n ( n i ) β k + i ( x ; μ ) β m + n i ( y ; λ μ ) = i = 0 k + m ( m i k ) ( 1 ) k + m i β n + i ( x + y ) β k + m i ( x ; 1 λ ) + β m ( y ; λ ) β n + k ( x + y ; μ ) j = 0 k 1 ( k j ) i = 0 n ( n i ) β k + m + n i j ( y ; λ μ ) β i + j ( x ; μ ) δ 1 , λ β k + m + n + 1 ( x + y ; λ μ ) m + 1 δ 1 , μ β k + m + n + 1 ( y ; λ μ ) k + n + 1 δ 1 , λ μ ( 1 ) m m ! ( k + n ) ! ( k + m + n + 1 ) ! β k + m + n + 1 ( x ; 1 λ ) .
(2.23)

Since (2.22) holds for any smaller value of k then

j = 0 k 1 ( k j ) i = 0 n ( n i ) β i + j ( x ; μ ) β k + m + n i j ( y ; λ μ ) = i = 0 k + m ( 1 ) i β n + i ( x + y ; μ ) β k + m i ( y ; λ ) j = 0 k 1 ( 1 ) j ( k j ) ( j i ) + i = 0 k + m ( 1 ) k + m i β n + i ( x + y ; λ μ ) β k + m i ( x ; 1 λ ) j = 0 k 1 ( 1 ) j ( k j ) ( k + m j i ) δ 1 , λ β k + m + n + 1 ( x + y ; λ μ ) k + m + 1 j = 0 k 1 ( k j ) ( k + m j ) δ 1 , μ β k + m + n + 1 ( y ; λ μ ) n + 1 j = 0 k 1 ( 1 ) j ( k j ) ( n + 1 + j n + 1 ) δ 1 , λ μ ( 1 ) k + m β k + m + n + 1 ( x ; 1 λ ) n + 1 j = 0 k 1 ( 1 ) j ( k j ) ( k + m + n + 1 j n + 1 ) .
(2.24)

Note that for non-negative integers i, k, m, n,

j = 0 k ( 1 ) j ( k j ) ( m + j i ) = ( 1 ) k ( m i k ) ,
(2.25)
j = 0 k ( k j ) ( m + k j ) = k + m + 1 m + 1 ,
(2.26)
j = 0 k ( 1 ) j ( k j ) ( m + n + j + 1 n + 1 ) = m ! ( n + k ) ! ( n + 1 ) ( k + m + n + 1 ) !
(2.27)

by using induction on k. It follows from (2.25)-(2.27) that

j = 0 k 1 ( 1 ) j ( k j ) ( j i ) = ( 1 ) k ( 0 i k ) ( 1 ) k ( k i ) ,
(2.28)
j = 0 k 1 ( 1 ) j ( k j ) ( m + k j i ) = ( m i k ) ( 1 ) k ( m i ) ,
(2.29)
1 k + m + 1 j = 0 k 1 ( k j ) ( m + k j ) = 1 m + 1 k ! m ! ( k + m + 1 ) ! ,
(2.30)
1 n + 1 j = 0 k 1 ( 1 ) j ( k j ) ( n + j + 1 n + 1 ) = 1 k + n + 1 ( 1 ) k k ! n ! ( k + n + 1 ) ! ,
(2.31)
1 n + 1 j = 0 k 1 ( 1 ) j ( k j ) ( m + n + k + 1 j n + 1 ) = ( 1 ) k m ! ( n + k ) ! ( k + m + n + 1 ) ! ( 1 ) k m ! n ! ( m + n + 1 ) ! .
(2.32)

Hence, applying the five identities (2.28)-(2.32) above to (2.24), and then combining (2.23), gives (2.22). Thus, by setting x+y+z=1 in (2.22), and using the symmetric distributions of the Apostol-Bernoulli polynomials, we complete the proof of Theorem 2.3 by replacing n by k, k by m and m by n. □

We now give a special case of Theorem 2.3. We have the following quadratic recurrence formula for the Apostol-Bernoulli polynomials, presented in [6].

Corollary 2.4 Let k, m, n be any non-negative integers. Then

i = 0 n ( n i ) B k + i ( x ; μ ) B m + n i ( y ; λ μ ) = i = 0 k + m ( 1 ) k + i { n ( k i ) m ( k i 1 ) } B n 1 + i ( x + y ; μ ) B k + m + 1 i ( y ; λ ) k + m + 1 i + i = 0 k + m ( 1 ) m + i { n ( m i ) k ( m i 1 ) } B n 1 + i ( x + y ; λ μ ) B k + m + 1 i ( x ; 1 λ ) k + m + 1 i δ 1 , λ k ! m ! ( n + δ ( k , m ) ( k + m + 1 ) ) ( k + m + 1 ) ! B k + m + n ( x + y ; λ μ ) ,
(2.33)

where δ(k,m)=1 when k=m=0, δ(k,m)=0 when k=0, m1 or m=0, k1, and δ(k,m)=1, otherwise.

Proof Since the Apostol-Bernoulli polynomials B n (x;λ) satisfy the difference equation /x( B n (x;λ))=n B n 1 (x;λ) for any positive integer n (see, e.g., [7]), so by substituting n for k, k for m and m for n and making the derivative operation /x/y in both sides of Theorem 2.3, and then using the symmetric distributions of the Apostol-Bernoulli polynomials, the desired result follows immediately. □

Remark 2.5 In fact, we can also use Theorem 2.3 to obtain the above formula of products of the Apostol-Bernoulli polynomials. For example, setting m=0 and substituting yx for x, x for y, n for k and m for n in Theorem 2.3, with the help of the symmetric distributions of the Apostol-Bernoulli polynomials, Corollary 2.2 follows immediately. For some applications of Corollaries 2.2 and 2.4, the interested readers may consult [6, 17, 18].

3 Recurrence formulae for mixed Apostol-Bernoulli and Apostol-Euler polynomials

We next give a similar formula to Theorem 2.3, which is involving the mixed Apostol-Bernoulli and Apostol-Euler polynomials. As in the proof of Theorem 2.3, we need the following formula concerning the mixed Apostol-Bernoulli and Apostol-Euler polynomials.

Theorem 3.1 Let k, m, n be any non-negative integers. Then

j = 0 k ( k j ) i = 0 n ( n i ) E i + j ( x ; μ ) β k + m + n i j ( y ; λ μ ) = i = 0 m ( m i ) ( 1 ) m i E m i ( x ; 1 λ ) β k + n + i ( x + y ; λ μ ) 1 2 E m ( y ; λ ) E k + n ( x + y ; μ ) δ 1 , λ μ ( 1 ) m m ! ( k + n ) ! ( k + m + n + 1 ) ! E k + m + n + 1 ( x ; 1 λ ) .
(3.1)

Proof Multiplying both sides of the identity

1 λ e u + 1 1 μ e v + 1 = ( λ e u λ e u + 1 1 μ e v + 1 ) 1 λ μ e u + v 1
(3.2)

by 2 e x v + y ( u + v ) yields

2 e x v μ e v + 1 e y ( u + v ) λ μ e u + v 1 =λ 2 e ( 1 x ) u λ e u + 1 e ( x + y ) ( u + v ) λ μ e u + v 1 1 2 2 e y u λ e u + 1 2 e ( x + y ) v μ e v + 1 ,
(3.3)

which means

2 e x v μ e v + 1 ( e y ( u + v ) λ μ e u + v 1 δ 1 , λ μ u + v ) = λ 2 e ( 1 x ) u λ e u + 1 ( e ( x + y ) ( u + v ) λ μ e u + v 1 δ 1 , λ μ u + v ) 1 2 2 e y u λ e u + 1 2 e ( x + y ) v μ e v + 1 + δ 1 , λ μ u + v ( λ 2 e ( 1 x ) u λ e u + 1 2 e x v μ e u + 1 ) .
(3.4)

In a similar consideration to (2.12), we have

λ ( 2 e ( 1 x ) u λ e u + 1 ) = λ k = 0 n = k E n ( 1 x ; λ ) n ! ( n k ) ( u + v ) k ( v ) n k = λ k = 0 n = k + 1 E n ( 1 x ; λ ) n ! ( n k + 1 ) ( u + v ) k + 1 ( v ) n ( k + 1 ) + λ n = 0 E n ( 1 x ; λ ) ( v ) n n ! .
(3.5)

So from the symmetric distributions for the Apostol-Euler polynomials λ E n (1x;λ)= ( 1 ) n E n (x; 1 λ ), n0 (see, e.g., [7]), we get

δ 1 , λ μ u + v ( λ 2 e ( 1 x ) u λ e u + 1 2 e x v μ e u + 1 ) = δ 1 , λ μ k = 0 n = k + 1 ( 1 ) k + 1 E n ( x ; 1 λ ) n ! ( n k + 1 ) ( u + v ) k v n ( k + 1 ) = δ 1 , λ μ m = 0 k = m n = k + 1 ( 1 ) k + 1 E n ( x ; 1 λ ) n ! ( n k + 1 ) ( k m ) u m v n m 1 = δ 1 , λ μ m = 0 n = m + 1 ( 1 ) m + 1 E n ( x ; 1 λ ) n ! u m v n m 1 = δ 1 , λ μ m = 0 n = 0 ( 1 ) m + 1 m ! n ! E m + n + 1 ( x ; 1 λ ) ( m + n + 1 ) ! u m m ! v n n ! .
(3.6)

Applying (2.5) and (3.6) to (3.4), and then making k-times derivative with respect to v, we obtain

j = 0 k ( k j ) ( n = 0 E n + j ( x ; μ ) v n n ! ) ( m = 0 n = 0 β m + n + k j ( y , λ μ ) u m m ! v n n ! ) = ( m = 0 ( 1 ) m E m ( x ; 1 λ ) u m m ! ) ( m = 0 n = 0 β k + m + n ( x + y ; λ μ ) u m m ! v n n ! ) 1 2 ( m = 0 E m ( y ; λ ) u m m ! ) ( n = 0 E k + n ( x + y ; μ ) v n n ! ) δ 1 , λ μ m = 0 n = 0 ( 1 ) m m ! ( k + n ) ! E k + m + n + 1 ( x ; 1 λ ) ( k + m + n + 1 ) ! u m m ! v n n ! ,
(3.7)

which together with the Cauchy product gives the desired result by comparing the coefficients of u m v n /m!n!. □

It follows that we show a special of Theorem 3.1. We have the following formulae of products of the Apostol-Euler polynomials due to He and Wang [17].

Corollary 3.2 Let m, n be any non-negative integers. Then

E m ( x ; λ ) E n ( y ; μ ) = 2 i = 0 m ( m i ) ( 1 ) m i E m i ( y x ; 1 λ ) B n + 1 + i ( y ; λ μ ) n + 1 + i 2 i = 0 n ( n i ) E n i ( y x ; μ ) B m + 1 + i ( x ; λ μ ) m + 1 + i 2 δ 1 , λ μ ( 1 ) m m ! n ! ( m + n + 1 ) ! E m + n + 1 ( y x ; 1 λ ) .
(3.8)

Proof Setting k=0 in Theorem 3.1, we get

i = 0 n ( n i ) E n i ( x ; μ ) B m + 1 + i ( y ; λ μ ) m + 1 + i = i = 0 m ( m i ) ( 1 ) m i E m i ( x ; 1 λ ) B n + 1 + i ( x + y ; λ μ ) n + 1 + i 1 2 E m ( y ; λ ) E n ( x + y ; μ ) δ 1 , λ μ ( 1 ) m m ! n ! ( m + n + 1 ) ! E m + n + 1 ( x ; 1 λ ) .
(3.9)

Thus, the desired result follows by replacing x by yx and y by x in (3.9). □

Now we apply Theorem 3.1 to give the following another recurrence formula for the mixed Apostol-Bernoulli and Apostol-Euler polynomials.

Theorem 3.3 Let k, m, n be any non-negative integers. Then for x+y+z=1,

( 1 ) k i = 0 k ( k i ) E m + i ( x ; μ ) β k + n i ( y ; λ μ ) + ( 1 ) m 2 μ i = 0 m ( m i ) E n + i ( y ; λ ) E k + m i ( z ; 1 μ ) + ( 1 ) n λ μ i = 0 n ( n i ) β k + i ( z ; 1 λ μ ) E m + n i ( x ; 1 λ ) = δ 1 , λ μ ( 1 ) k + n k ! n ! ( k + n + 1 ) ! E k + m + n + 1 ( x ; 1 λ ) .
(3.10)

Proof We firstly prove that for any non-negative integers k, m, n,

i = 0 n ( n i ) E k + i ( x ; μ ) β m + n i ( y ; λ μ ) = 1 2 i = 0 k ( k i ) ( 1 ) k i E n + i ( x + y ; μ ) E k + m i ( y ; λ ) + i = 0 m ( m i ) ( 1 ) m i β n + i ( x + y ; λ μ ) E k + m i ( x ; 1 λ ) δ 1 , λ μ ( 1 ) m m ! n ! ( m + n + 1 ) ! E k + m + n + 1 ( x ; 1 λ ) .
(3.11)

The proof is similar to that of (2.22), and, therefore, we leave out some of the more obvious details. Clearly, the case k=0 in (3.11) is complete. Next, consider the case k1 in (3.11). Assume that (3.11) holds for all positive integers being less than k. In light of (3.1), we have

i = 0 n ( n i ) E k + i ( x ; μ ) β m + n i ( y ; λ μ ) = i = 0 k + m ( m i k ) ( 1 ) k + m i E k + m i ( x ; 1 λ ) β n + i ( x + y ; λ μ ) 1 2 E m ( y ; λ ) E k + n ( x + y ; μ ) δ 1 , λ μ ( 1 ) m m ! ( k + n ) ! ( k + m + n + 1 ) ! E k + m + n + 1 ( x ; 1 λ ) j = 0 k 1 ( k j ) i = 0 n ( n i ) E i + j ( x ; μ ) β k + m + n i j ( y ; λ μ ) .
(3.12)

It follows from (3.11) and (3.12) that

i = 0 n ( n i ) E k + i ( x ; μ ) β m + n i ( y ; λ μ ) = i = 0 k + m ( m i k ) ( 1 ) k + m i E k + m i ( x ; 1 λ ) β n + i ( x + y ; λ μ ) 1 2 E m ( y ; λ ) E k + n ( x + y ; μ ) δ 1 , λ μ ( 1 ) m m ! ( k + n ) ! ( k + m + n + 1 ) ! E k + m + n + 1 ( x ; 1 λ ) i = 0 k + m ( 1 ) k + m i β n + i ( x + y ; λ μ ) E k + m i ( x ; 1 λ ) j = 0 k 1 ( 1 ) j ( k j ) ( k + m j i ) + 1 2 i = 0 k + m ( 1 ) i E n + i ( x + y ; μ ) E k + m i ( y ; λ ) j = 0 k 1 ( 1 ) j ( k j ) ( j i ) + δ 1 , λ μ ( 1 ) k + m E k + m + n + 1 ( x ; 1 λ ) n + 1 j = 0 k 1 ( 1 ) j ( k j ) ( k + m + n + 1 j n + 1 ) .
(3.13)

Hence, applying (2.28), (2.29) and (2.32) to (3.13), we conclude the induction step. Thus, by setting x+y+z=1 in (3.11), and applying the symmetric distributions of Apostol-Euler polynomials, we complete the proof of Theorem 3.3 by replacing n by k, k by m and m by n. □

We next give some special cases of Theorem 3.3. We have the following formula products of the mixed Apostol-Bernoulli and Apostol-Euler polynomials due to He and Wang [17].

Corollary 3.4 Let m be any non-negative integer. Then for positive integer n,

E m ( x ; λ ) B n ( y ; μ ) = n 2 i = 0 m ( m i ) ( 1 ) m i E m i ( y x ; 1 λ ) E n + i 1 ( y ; λ μ ) + i = 0 n ( n i ) B n i ( y x ; μ ) E m + i ( x ; λ μ ) .
(3.14)

Proof Setting k=0, and substituting 1y for y, yx for z, λ for μ and 1 λ μ for λ in Theorem 3.3, by the symmetric distributions of the Apostol-Bernoulli and Apostol-Euler polynomials, the desired result follows immediately. □

We next apply Theorem 3.3 to give the following quadratic recurrence formulae for the mixed Apostol-Bernoulli and Apostol-Euler polynomials presented in [6].

Corollary 3.5 Let k, m, n be any non-negative integers. Then

i = 0 n ( n i ) E k + i ( x ; μ ) B m + n i ( y ; λ μ ) = i = 0 m ( m i ) ( 1 ) m i B n + i ( x + y ; λ μ ) E k + m i ( x ; 1 λ ) 1 2 i = 0 k + m ( 1 ) k i { n ( k i ) m ( k i 1 ) } E n 1 + i ( x + y ; μ ) E k + m i ( y ; λ ) .
(3.15)

Proof Substituting n for k, k for m and m for n and making the derivative operation /y in both sides of Theorem 3.3, and then using the difference equation and symmetric distributions of the Apostol-Bernoulli polynomials gives the desired result. □

Corollary 3.6 Let k, m, n be any non-negative integers. Then

i = 0 n ( n i ) E k + i ( x ; μ ) E m + n i ( y ; λ μ ) = 2 δ 1 , λ k ! m ! ( k + m + 1 ) ! E k + m + n + 1 ( x + y ; λ μ ) 2 i = 0 m ( m i ) ( 1 ) m i E n + i ( x + y ; λ μ ) B k + m + 1 i ( x ; 1 λ ) k + m + 1 i 2 i = 0 k ( k i ) ( 1 ) k i E n + i ( x + y ; μ ) B k + m + 1 i ( y ; λ ) k + m + 1 i .
(3.16)

Proof Substituting μ for λ, 1 λ μ for μ, x for y and y for z in Theorem 3.3, by applying the symmetric distributions of the Apostol-Euler polynomials, the desired result follows immediately. □

Remark 3.7 We also mention that Theorem 3.3 above can also be used to obtain the formulae of products of the mixed Apostol-Bernoulli and Apostol-Euler polynomials. For example, setting m=0, and substituting yx for x, x for y, n for k and m for n in Theorem 3.3, with the help of the symmetric distributions of the Apostol-Bernoulli polynomials, Corollary 3.2 follows immediately. For some corresponding applications of Corollaries 3.2, 3.4, 3.5 and 3.6, one is referred to [6, 17, 18].

References

  1. 1.

    Nielsen N: Traité élémentaire des nombres de Bernoulli. Gauthier-Villars, Paris; 1923:75–78.

  2. 2.

    Nörlund NE: Vorlesungen über Differnzenrechnung. Springer, Berlin; 1924.

  3. 3.

    Srivastava HM, Choi J: Series Associated with the Zeta and Related Functions. Kluwer Academic, Dordrecht; 2001.

  4. 4.

    Agoh T, Dilcher K: Convolution identities and lacunary recurrences for Bernoulli numbers. J. Number Theory 2007, 124: 105–122. 10.1016/j.jnt.2006.08.009

  5. 5.

    He Y, Zhang WP: A convolution formula for Bernoulli polynomials. Ars Comb. 2013, 108: 97–104.

  6. 6.

    He Y, Wang CP: Recurrence formulae for Apostol-Bernoulli and Apostol-Euler polynomials. Adv. Differ. Equ. 2012., 2012: Article ID 209

  7. 7.

    Luo QM, Srivastava HM: Some generalizations of the Apostol-Bernoulli and Apostol-Euler polynomials. J. Math. Anal. Appl. 2005, 308: 290–302. 10.1016/j.jmaa.2005.01.020

  8. 8.

    Luo QM: Apostol-Euler polynomials of higher order and Gaussian hypergeometric functions. Taiwan. J. Math. 2006, 10: 917–925.

  9. 9.

    Apostol TM: On the Lerch zeta function. Pac. J. Math. 1951, 1: 161–167. 10.2140/pjm.1951.1.161

  10. 10.

    Srivastava HM: Some formulas for the Bernoulli and Euler polynomials at rational arguments. Math. Proc. Camb. Philos. Soc. 2000, 129: 77–84. 10.1017/S0305004100004412

  11. 11.

    Boyadzhiev KN: Apostol-Bernoulli functions, derivative polynomials and Eulerian polynomials. Adv. Appl. Discrete Math. 2008, 1: 109–122.

  12. 12.

    Garg M, Jain K, Srivastava HM: Some relationships between the generalized Apostol-Bernoulli polynomials and Hurwitz-Lerch zeta functions. Integral Transforms Spec. Funct. 2006, 17: 803–815. 10.1080/10652460600926907

  13. 13.

    Luo QM, Srivastava HM: Some relationships between the Apostol-Bernoulli and Apostol-Euler polynomials. Comput. Math. Appl. 2006, 51: 631–642. 10.1016/j.camwa.2005.04.018

  14. 14.

    Luo QM: Fourier expansions and integral representations for the Apostol-Bernoulli and Apostol-Euler polynomials. Math. Comput. 2009, 78: 2193–2208. 10.1090/S0025-5718-09-02230-3

  15. 15.

    Luo QM: The multiplication formulas for the Apostol-Bernoulli and Apostol-Euler polynomials of higher order. Integral Transforms Spec. Funct. 2009, 20: 377–391. 10.1080/10652460802564324

  16. 16.

    Srivastava HM, Todorov PG: An explicit formula for the generalized Bernoulli polynomials. J. Math. Anal. Appl. 1988, 130: 509–513. 10.1016/0022-247X(88)90326-5

  17. 17.

    He Y, Wang CP: Some formulae of products of the Apostol-Bernoulli and Apostol-Euler polynomials. Discrete Dyn. Nat. Soc. 2012., 2012: Article ID 927953

  18. 18.

    He Y, Zhang WP: Some sum relations involving Bernoulli and Euler polynomials. Integral Transforms Spec. Funct. 2011, 22: 207–215. 10.1080/10652469.2010.511209

Download references

Acknowledgements

The author would like to express her gratitude to the referees for their helpful comments and suggestions in improving this paper.

Author information

Correspondence to Jingzhe Wang.

Additional information

Competing interests

The author declares that they have no competing interests.

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

Keywords

  • Bernoulli numbers and polynomials
  • Apostol-Bernoulli numbers and polynomials
  • combinatorial identities