Skip to main content

Theory and Modern Applications

Some identities of Bernoulli, Euler and Abel polynomials arising from umbral calculus

Abstract

In this paper, we derive some identities of Bernoulli, Euler, and Abel polynomials arising from umbral calculus.

MSC:05A10, 05A19.

1 Introduction

Let ℱ be the set of all formal power series in the variable t over ℂ with

F= { f ( t ) = ∑ k = 0 ∞ a k k ! t k | a k ∈ C } .
(1.1)

Let us assume that ℙ is the algebra of polynomials in the variable x over ℂ and P ∗ is the vector space of all linear functionals on ℙ. 〈L|p(x)〉 denotes the action of the linear functional L on a polynomial p(x), and we remind that the vector space structure on P ∗ is defined by

〈 L + M | p ( x ) 〉 = 〈 L | p ( x ) 〉 + 〈 M | p ( x ) 〉 , 〈 c L | p ( x ) 〉 = c 〈 L | p ( x ) 〉 ,

where c is a complex constant (see [1–4]).

The formal power series

f(t)= ∑ k = 0 ∞ a k k ! t k ∈F
(1.2)

defines a linear functional on â„™ by setting

〈 f ( t ) | x n 〉 = a n ,for all n∈ Z + =N∪{0}.
(1.3)

Thus, by (1.2) and (1.3), we get

〈 t k | x n 〉 =n! δ n , k (n,k≥0),
(1.4)

where δ n , k is the Kronecker symbol (see [3]).

For f L (t)= ∑ k = 0 ∞ 〈 L | x k 〉 k ! t k , from (1.4), we have

〈 f L ( t ) | x n 〉 = 〈 L | x n 〉 ,n≥0.
(1.5)

By (1.5), we get L= f L (t). The map L↦ f L (t) is a vector space isomorphism from P ∗ onto ℱ. So, ℱ denotes both the algebra of formal power series in t and the vector space of all linear functionals on ℙ, and so an element f(t) of ℱ is thought of as both a formal power series and a linear functional (see [1–3]). We call ℱ the umbral algebra, and the study of umbral algebra is called umbral calculus (see [1–3]).

The order o(f(t)) of the nonzero power series f(t) is the smallest integer k for which the coefficient of t k does not vanish. If o(f(t))=1, then f(t) is called a delta series. If o(f(t))=0, then f(t) is called an invertible series (see [3]).

Let S n (x) be polynomials in the variable x with degree n, and let o(f(t))=1 and o(g(t))=0. Then there exists a unique sequence S n (x) such that 〈g(t)f ( t ) k | S n (x)〉=n! δ n , k , where n,k≥0. The sequence S n (x) is called the Sheffer sequence for (g(t),f(t)), which is denoted by S n (x)∼(g(t),f(t)) (see [3]).

For f(t),g(t)∈F, we have

f(t)= ∑ k = 0 ∞ 〈 f ( t ) | x k 〉 k ! t k ,p(x)= ∑ k = 0 ∞ 〈 t k | p ( x ) 〉 k ! x k ,
(1.6)

and

〈 f ( t ) g ( t ) | p ( x ) 〉 = 〈 f ( t ) | g ( t ) p ( x ) 〉 = 〈 g ( t ) | f ( t ) p ( x ) 〉 (see [3]).
(1.7)

By (1.6), we get

d k p ( x ) d x k | x = 0 = p ( k ) (0)= 〈 t k | p ( x ) 〉 and 〈 1 | p ( k ) ( x ) 〉 = p ( k ) (0).
(1.8)

Thus, from (1.8), we have

t k p(x)= p ( k ) (x)= d k p ( x ) d x k (see [1–3]).
(1.9)

For S n (x)∼(g(t),f(t)), the following equations from (1.10) to (1.14) are well known in [3]:

(1.10)
(1.11)
(1.12)
(1.13)

where f ¯ (t) is the compositional inverse of f(t), and

S n (x+y)= ∑ k = 0 n ( n k ) p k (y) S n − k (x)= ∑ k = 0 n ( n k ) p k (x) S n − k (y),
(1.14)

where p k (y)=g(t) S k (y)∼(1,f(t)).

The Euler polynomials of order r are defined by the generating function to be

( 2 e t + 1 ) r e x t = e E ( r ) ( x ) t = ∑ n = 0 ∞ E n ( r ) ( x ) n ! t n (see [1–3, 5–16])
(1.15)

with the usual convention about replacing ( E ( r ) ( x ) ) n by E n ( r ) (x). In the special case, x=0, E n ( r ) (0)= E n ( r ) are called the Euler numbers of order r.

As is well known, the higher-order Bernoulli polynomials are also defined by the generating function to be

( t e t − 1 ) r e x t = e B ( r ) ( x ) t = ∑ n = 0 ∞ B n ( r ) ( x ) n ! t n (see [1–3, 5–16])
(1.16)

with the usual convention about replacing ( B ( r ) ( x ) ) n by B n ( r ) (x). In the special case, x=0, B n ( r ) (0)= B n ( r ) are called the Bernoulli numbers of order r.

Recently, several researchers have studied the umbral calculus related to special polynomials. In this paper, we derive some interesting identities related to Bernoulli, Euler, and Abel polynomials arising from umbral calculus.

2 Some identities of special polynomials

It is known [3] that

x B n − 1 ( n a ) (x)∼ ( 1 , ( e t − 1 t ) a t ) , x n ∼(1,t),
(2.1)

where n∈N and a≠0. From (2.1), we have

x n = x ( e t − 1 t ) a n x − 1 x B n − 1 ( n a ) ( x ) = x ( e t − 1 t ) a n B n − 1 ( n a ) ( x ) = x ∑ l = 0 ∞ ( a n ) ! ( l + a n ) ! S 2 ( l + a n , a n ) t l B n − 1 ( n a ) ( x ) = x ∑ l = 0 n − 1 ( a n ) ! ( l + a n ) ! S 2 ( l + a n , a n ) ( n − 1 ) l B n − 1 − l ( n a ) ( x ) ,
(2.2)

where S 2 (n,l) is the Stirling number of the second kind. Therefore, by (2.2), we obtain the following theorem.

Theorem 2.1 For n∈N and a≠0, we have

x n − 1 = ∑ l = 0 n − 1 ( a n ) ! ( l + a n ) ! S 2 (l+an,an) ( n − 1 ) l B n − 1 − l ( n a ) (x),

where ( a ) n =a(a−1)⋯(a−n+1).

In [3], we note that

S n (x)= ∑ k = 1 n ( − a n n − k ) ( n − 1 ) n − k x k ∼ ( 1 , t ( 1 + t ) a ) ,
(2.3)

and

ϕ n (x)= ∑ k = 0 n S 2 (n,k) x k ∼ ( 1 , log ( 1 + t ) ) ,
(2.4)

where a≠0.

For n≥1, we have

ϕ n ( x ) = x ( t ( 1 + t ) a log ( 1 + t ) ) n x − 1 S n ( x ) = x ( t ( 1 + t ) a log ( 1 + t ) ) n ∑ l = 1 n ( − a n n − l ) ( n − 1 ) n − l x l − 1 .
(2.5)

The Bernoulli polynomials b n (x) of the second kind are defined by the generating function to be

t log ( 1 + t ) ( 1 + t ) x = ∑ k = 0 ∞ b k (x) t k k ! (see [3]).
(2.6)

By (2.5) and (2.6), we get

ϕ n ( x ) = ∑ l = 1 n ( − a n n − l ) ( n − 1 ) n − l x ( t ( 1 + t ) a log ( 1 + t ) ) n x l − 1 = ∑ l = 1 n ( − a n n − l ) ( n − 1 ) n − l x ( ∑ k = 0 ∞ b k ( a ) k ! t k ) n x l − 1 = ∑ l = 1 ∞ ( − a n n − l ) ( n − 1 ) n − l x ∑ k = 0 ∞ ( ∑ l 1 + ⋯ + l n = k ( k l 1 , … , l n ) b l 1 ( a ) ⋯ b l n ( a ) ) t k k ! x l − 1 = ∑ l = 1 n ( − a n n − l ) ( n − 1 ) n − l x ∑ k = 0 l − 1 ( ∑ l 1 + ⋯ + l n = k ( k l 1 , … , l n ) b l 1 ( a ) ⋯ b l n ( a ) ) ( l − 1 ) k k ! x l − 1 − k = ∑ l = 1 n ∑ k = 0 l − 1 ∑ l 1 + ⋯ + l n = k ( − a n n − l ) ( n − 1 ) n − l ( l − 1 k ) ( k l 1 , … , l n ) b l 1 ( a ) ⋯ b l n ( a ) x l − k = ∑ l = 1 n ∑ m = 1 l ∑ l 1 + ⋯ + l n = l − m ( − a n n − l ) ( n − 1 ) n − l ( l − 1 m − 1 ) ( l − m l 1 , … , l n ) b l 1 ( a ) ⋯ b l n ( a ) x m = ∑ m = 1 n { ∑ l = m n ∑ l 1 + ⋯ + l n = l − m ( − a n n − l ) ( n − 1 ) n − l ( l − 1 m − 1 ) ( l − m l 1 , … , l n ) × b l 1 ( a ) ⋯ b l n ( a ) } x m .
(2.7)

Therefore, by (2.4) and (2.7), we obtain the following theorem.

Theorem 2.2 For a≠0, n≥1 with 1≤m≤n, we have

S 2 (n,m)= ∑ l = m n ∑ l 1 + ⋯ + l n = l − m ( − a n n − l ) ( n − 1 ) n − l ( l − 1 m − 1 ) ( l − m l 1 , … , l n ) b l 1 (a)⋯ b l n (a).

It is well known (see [3]) that

( t log ( 1 + t ) ) n ( 1 + t ) x − 1 = ∑ k = 0 ∞ B k ( k − n + 1 ) (x) t k k ! .
(2.8)

Thus, by (2.8), we get

( t ( 1 + t ) a log ( 1 + t ) ) n = ∑ k = 0 ∞ B k ( k − n + 1 ) (an+1) t k k ! ,
(2.9)

and

( t ( 1 + t ) a log ( 1 + t ) ) n = ∑ k = 0 ∞ ( ∑ l 1 + ⋯ + l n = k ( k l 1 , … , l n ) b l 1 ( a ) ⋯ b l n ( a ) ) t k k ! .
(2.10)

Therefore, by (2.9) and (2.10), we obtain the following lemma.

Lemma 2.3 For n,k∈ Z + , we have

∑ l 1 + ⋯ + l n = k ( k l 1 , … , l n ) b l 1 (a)⋯ b l n (a)= B k ( k − n + 1 ) (an+1).

Let us consider the following sequences:

S n ( x ) ∼ ( 1 , ( e t + 1 2 ) a t ) ( a ∈ R ) , x n ∼ ( 1 , t ) ( n ≥ 0 ) .
(2.11)

Then from (2.11), we have

S n ( x ) = x ( 2 e t + 1 ) a n x − 1 x n = x ( 2 e t + 1 ) a n x n − 1 = x E n − 1 ( a n ) ( x ) .
(2.12)

Therefore, by (2.12), we obtain the following proposition.

Proposition 2.4 For a∈R, n∈N, we have

x E n − 1 ( a n ) (x)∼ ( 1 , ( e t + 1 2 ) a t ) .

The Abel sequence is given by

A n (x;b)=x ( x − b n ) n − 1 ∼ ( 1 , t e b t ) (b≠0).
(2.13)

By Proposition 2.4 and (2.13), we get

x E n − 1 ( n a ) ( x ) = x ( t e b t ( e t + 1 2 ) a t ) n x − 1 A n ( x ; b ) = x ( 2 e t + 1 ) a n e b n t x − 1 A n ( x ; b ) = x ( ∑ k = 0 ∞ E ( a n ) ( b n ) k ! t k ) ( x − b n ) n − 1 = x ∑ k = 0 n − 1 ( n − 1 k ) E k ( a n ) ( b n ) ( x − b n ) n − 1 − k .
(2.14)

Therefore, by (2.14), we obtain the following theorem.

Theorem 2.5 For n∈N and a∈R, we have

E n − 1 ( a n ) ( x ) = ∑ k = 0 n − 1 ( n − 1 k ) E k ( a n ) ( b n ) ( x − b n ) n − 1 − k = ∑ k = 0 n − 1 ( n − 1 k ) E n − 1 − k ( a n ) ( b n ) ( x − b n ) k .

Let us consider the following Sheffer sequences:

G n ( x ; a , b ) ∼ ( 1 , e a t ( e b t − 1 ) ) ( b ≠ 0 ) , A n ( x ; c + a ) ∼ ( 1 , t e ( c + a ) t ) ( c + a ≠ 0 ) .
(2.15)

By (2.15), we note that

G n (x;a,b)= x b ( x − a n b − 1 ) n − 1 .
(2.16)

For n≥1, from (2.15), we have

A n ( x ; c + a ) = x ( e a t ( e b t − 1 ) t e ( c + a ) t ) n x − 1 G n ( x ; a , b ) = x ( e b t − 1 t e c t ) n x − 1 G n ( x ; a , b ) ,
(2.17)

and

( e t − 1 ) n e t x t n = 1 t n ( n ! ∑ j = n ∞ S 2 ( j , n ) t j j ! ) ( ∑ l = 0 ∞ ( − 1 ) l l ! x l t l ) = ( n ! ∑ j = 0 ∞ S 2 ( j + n , n ) t j ( j + n ) ! ) ( ∑ l = 0 ∞ ( − 1 ) l x l l ! t l ) = ∑ k = 0 ∞ ( ∑ j = 0 k S 2 ( j + n , n ) ( − 1 ) k − j ( k j ) ( j + n j ) x k − j ) t k k ! .
(2.18)

From (2.18), we can derive the following equation (2.19):

( e b t − 1 ) n e b t ( c b n ) ( b t ) n = ∑ k = 0 ∞ ( ∑ j = 0 k ( − 1 ) k − j ( k j ) S 2 ( j + n , n ) ( j + n j ) ( c b n ) k − j ) ( b t ) k k ! .
(2.19)

Thus, by (2.19), we get

( e b t − 1 t e c t ) n = b n ∑ k = 0 ∞ ( ∑ j = 0 k ( − c n ) k − j ( k j ) S 2 ( j + n , n ) ( j + n j ) b j ) t k k ! .
(2.20)

From (2.16), (2.17), and (2.20), we can derive the following equation (2.21):

(2.21)

and

( x − a n b − 1 ) n − 1 = ∑ l = 0 n − 1 S 1 (n−1,l) ( x − a n b − 1 ) l ,
(2.22)

where S 1 (n,l) is the Stirling number of the first kind. By (2.22), we get

t k k ! ( x − a n b − 1 ) n − 1 = ∑ l = k n − 1 S 1 (n−1,l) ( l k ) ( x − a n b − 1 ) l − k b − k .
(2.23)

Thus, by (2.21) and (2.23), we get

(2.24)

From (1.14), we have

A n (x;c+a)=x ( x − ( c + a ) n ) n − 1 .
(2.25)

Therefore, by (2.24) and (2.25), we obtain the following theorem.

Theorem 2.6 For n≥1, b≠0, c+a≠0, we have

( x − ( c + a ) n ) n − 1 = b n − 1 ∑ k = 0 n − 1 ∑ j = 0 k ∑ l = k n − 1 ( − c n b ) k − j ( k j ) ( l k ) S 2 ( j + n , n ) S 1 ( n − 1 , l ) ( j + n j ) ( x − a n b − 1 ) l − k .

References

  1. Dere R, Simsek Y: Applications of umbral algebra to some special polynomials. Adv. Stud. Contemp. Math - Jang’jun Math. Soc. 2012, 22: 433–438.

    MathSciNet  Google Scholar 

  2. Kim DS, Kim T: Some identities of Frobenius-Euler polynomials arising from umbral calculus. Adv. Differ. Equ. 2012., 2012: Article ID 196. doi:10.1186/1687–1847–2012–196

    Google Scholar 

  3. Roman S: The Umbral Calculus. Dover, New York; 2005.

    Google Scholar 

  4. Dere R, Simsek Y: Genocchi polynomials associated with the Umbral algebra. Appl. Math. Comput. 2011, 218: 756–761. 10.1016/j.amc.2011.01.078

    Article  MathSciNet  Google Scholar 

  5. Araci S, Aslan N, Seo J: A note on the weighted twisted Dirichlet’s type q -Euler numbers and polynomials. Honam Math. J. 2011, 33(3):311–320. 10.5831/HMJ.2011.33.3.311

    Article  MathSciNet  Google Scholar 

  6. Acikgoz M, Erdal D, Araci S: A new approach to q -Bernoulli numbers and q -Bernoulli polynomials related to q -Bernstein polynomials. Adv. Differ. Equ. 2010., 2010: Article ID 951764

    Google Scholar 

  7. Bayad A: Modular properties of elliptic Bernoulli and Euler functions. Adv. Stud. Contemp. Math - Jang’jun Math. Soc. 2010, 20(3):389–401.

    MathSciNet  Google Scholar 

  8. Can M, Cenkci M, Kurt V, Simsek Y: Twisted Dedekind type sums associated with Barnes’ type multiple Frobenius-Eulerl-functions. Adv. Stud. Contemp. Math - Jang’jun Math. Soc. 2009, 18(2):135–160.

    MathSciNet  Google Scholar 

  9. Carlitz L: The product of two Eulerian polynomials. Math. Mag. 1963, 368: 37–41.

    Article  Google Scholar 

  10. Ding D, Yang J: Some identities related to the Apostol-Euler and Apostol-Bernoulli polynomials. Adv. Stud. Contemp. Math - Jang’jun Math. Soc. 2010, 20(1):7–21.

    MathSciNet  Google Scholar 

  11. Kim T: New approach to q -Euler, Genocchi numbers and their interpolation functions. Adv. Stud. Contemp. Math - Jang’jun Math. Soc. 2009, 18(2):105–112.

    Google Scholar 

  12. Ozden H, Cangul IN, Simsek Y: Remarks on q -Bernoulli numbers associated with Daehee numbers. Adv. Stud. Contemp. Math - Jang’jun Math. Soc. 2009, 18(1):41–48.

    MathSciNet  Google Scholar 

  13. Rim S-H, Joung J, Jin J-H, Lee S-J: A note on the weighted Carlitz’s type q -Euler numbers and q -Bernstein polynomials. Proc. Jangjeon Math. Soc. 2012, 15: 195–201.

    MathSciNet  Google Scholar 

  14. Ryoo C: Some relations between twisted q -Euler numbers and Bernstein polynomials. Adv. Stud. Contemp. Math - Jang’jun Math. Soc. 2011, 21(2):217–223.

    MathSciNet  Google Scholar 

  15. Simsek Y: Special functions related to Dedekind-type DC-sums and their applications. Russ. J. Math. Phys. 2010, 17: 495–508. 10.1134/S1061920810040114

    Article  MathSciNet  Google Scholar 

  16. Simsek Y: Generating functions of the twisted Bernoulli numbers and polynomials associated with their interpolation functions. Adv. Stud. Contemp. Math - Jang’jun Math. Soc. 2008, 16(2):251–278.

    MathSciNet  Google Scholar 

Download references

Acknowledgements

The authors express their sincere gratitude to the referees for their valuable suggestions and comments. This paper is supported in part by the Research Grant of Kwangwoon University in 2013.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Taekyun Kim.

Additional information

Competing interests

The authors declare that they have no competing interests.

Authors’ contributions

All authors contributed equally to the manuscript and typed, read, and approved the final manuscript.

Rights and permissions

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

Reprints and permissions

About this article

Cite this article

Kim, D.S., Kim, T., Lee, SH. et al. Some identities of Bernoulli, Euler and Abel polynomials arising from umbral calculus. Adv Differ Equ 2013, 15 (2013). https://doi.org/10.1186/1687-1847-2013-15

Download citation

  • Received:

  • Accepted:

  • Published:

  • DOI: https://doi.org/10.1186/1687-1847-2013-15

Keywords