Open Access

New formulae of products of the Frobenius-Euler polynomials

Journal of Inequalities and Applications20142014:261

https://doi.org/10.1186/1029-242X-2014-261

Received: 12 April 2014

Accepted: 14 June 2014

Published: 22 July 2014

Abstract

In this paper, we perform a further investigation for the Frobenius-Euler polynomials. Some new formulae of products of the Frobenius-Euler polynomials are established by applying the generating function methods and some summation transform techniques. It turns out that some corresponding known results are obtained as special cases.

MSC:11B68, 05A19.

Keywords

Bernoulli polynomials and numbersEuler polynomials and numbersFrobenius-Euler polynomials and numberscombinatorial identities

1 Introduction

Let λ be a complex number with λ 1 . Frobenius [1] studied in great detail the so-called Frobenius-Euler polynomials H n ( x | λ ) satisfying the following exponential generating function:
1 λ e t λ e x t = n = 0 H n ( x | λ ) t n n ! .
(1.1)
In particular, H n ( λ ) = H n ( 0 | λ ) are called the Frobenius-Euler numbers. In fact, the Frobenius-Euler polynomials can also be defined recursively by the Frobenius-Euler numbers, as follows:
H n ( x | λ ) = k = 0 n ( n k ) H k ( λ ) x n k ( n 0 ) ,
(1.2)
where the Frobenius-Euler numbers obey the recurrence relation
H 0 ( λ ) = 1 , ( H ( λ ) + 1 ) n H n ( λ ) = { 1 λ , n = 0 , 0 , n 1 ,
(1.3)

with the usual convention about replacing H n ( λ ) by H n ( λ ) . For some interesting arithmetic properties of the Frobenius-Euler polynomials and numbers, one is referred to [213].

Some analogues of the Frobenius-Euler polynomials are the classical Bernoulli polynomials B n ( x ) and Euler polynomials E n ( x ) . They are usually defined by the following exponential generating functions:
t e x t e t 1 = n = 0 B n ( x ) t n n ! and 2 e x t e t + 1 = n = 0 E n ( x ) t n n ! .
(1.4)

Especially, 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 numbers and polynomials play important roles in many different areas of mathematics including number theory, combinatorics, special functions and analysis. Numerous interesting properties for them can be found in many books; see, for example, [1417]. Obviously the Frobenius-Euler polynomials give the classical Euler polynomials when λ = 1 in (1.1).

In [15], Nielsen investigated three formulae of products of the classical Bernoulli and Euler polynomials. In particular, Nielsen showed that for positive integers m, n,
B m ( x ) B n ( x ) = k = 0 { n ( m 2 k ) + n ( n 2 k ) } B 2 k B m + n 2 k ( x ) m + n 2 k + ( 1 ) m + 1 m ! n ! ( m + n ) ! B m + n ,
(1.5)
which was reobtained by Carlitz [18] applying a different method. For further discoveries of Nielsen’s formulae on the classical Bernoulli and Euler polynomials, see [1923] for details. In [24], Carlitz explored some formulae of products of the Frobenius-Euler polynomials and obtained that for non-negative integers m, n,
H m ( x | λ ) H n ( x | μ ) = λ ( μ 1 ) λ μ 1 k = 0 m ( m k ) H k ( λ ) H m + n k ( x | λ μ ) + μ ( λ 1 ) λ μ 1 k = 0 n ( n k ) H k ( μ ) H m + n k ( x | λ μ ) ( λ 1 ) ( μ 1 ) λ μ 1 H m + n ( x | λ μ ) ,
(1.6)
when λ 1 , μ 1 , λ μ 1 , and if λ 1 , then for positive integer m and non-negative integer n,
B m ( x ) H n ( x | λ ) = k = 0 m ( m k ) B k H m + n k ( x | λ ) λ λ 1 m k = 0 n ( n k ) H k ( λ ) H m + n k 1 ( x | λ ) + m H m + n 1 ( x | λ ) ,
(1.7)
and if λ 0 , 1 , then for positive integers m, n,
H m ( x | λ ) H n ( x | 1 λ ) = ( λ 1 ) k = 1 m ( m k ) H k ( λ ) B m + n + 1 k ( x ) m + n + 1 k + ( 1 λ 1 ) k = 1 n ( n k ) H k ( 1 λ ) B m + n + 1 k ( x ) m + n + 1 k + ( 1 ) n ( λ 1 ) m ! n ! ( m + n + 1 ) ! H m + n + 1 ( λ ) .
(1.8)

Further, Carlitz [24] showed that the case λ = 1 in (1.7) and (1.8) can be used to give the expression of B m ( x ) E n ( x ) and E m ( x ) E n ( x ) stated in [15], respectively.

Motivated by the work of Carlitz [24], in the present paper we establish some new formulae of products of the Frobenius-Euler polynomials by applying the generating function methods and some summation transform techniques. It turns out that some known results including (1.6), (1.7) and (1.8) are obtained as special cases.

2 Restatement of the main results

In this section, we shall establish three new formulae of products of the Frobenius-Euler polynomials to extend formulae (1.6), (1.7) and (1.8) by making use of the generating function methods. As further applications, we also give some new sum relations of products of the Frobenius-Euler polynomials by applying some summation transform techniques, which are analogous to some sum relations of products of the classical Euler polynomials and Frobenius-Euler polynomials stated in [9, 25]. For convenience, in the following we shall denote by H n the harmonic number of order n given by
H 0 = 0 and H n = k = 1 n 1 k = 1 + 1 2 + + 1 n ( n 1 ) .
(2.1)

We now state our main results as follows.

Theorem 2.1 Let m, n be non-negative integers. Then, for λ 1 , μ 1 , λ μ 1 ,
H m ( x | λ ) H n ( y | μ ) = λ ( μ 1 ) λ μ 1 k = 0 m ( m k ) H m k ( x y | λ ) H n + k ( y | λ μ ) + μ ( λ 1 ) λ μ 1 k = 0 n ( n k ) H n k ( y x | μ ) H m + k ( x | λ μ ) ( λ 1 ) ( μ 1 ) λ μ 1 k = 0 m ( m k ) ( x y ) m k H n + k ( y | λ μ ) .
(2.2)
Proof Observe that
1 λ e u 1 1 μ e v 1 = ( λ e u λ e u 1 + 1 μ e v 1 ) 1 λ μ e u + v 1 .
(2.3)
If we multiply ( λ 1 ) ( μ 1 ) e x u + y v on both sides of (2.3), then
( λ 1 ) e x u λ e u 1 ( μ 1 ) e y v μ e v 1 = λ ( μ 1 ) λ μ 1 ( λ 1 ) e ( 1 + x y ) u λ e u 1 ( λ μ 1 ) e y ( u + v ) λ μ e u + v 1 + λ 1 λ μ 1 ( μ 1 ) e ( y x ) v μ e v 1 ( λ μ 1 ) e x ( u + v ) λ μ e u + v 1 .
(2.4)
Note that from (1.1) we have
λ 1 λ e u 1 e x u = 1 1 λ e u 1 λ e x u = m = 0 H m ( x | 1 λ ) u m m ! .
(2.5)
More generally, the Taylor theorem gives
λ 1 λ e u + v 1 e x ( u + v ) = n = 0 n u n ( λ 1 λ e u 1 e x u ) v n n ! = m = 0 n = 0 H m + n ( x | 1 λ ) u m m ! v n n ! .
(2.6)
By applying (2.5) and (2.6) to (2.4), we obtain
m = 0 n = 0 H m ( x | 1 λ ) H n ( y | 1 μ ) u m m ! v n n ! = λ ( μ 1 ) λ μ 1 ( m = 0 H m ( 1 + x y | 1 λ ) u m m ! ) ( m = 0 n = 0 H m + n ( y | 1 λ μ ) u m m ! v n n ! ) + λ 1 λ μ 1 ( n = 0 H n ( y x | 1 μ ) v n n ! ) ( m = 0 n = 0 H m + n ( x | 1 λ μ ) u m m ! v n n ! ) .
(2.7)
It follows from (2.7) and the Cauchy product that
m = 0 n = 0 H m ( x | 1 λ ) H n ( y | 1 μ ) u m m ! v n n ! = λ ( μ 1 ) λ μ 1 m = 0 n = 0 [ k = 0 m ( m k ) H m k ( 1 + x y | 1 λ ) H n + k ( y | 1 λ μ ) ] u m m ! v n n ! + λ 1 λ μ 1 m = 0 n = 0 [ k = 0 n ( n k ) H n k ( y x | 1 μ ) H m + k ( x | 1 λ μ ) ] u m m ! v n n ! .
(2.8)
Comparing the coefficients of u m v n / m ! n ! in (2.8) gives
H m ( x | 1 λ ) H n ( y | 1 μ ) = λ ( μ 1 ) λ μ 1 k = 0 m ( m k ) H m k ( 1 + x y | 1 λ ) H n + k ( y | 1 λ μ ) + λ 1 λ μ 1 k = 0 n ( n k ) H n k ( y x | 1 μ ) H m + k ( x | 1 λ μ ) .
(2.9)
Substituting λ for 1 / λ and μ for 1 / μ in (2.9), we get
H m ( x | λ ) H n ( y | μ ) = μ 1 λ μ 1 k = 0 m ( m k ) H m k ( 1 + x y | λ ) H n + k ( y | λ μ ) + μ ( λ 1 ) λ μ 1 k = 0 n ( n k ) H n k ( y x | μ ) H m + k ( x | λ μ ) .
(2.10)
Since the Frobenius-Euler polynomials obey the difference equation (see, e.g., [9])
H n ( x + 1 | λ ) λ H n ( x | λ ) = ( 1 λ ) x n ( n 0 ) ,
(2.11)

so by applying (2.11) to (2.10), the desired result follows immediately. □

It follows that we show some special cases of Theorem 2.1. By setting x = y in Theorem 2.1, we rediscover formula (1.6). Setting λ = μ and x = y in Theorem 2.1, for non-negative integers m, n and λ ± 1 , we have
H m ( x | λ ) H n ( x | λ ) = λ λ + 1 k = 0 m ( m k ) H m k ( λ ) H n + k ( x | λ 2 ) + λ λ + 1 k = 0 n ( n k ) H n k ( λ ) H m + k ( x | λ 2 ) λ 1 λ + 1 H m + n ( x | λ 2 ) .
(2.12)
Clearly, H 0 ( x | λ ) = 1 (see, e.g., [9]). Hence, by setting n = 0 in (2.12), we obtain that for non-negative integer n,
H n ( x | λ ) = λ λ + 1 k = 0 n ( n k ) H n k ( λ ) H k ( x | λ 2 ) + 1 λ + 1 H n ( x | λ 2 ) .
(2.13)
Setting x = y and μ = 1 / λ 2 in Theorem 2.1, we get that for non-negative integers m, n and λ 0 , 1 ,
H m ( x | λ ) H n ( x | 1 λ 2 ) = ( λ + 1 ) k = 0 m ( m k ) H m k ( λ ) H n + k ( x | 1 λ ) 1 λ k = 0 n ( n k ) H n k ( 1 λ 2 ) H m + k ( x | 1 λ ) λ 2 1 λ H m + n ( x | 1 λ ) .
(2.14)
In particular, the case n = 0 in (2.14) gives that for non-negative integer n,
λ H n ( x | 1 λ ) + H n ( x | λ ) = ( λ + 1 ) k = 0 n ( n k ) H n k ( 1 λ ) H k ( x | λ ) ,
(2.15)

which was discovered by Kim [9] applying a nice method called the Frobenius-Euler basis { H 0 ( x | λ ) , , H n ( x | λ ) } for P n consisting of the Frobenius-Euler polynomials with P n being the space of polynomials of degree less than or equal to n.

Theorem 2.2 Let m, n be non-negative integers. Then, for λ 1 ,
B m + 1 ( x ) H n ( y | λ ) = k = 0 m + 1 ( m + 1 k ) B m + 1 k ( x y ) H n + k ( y | λ ) λ λ 1 ( m + 1 ) k = 0 n ( n k ) H n k ( y x | λ ) H m + k ( x | λ ) + ( m + 1 ) k = 0 m ( m k ) ( x y ) m k H n + k ( y | λ ) .
(2.16)
Proof By setting λ = 1 and substituting λ for μ in (2.3), we have
1 e u 1 1 λ e v 1 = ( e u e u 1 + 1 λ e v 1 ) 1 λ e u + v 1 .
(2.17)
Multiplying ( λ 1 ) u e x u + y v on both sides of (2.17) leads to
u e x u e u 1 ( λ 1 ) e y v λ e v 1 = u e ( 1 + x y ) u e u 1 ( λ 1 ) e y ( u + v ) λ e u + v 1 + u λ 1 ( λ 1 ) e ( y x ) v λ e v 1 ( λ 1 ) e x ( u + v ) λ e u + v 1 .
(2.18)
Hence, by applying (1.4), (2.5) and (2.6) to (2.18), we obtain
m = 0 n = 0 B m ( x ) H n ( y | 1 λ ) u m m ! v n n ! = ( m = 0 B m ( 1 + x y ) u m m ! ) ( m = 0 n = 0 H m + n ( y | 1 λ ) u m m ! v n n ! ) + u λ 1 ( n = 0 H n ( y x | 1 λ ) v n n ! ) ( m = 0 n = 0 H m + n ( x | 1 λ ) u m m ! v n n ! ) ,
(2.19)
which together with the Cauchy product yields
m = 0 n = 0 B m ( x ) H n ( y | 1 λ ) u m m ! v n n ! = m = 0 n = 0 [ k = 0 m ( m k ) B m k ( 1 + x y ) H n + k ( y | 1 λ ) ] u m m ! v n n ! + 1 λ 1 m = 0 n = 0 [ k = 0 n ( n k ) H n k ( y x | 1 λ ) H m + k ( x | 1 λ ) ] u m + 1 m ! v n n ! .
(2.20)
Since B 0 ( x ) = 1 (see, e.g., [26]), so by substituting λ for 1 / λ and comparing the coefficients of u m + 1 v n / ( m + 1 ) ! n ! in (2.20) we get
B m + 1 ( x ) H n ( y | λ ) = k = 0 m + 1 ( m + 1 k ) B m + 1 k ( 1 + x y ) H n + k ( y | λ ) λ λ 1 ( m + 1 ) k = 0 n ( n k ) H n k ( y x | λ ) H m + k ( x | λ ) .
(2.21)

Thus, by applying the difference equation of the classical Bernoulli polynomials B n ( x + 1 ) B n ( x ) = n x n 1 for non-negative integer n (see, e.g., [26]) to (2.21), the desired result follows immediately. □

It is obvious that the case x = y in Theorem 2.2 gives formula (1.7).

Theorem 2.3 Let m, n be non-negative integers. Then, for λ 0 , 1 ,
H m ( x | 1 λ ) H n ( y | λ ) = ( 1 λ 1 ) k = 0 m ( m k ) H m k ( x y | 1 λ ) B n + k + 1 ( y ) n + k + 1 + ( λ 1 ) k = 0 n ( n k ) H n k ( y x | λ ) B m + k + 1 ( x ) m + k + 1 ( λ 1 ) 2 λ k = 0 m ( m k ) ( x y ) m k B n + k + 1 ( y ) n + k + 1 + ( 1 ) m ( λ 1 ) m ! n ! ( m + n + 1 ) ! H m + n + 1 ( y x | λ ) .
(2.22)
Proof By substituting 1 / λ for μ in (2.4), we discover
( λ 1 ) e x u λ e u 1 ( 1 λ 1 ) e y v 1 λ e v 1 = λ ( 1 λ 1 ) ( λ 1 ) e ( 1 + x y ) u λ e u 1 ( e y ( u + v ) e u + v 1 1 u + v ) + ( λ 1 ) ( 1 λ 1 ) e ( y x ) v 1 λ e v 1 ( e x ( u + v ) e u + v 1 1 u + v ) + 1 λ u + v ( ( λ 1 ) e ( 1 + x y ) u λ e u 1 ( 1 λ 1 ) e ( y x ) v 1 λ e v 1 ) .
(2.23)
Notice that from (1.4) and the Taylor theorem we have
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 B m + n + 1 ( x ) m + n + 1 u m m ! v n n ! .
(2.24)
On the other hand, if we apply u m = n = 0 m ( m n ) ( u + v ) n ( v ) m n to (2.5), then we get
( λ 1 ) e ( 1 + x y ) u λ e u 1 = n = 0 m = n H m ( 1 + x y | 1 λ ) m ! ( m n ) ( u + v ) n ( v ) m n = n = 0 m = n + 1 H m ( 1 + x y | 1 λ ) m ! ( m n + 1 ) ( u + v ) n + 1 ( v ) m ( n + 1 ) + m = 0 H m ( 1 + x y | 1 λ ) ( v ) m m ! .
(2.25)
Since the Frobenius-Euler polynomials satisfy the symmetric distribution H n ( 1 x | 1 λ ) = ( 1 ) n H n ( x | λ ) for non-negative integer n (see, e.g., [4]), so by (2.5) we can rewrite (2.25) as
1 u + v ( ( λ 1 ) e ( 1 + x y ) u λ e u 1 ( 1 λ 1 ) e ( y x ) v 1 λ e v 1 ) = n = 0 m = n + 1 ( 1 ) n + 1 H m ( y x | λ ) m ! ( m n + 1 ) ( u + v ) n v m ( n + 1 ) = n = 0 m = n + 1 ( 1 ) n + 1 H m ( y x | λ ) m ! ( m n + 1 ) k = 0 n ( n k ) u k v m ( k + 1 ) = k = 0 n = k m = n + 1 ( 1 ) n + 1 H m ( y x | λ ) m ! ( m n + 1 ) ( n k ) u k v m ( k + 1 ) = k = 0 m = k + 1 ( 1 ) k + 1 H m ( y x | λ ) m ! u k v m ( k + 1 ) = k = 0 m = 0 ( 1 ) k + 1 k ! m ! H k + m + 1 ( y x | λ ) ( k + m + 1 ) ! u k k ! v m m ! = m = 0 n = 0 ( 1 ) m + 1 m ! n ! H m + n + 1 ( y x | λ ) ( m + n + 1 ) ! u m m ! v n n ! .
(2.26)
Hence, applying (2.5), (2.24) and (2.26) to (2.23) and then comparing the coefficients of u m v n / m ! n ! gives
H m ( x | 1 λ ) H n ( y | λ ) = ( 1 λ ) k = 0 m ( m k ) H m k ( 1 + x y | 1 λ ) B n + k + 1 ( y ) n + k + 1 + ( λ 1 ) k = 0 n ( n k ) H n k ( y x | λ ) B m + k + 1 ( x ) m + k + 1 + ( 1 ) m ( λ 1 ) m ! n ! ( m + n + 1 ) ! H m + n + 1 ( y x | λ ) ,
(2.27)

which together with (2.11) yields the desired result. □

It becomes obvious that setting x = y and then substituting m for n and n for m in Theorem 2.3 gives formula (1.8).

Theorem 2.4 Let n be a non-negative integer. Then, for λ 1 , μ 1 , λ μ 1 ,
k = 0 n H k ( x | λ ) H n k ( y | μ ) = λ ( μ 1 ) λ μ 1 k = 0 n ( n + 1 k + 1 ) H k ( x y | λ ) H n k ( y | λ μ ) + μ ( λ 1 ) λ μ 1 k = 0 n ( n + 1 k + 1 ) H k ( y x | μ ) H n k ( x | λ μ ) ( λ 1 ) ( μ 1 ) λ μ 1 k = 0 n ( n + 1 k + 1 ) ( x y ) k H n k ( y | λ μ ) .
(2.28)
Proof It is easy to see that (2.2) can be rewritten as
H m ( x | λ ) H n ( y | μ ) = λ ( μ 1 ) λ μ 1 k = 0 m ( m k ) H k ( x y | λ ) H m + n k ( y | λ μ ) + μ ( λ 1 ) λ μ 1 k = 0 n ( n k ) H k ( y x | μ ) H m + n k ( x | λ μ ) ( λ 1 ) ( μ 1 ) λ μ 1 k = 0 m ( m k ) ( x y ) k H m + n k ( y | λ μ ) .
(2.29)
Hence, by substituting l for m and n l for n with 0 l n and then making the summation operation l = 0 n in (2.29), we have
l = 0 n H l ( x | λ ) H n l ( y | μ ) = λ ( μ 1 ) λ μ 1 l = 0 n k = 0 l ( l k ) H k ( x y | λ ) H n k ( y | λ μ ) + μ ( λ 1 ) λ μ 1 l = 0 n k = 0 l ( l k ) H k ( y x | μ ) H n k ( x | λ μ ) ( λ 1 ) ( μ 1 ) λ μ 1 l = 0 n k = 0 l ( l k ) ( x y ) k H n k ( y | λ μ ) .
(2.30)
If we change the order of summations on the right-hand side of (2.30), then we obtain
l = 0 n H l ( x | λ ) H n l ( y | μ ) = λ ( μ 1 ) λ μ 1 k = 0 n l = k n ( l k ) H k ( x y | λ ) H n k ( y | λ μ ) + μ ( λ 1 ) λ μ 1 k = 0 n l = k n ( l k ) H k ( y x | μ ) H n k ( x | λ μ ) ( λ 1 ) ( μ 1 ) λ μ 1 k = 0 n l = k n ( l k ) ( x y ) k H n k ( y | λ μ ) .
(2.31)
Notice that for non-negative integers m, n (see, e.g., [[27], Lemma 3.1]),
k = m n ( k m ) = ( n + 1 m + 1 ) .
(2.32)

Thus, the desired result follows by applying (2.32) to (2.31). □

We next discuss some special cases of Theorem 2.4. By setting x = y in Theorem 2.4, we obtain that for a non-negative integer n,
k = 0 n H k ( x | λ ) H n k ( x | μ ) = λ ( μ 1 ) λ μ 1 k = 0 n ( n + 1 k + 1 ) H k ( λ ) H n k ( x | λ μ ) + μ ( λ 1 ) λ μ 1 k = 0 n ( n + 1 k + 1 ) H k ( μ ) H n k ( x | λ μ ) ( λ 1 ) ( μ 1 ) λ μ 1 ( n + 1 ) H n ( x | λ μ ) .
(2.33)
Taking λ = μ in (2.33) we have
k = 0 n H k ( x | λ ) H n k ( x | λ ) = 2 λ λ + 1 k = 0 n ( n + 1 k + 1 ) H k ( λ ) H n k ( x | λ 2 ) λ 1 λ + 1 ( n + 1 ) H n ( x | λ 2 ) ,
(2.34)
which is equivalent to
k = 0 n H k ( x | λ ) H n k ( x | λ ) = 2 λ λ + 1 k = 0 n ( n + 1 k ) H n k ( λ ) H k ( x | λ 2 ) λ 1 λ + 1 ( n + 1 ) H n ( x | λ 2 ) .
(2.35)
It is interesting to point out that formula (2.35) is analogous to the following sum relation on the classical Bernoulli polynomials:
k = 0 n B k ( x ) B n k ( x ) 2 n + 2 k = 0 n 2 ( n + 2 k ) B n k B k ( x ) = ( n + 1 ) B n ( x ) ,
(2.36)

which was obtained by Kim et al. [25] using a nice method called the Bernoulli basis { B 0 ( x ) , , B n ( x ) } for P n consisting of the Bernoulli polynomials with P n being the space of polynomials of degree less than or equal to n. For an equivalent version of (2.35), see [[9], Theorem 3] for details.

Theorem 2.5 Let n 2 be a positive integer. Then, for λ 1 , μ 1 , λ μ 1 ,
k = 1 n 1 H k ( x | λ ) H n k ( y | μ ) k ( n k ) = 1 n k = 1 n 1 ( n k ) ( H n 1 H k 1 ) { λ ( μ 1 ) λ μ 1 H k ( x y | λ ) H n k ( y | λ μ ) + μ ( λ 1 ) λ μ 1 H k ( y x | μ ) H n k ( x | λ μ ) ( λ 1 ) ( μ 1 ) λ μ 1 ( x y ) k H n k ( y | λ μ ) } + 2 H n 1 ( λ ( μ 1 ) λ μ 1 H n ( y | λ μ ) n + μ ( λ 1 ) λ μ 1 H n ( x | λ μ ) n ( λ 1 ) ( μ 1 ) λ μ 1 H n ( y | λ μ ) n ) .
(2.37)
Proof Let m, n be positive integers. Then, by multiplying 1 / m n on both sides of (2.29) and then substituting l for m and n l for n with 1 l n 1 , in light of making the summation operation l = 1 n 1 , we get
l = 1 n 1 H l ( x | λ ) H n l ( y | μ ) l ( n l ) = λ ( μ 1 ) λ μ 1 l = 1 n 1 1 l ( n l ) k = 0 l ( l k ) H k ( x y | λ ) H n k ( y | λ μ ) + μ ( λ 1 ) λ μ 1 l = 1 n 1 1 l ( n l ) k = 0 l ( l k ) H k ( y x | μ ) H n k ( x | λ μ ) ( λ 1 ) ( μ 1 ) λ μ 1 l = 1 n 1 1 l ( n l ) k = 0 l ( l k ) ( x y ) k H n k ( y | λ μ ) .
(2.38)
Observe that for positive integers m, n,
1 m n = 1 m + n ( 1 m + 1 n ) .
(2.39)
Hence, by applying (2.39) to (2.38), we obtain
l = 1 n 1 H l ( x | λ ) H n l ( y | μ ) l ( n l ) = λ ( μ 1 ) λ μ 1 1 n l = 1 n 1 ( 1 l + 1 n l ) k = 1 l ( l k ) H k ( x y | λ ) H n k ( y | λ μ ) + μ ( λ 1 ) λ μ 1 1 n l = 1 n 1 ( 1 l + 1 n l ) k = 1 l ( l k ) H k ( y x | μ ) H n k ( x | λ μ ) ( λ 1 ) ( μ 1 ) λ μ 1 1 n l = 1 n 1 ( 1 l + 1 n l ) k = 1 l ( l k ) ( x y ) k H n k ( y | λ μ ) + 2 H n 1 ( λ ( μ 1 ) λ μ 1 H n ( y | λ μ ) n + μ ( λ 1 ) λ μ 1 H n ( x | λ μ ) n ( λ 1 ) ( μ 1 ) λ μ 1 H n ( y | λ μ ) n ) .
(2.40)
Changing the order of summations on the right-hand side of (2.40), we obtain
l = 1 n 1 H l ( x | λ ) H n l ( y | μ ) l ( n l ) = λ ( μ 1 ) λ μ 1 1 n k = 1 n 1 l = k n 1 ( l k ) ( 1 l + 1 n l ) H k ( x y | λ ) H n k ( y | λ μ ) + μ ( λ 1 ) λ μ 1 1 n k = 1 n 1 l = k n 1 ( l k ) ( 1 l + 1 n l ) H k ( y x | μ ) H n k ( x | λ μ ) ( λ 1 ) ( μ 1 ) λ μ 1 1 n k = 1 n 1 l = k n 1 ( l k ) ( 1 l + 1 n l ) ( x y ) k H n k ( y | λ μ ) + 2 H n 1 ( λ ( μ 1 ) λ μ 1 H n ( y | λ μ ) n + μ ( λ 1 ) λ μ 1 H n ( x | λ μ ) n ( λ 1 ) ( μ 1 ) λ μ 1 H n ( y | λ μ ) n ) .
(2.41)
Note that for non-negative integers m, n (see, e.g., [[27], Lemma 3.1]),
k = m n ( k m ) 1 k = 1 m k = m n ( k 1 m 1 ) = 1 m ( n m ) ,
(2.42)
and
k = m n ( k m ) 1 n + 1 k = ( H n + 1 H m ) ( n + 1 m ) .
(2.43)
By combining (2.42) and (2.43), we have
k = m n ( k m ) ( 1 k + 1 n + 1 k ) = 1 m ( n m ) + ( H n + 1 H m ) ( n + 1 m ) = ( H n H m 1 ) ( n + 1 m ) .
(2.44)

Thus, the desired result follows by applying (2.44) to (2.41). □

Obviously the case x = y and λ = μ in Theorem 2.5 gives that for positive integer n 2 and λ ± 1 ,
k = 1 n 1 H k ( x | λ ) H n k ( x | λ ) k ( n k ) = λ λ + 1 2 n k = 1 n 1 ( n k ) ( H n 1 H k 1 ) H k ( λ ) H n k ( x | λ 2 ) + 2 H n 1 H n ( x | λ 2 ) n ,
(2.45)

which is analogous to the sum relation on the classical Euler polynomials stated in [[25], Theorem 7]. From the above, one can also use Theorems 2.2 and 2.3 to establish some similar sum relations to Theorems 2.4 and 2.5. We leave the details to the interested readers for an exercise.

Declarations

Acknowledgements

This work is supported by the Foundation for Fostering Talents in Kunming University of Science and Technology (Grant No. KKSY201307047) and the National Natural Science Foundation of P.R. China (Grant No. 11326050, 11071194).

Authors’ Affiliations

(1)
Faculty of Science, Kunming University of Science and Technology

References

  1. Frobenius, FG: Über die Bernoullischen Zahlen und die Eulerischen Polynome. Sitzungsber. K. Preußischen Akad. Wissenschaft. Berlin, pp. 809-847. (1910)MATHGoogle Scholar
  2. Araci S, Acikgoz M: A note on the Frobenius-Euler numbers and polynomials associated with Bernstein polynomials. Adv. Stud. Contemp. Math. 2012, 22: 399-406.MathSciNetMATHGoogle Scholar
  3. Araci S, Şen E, Acikgoz M: Theorems on Genocchi polynomials of higher order arising from Genocchi basis. Taiwan. J. Math. 2014, 18: 473-482.View ArticleMathSciNetGoogle Scholar
  4. Choi J, Kim DS, Kim T, Kim YH: A note on some identities of Frobenius-Euler numbers and polynomials. Int. J. Math. Math. Sci. 2012. Article ID 861797, 2012: Article ID 861797Google Scholar
  5. Kim T, Lee B: Some identities of the Frobenius-Euler polynomials. Abstr. Appl. Anal. 2009. Article ID 639439, 2009: Article ID 639439Google Scholar
  6. Kim T: An identity of the symmetry for the Frobenius-Euler polynomials associated with the fermionic p -adic invariant q -integrals on Z p . Rocky Mt. J. Math. 2011, 41: 239-247. 10.1216/RMJ-2011-41-1-239View ArticleMathSciNetMATHGoogle Scholar
  7. Kim T, Choi J: A note on the product of Frobenius-Euler polynomials arising from the p -adic integral on Z p . Adv. Stud. Contemp. Math. 2012, 22: 215-223.MathSciNetMATHGoogle Scholar
  8. Kim T: Identities involving Frobenius-Euler polynomials arising from non-linear differential equations. J. Number Theory 2012, 132: 2854-2865. 10.1016/j.jnt.2012.05.033MathSciNetView ArticleMATHGoogle Scholar
  9. Kim DS, Kim T: Some new identities of Frobenius-Euler numbers and polynomials. J. Inequal. Appl. 2012. Article ID 307, 2012: Article ID 307Google Scholar
  10. Kim DS, Kim T, Lee S-H, Rim S-H: Frobenius-Euler polynomials and umbral calculus in the p -adic case. Adv. Differ. Equ. 2012. Article ID 222, 2012: Article ID 222Google Scholar
  11. Kim DS, Kim T, Lee S-H: Umbral calculus and the Frobenius-Euler polynomials. Abstr. Appl. Anal. 2013. Article ID 871512, 2013: Article ID 871512Google Scholar
  12. Simsek Y, Bayad A, Lokesha V: q -Bernstein polynomials related to q -Frobenius-Euler polynomials, l -functions, and q -Stirling numbers. Math. Methods Appl. Sci. 2012, 35: 877-884. 10.1002/mma.1580MathSciNetView ArticleMATHGoogle Scholar
  13. Simsek Y: Generating functions for generalized Stirling type numbers, array type polynomials, Eulerian type polynomials and their applications. Fixed Point Theory Appl. 2013. Article ID 87, 2013: Article ID 87Google Scholar
  14. Cohen H Graduate Texts in Math. 240. In Number Theory, Volume II, Analytic and Modern Tools. Springer, New York; 2007.Google Scholar
  15. Nielsen N: Traité élémentaire des nombres de Bernoulli. Gauthier-Villars, Paris; 1923.MATHGoogle Scholar
  16. Nörlund NE: Vorlesungen über Differenzenrechnung. Springer, Berlin; 1924.View ArticleMATHGoogle Scholar
  17. Srivastava HM, Choi J: Zeta and q-Zeta Functions and Associated Series and Integrals. Elsevier, Amsterdam; 2012.MATHGoogle Scholar
  18. Carlitz L: Note on the integral of the product of several Bernoulli polynomials. J. Lond. Math. Soc. 1959, 34: 361-363.View ArticleMathSciNetMATHGoogle Scholar
  19. He Y, Wang CP: Some formulae of products of the Apostol-Bernoulli and Apostol-Euler polynomials. Discrete Dyn. Nat. Soc. 2012. Article ID 927953, 2012: Article ID 927953Google Scholar
  20. He Y, Wang CP: Recurrence formulae for Apostol-Bernoulli and Apostol-Euler polynomials. Adv. Differ. Equ. 2012. Article ID 209, 2012: Article ID 209Google Scholar
  21. He Y, Zhang WP: A convolution formula for Bernoulli polynomials. Ars Comb. 2013, 108: 97-104.MathSciNetMATHGoogle Scholar
  22. He, Y, Zhang, WP: A three-term reciprocity formula for Bernoulli polynomials. Util. Math. (to appear)Google Scholar
  23. Wang JZ: New recurrence formulae for the Apostol-Bernoulli and Apostol-Euler polynomials. Adv. Differ. Equ. 2013. Article ID 247, 2013: Article ID 247Google Scholar
  24. Carlitz L: The product of two Eulerian polynomials. Math. Mag. 1963, 36: 37-41. 10.2307/2688134MathSciNetView ArticleMATHGoogle Scholar
  25. Kim DS, Kim T, Lee S-H, Kim Y-H: Some identities for the product of two Bernoulli and Euler polynomials. Adv. Differ. Equ. 2012. Article ID 95, 2012: Article ID 95Google Scholar
  26. Abramowitz M, Stegun IA: Handbook of Mathematical Functions with Formulas Graphs and Mathematical Tables. National Bureau of Standards, Washington, DC; 1964.MATHGoogle Scholar
  27. He Y, Zhang WP: Some sum relations involving Bernoulli and Euler polynomials. Integral Transforms Spec. Funct. 2011, 22: 207-215. 10.1080/10652469.2010.511209MathSciNetView ArticleMATHGoogle Scholar

Copyright

© He and Wang; licensee Springer. 2014

This article is published under license to BioMed Central Ltd. This is an Open Access article distributed under the terms of the Creative Commons Attribution License (http://creativecommons.org/licenses/by/4.0), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly credited.