1 Introduction

Throughout this paper we will assume q to be a fixed real number between 0 and 1. We define the q-shifted factorials by

( a : q ) 0 =1, ( a : q ) n = i = 0 n 1 ( 1 a q i ) , ( a : q ) = i = 0 ( 1 a q i ) .
(1.1)

If x is a classical object, such as a complex number, its q-version is defined as [ x ] q = 1 q x 1 q . We now introduce the q-extension of exponential function as follows:

e q (z)= n = 0 z n [ n ] q ! = 1 ( ( 1 q ) z : q ) (see [1–4]),
(1.2)

where zC with |z|<1.

The Jackson definite q-integral of the function f is defined by

0 x f(t) d q t=(1q) a = 0 f ( q a x ) x q a (see [1, 2, 5]).
(1.3)

The q-difference operator D q is defined by

D q f(x)= d q f ( x ) d q x ={ f ( x ) f ( q x ) ( 1 q ) x if  x 0 , d f ( x ) d x if  x = 0 ,
(1.4)

where

lim q 1 D q f(x)= d f ( x ) d x (see [1, 2, 4, 6]).

By using an exponential function e q (x), Hegazi and Mansour defined q-Bernoulli polynomials as follows:

n = 0 B n , q (x) t n [ n ] q ! = t e q ( t ) 1 e q (xt)(see [1, 2, 4, 7]).
(1.5)

In the special case, x=0, B n , q (0)= B n , q are called the n th q-Bernoulli numbers.

From (1.5), we can easily derive the following equation:

B n , q (x)= l = 0 n ( n l ) q B n l , q x l = l = 0 n ( n l ) q B l , q x n l ,
(1.6)

where

( n l ) q = [ n ] q ! [ n l ] q ! [ l ] q ! = [ n ] q [ n 1 ] q [ n l + 1 ] q [ l ] q ! (see [2, 7]).

In the next section, we will consider new q-extensions of Euler numbers and polynomials by using the method of Hegazi and Mansour. More than five decades ago, Carlitz [8] defined a q-extension of Euler polynomials. In a recent paper (see [3]), Kupershmidt constructed reflection symmetries of q-Bernoulli polynomials which differ from Carlitz’s q-Bernoulli numbers and polynomials. By using the method of Kupershmidt, Hegazi and Mansour also introduced a new q-extension of Bernoulli numbers and polynomials (see [1, 3, 4]). From the q-exponential function, Kurt and Cenkci derived some interesting new formulae of q-extension of Genocchi polynomials. Recently, several authors have studied various q-extensions of Bernoulli and Euler polynomials (see [16, 811]). Let ℂ be the complex number field, and let ℱ be the set of all formal power series in variable t over ℂ with

F= { f ( t ) = k = 0 a k [ k ] q ! t k | a k C } .
(1.7)

Let P=C[t] and let P be the vector space of all linear functionals on ℙ. L|p(x) denotes the action of linear functional L on the polynomial p(x), and it is well known that the vector space operations on P are 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 [7, 9, 11]).

For f(t)= k = 0 a k [ k ] q ! t k F, we define the linear functional on ℙ by setting

f ( t ) | x n = a n for all n0.
(1.8)

From (1.7) and (1.8), we note that

t k | x n = [ n ] q ! δ n , k (n,k0),
(1.9)

where δ n , k is the Kronecker symbol.

Let us assume that f L (t)= k = 0 L| x n t k k ! . Then by (1.9) we easily see that f L (t)| x n =L| x n . That is, f L (t)=L. Additionally, the map L f L (t) is a vector space isomorphism from P onto ℱ. Henceforth ℱ 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 ℱ will be thought of as a formal power series and a linear functional. We call it the q-umbral algebra. The q-umbral calculus is the study of q-umbral algebra. By (1.2) and (1.3), we easily see that e q (yt)| x n = y n and so e q (yt)|p(x)=p(y) for p(x)P. The order o(f(t)) of the power series f(t)0 is the smallest integer for which a k does not vanish. If o(f(t))=0, then f(t) is called an invertible series. If o(f(t))=1, thenf(t) is called a delta series (see [7, 9, 11, 12]). For f(t),g(t)F, we have f(t)g(t)|p(x)=f(t)|g(t)p(x)=g(t)|f(t)p(x). Let f(t)F and p(x)P. Then we have

f(t)= k = 0 f ( t ) | x k t k [ k ] q ! ,p(x)= k = 0 t k | p ( x ) x k [ k ] q ! (see [12]).
(1.10)

From (1.10), we have

p ( k ) (x)= D q k p(x)= l = k t l | p ( x ) [ l ] q ! [ l ] q [ l k + 1 ] q x l k .
(1.11)

By (1.11), we get

p ( k ) (0)= t k | p ( x ) and 1 | p ( k ) ( x ) = p ( k ) (0).
(1.12)

Thus from (1.12), we note that

t k p(x)= p ( k ) (x)= D q k p(x).
(1.13)

Let f(t),g(t)F with o(f(t))=1 and o(g(t))=0. Then there exists a unique sequence S n (x) (deg S n (x)=n) of polynomials such that g(t)f ( t ) k | S n (x)= [ n ] q ! δ n , k (n,k0). The sequence S n (x) is called the q-Sheffer sequence for (g(t),f(t)) which is denoted by S n (x)(g(t),f(t)). Let S n (x)(g(t),f(t)). For h(t)F and p(x)P, we have

h(t)= k = 0 h ( t ) | S k ( x ) [ k ] q ! g(t)f ( t ) k ,p(x)= k = 0 g ( t ) f ( t ) k | p ( x ) [ k ] q ! S k (x),
(1.14)

and

1 g ( f ¯ ( t ) e q ( y f ¯ ( t ) ) = k = 0 S k ( y ) [ k ] q ! t k for all yC,
(1.15)

where f ¯ (t) is the compositional inverse of f(t) (see [7, 12]).

Recently, Araci-Acikgoz-Sen derived some new interesting properties on the new family of q-Euler numbers and polynomials from some applications of umbral algebra (see [9]). The properties of q-Euler and q-Bernoulli polynomials seem to be of interest and worthwhile in the areas of both number theory and mathematical physics. In this paper, we develop the new method of q-umbral calculus due to Roman and study a new q-extension of Euler numbers and polynomials which are derived from q-umbral calculus. Finally, we give new explicit formulas on q-Euler polynomials related to Hegazi-Mansour’s q-Bernoulli polynomials.

2 q-Euler numbers and polynomials

We consider the new q-extension of Euler polynomials which are generated by the generating function to be

2 e q ( t ) + 1 e q (xt)= n = 0 E n , q (x) t n [ n ] q ! .
(2.1)

In the special case, x=0, E n , q (0)= E n , q are called the n th q-Euler numbers. From (2.1), we note that

E n , q (x)= l = 0 n ( n l ) q E l , q x n l = l = 0 n ( n l ) q E n l , q x l .
(2.2)

By (2.1), we easily get

E 0 , q =1, E n , q (1)+ E n , q =2 δ 0 , n .
(2.3)

For example, E 0 , q =1, E 1 , q = 1 2 , E 2 , q = q 1 4 , E 3 , q = q + q 2 1 4 + ( 1 q ) [ 3 ] q 8 , . From (1.15) and (2.1), we have

E n , q (x) ( e q ( t ) + 1 2 , t )
(2.4)

and

2 e q ( t ) + 1 x n = E n , q (x)(n0).
(2.5)

Thus, by (1.13) and (2.5), we get

t E n , q (x)= 2 e q ( t ) + 1 t x n = [ n ] q 2 e q ( t ) + 1 x n 1 = [ n ] q E n 1 , q (x)(n0).
(2.6)

Indeed, by (1.9), we get

e q ( t ) + 1 2 t k | E n , q ( x ) = [ k ] q ! 2 ( n k ) q e q ( t ) + 1 | E n k , q ( x ) = [ k ] q ! 2 ( n k ) q ( E n k , q ( 1 ) + E n k , q ) .
(2.7)

From (2.4), we have

( e q ( t ) + 1 2 ) t k | E n , q ( x ) = [ n ] q ! δ n , k .
(2.8)

Thus, by (2.7) and (2.8), we get

0= E n k , q (1)+ E n k , q = l = 0 n k ( n k l ) q E l , q + E n k , q (n,k Z 0  with n>k).
(2.9)

This is equivalent to

2 E n k , q = l = 0 n k 1 ( n k l ) q E l , q ,where n,k Z 0  with n>k.
(2.10)

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

Lemma 2.1 For n1, we have

2 E n , q = l = 0 n 1 ( n l ) q E l , q .

From (2.2) we have

x x + y E n , q ( u ) d q u = l = 0 n ( n l ) q E n l , q 1 [ l + 1 ] q { ( x + y ) l + 1 x l + 1 } = 1 [ n + 1 ] q l = 0 n ( n + 1 l + 1 ) q E n l , q { ( x + y ) l + 1 x l + 1 } = 1 [ n + 1 ] q l = 1 n + 1 ( n + 1 l ) q E n + 1 l , q { ( x + y ) l x l } = 1 [ n + 1 ] q l = 0 n + 1 ( n + 1 l ) q E n + 1 l , q { ( x + y ) l x l } = 1 [ n + 1 ] q { E n + 1 , q ( x + y ) E n + 1 , q ( x ) } .
(2.11)

Thus, by (2.11), we get

e q ( t ) 1 t | E n , q ( x ) = 1 [ n + 1 ] q e q ( t ) 1 t | t E n + 1 , q ( x ) = 1 [ n + 1 ] q e q ( t ) 1 | E n + 1 , q ( x ) = 1 [ n + 1 ] q { E n + 1 , q ( 1 ) E n + 1 , q } = 0 1 E n , q ( u ) d q u .
(2.12)

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

Theorem 2.2 For n0, we have

e q ( t ) 1 t | E n , q ( x ) = 0 1 E n , q (u) d q u.

Let

P n = { p ( x ) C [ x ] | deg p ( x ) n } .
(2.13)

For p(x) P n , let us assume that

p(x)= k = 0 n b k , q E k , q (x).
(2.14)

Then, by (2.4), we get

( e q ( t ) + 1 2 ) t k | E n , q ( x ) = [ n ] q ! δ n , k .
(2.15)

From (2.14) and (2.15), we can derive the following equation:

( e q ( t ) + 1 2 ) t k | p ( x ) = l = 0 n b l , q ( e q ( t ) + 1 2 ) t k | E l , q ( x ) = l = 0 n b l , q [ l ] q ! δ l , k = [ k ] q ! b k , q .
(2.16)

Thus, by (2.16), we get

b k , q = 1 [ k ] q ! ( e q ( t ) + 1 2 ) t k | p ( x ) = 1 2 [ k ] q ! ( e q ( t ) + 1 ) t k | p ( x ) = 1 2 [ k ] q ! e q ( t ) + 1 | p ( k ) ( x ) = 1 2 [ k ] q ! { p ( k ) ( 1 ) + p ( k ) ( 0 ) } ,
(2.17)

where p ( k ) (x)= D q k p(x).

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

Theorem 2.3 For p(x) P n , let p(x)= k = 0 n b k , q E k , q (x). Then we have

b k , q = 1 2 [ k ] q ! ( e q ( t ) + 1 ) t k | p ( x ) = 1 2 [ k ] q ! { p ( k ) ( 1 ) + p ( k ) ( 0 ) } ,

where p ( k ) (x)= D q k p(x).

From (1.5), we note that

B n , q (x) ( e q ( t ) 1 t , t ) (n0).
(2.18)

Let us take p(x)= B n , q (x) P n . Then B n , q (x) can be represented as a linear combination of { E 0 , q (x), E 1 , q (x),, E n , q (x)} as follows:

B n , q (x)=p(x)= k = 0 n b k , q E k , q (x)(n0),
(2.19)

where

b k , q = 1 2 [ k ] q ! ( e q ( t ) + 1 ) t k | B n , q ( x ) = [ n ] q [ n 1 ] q [ n k + 1 ] q 2 [ k ] q ! e q ( t ) + 1 | B n k , q ( x ) = 1 2 ( n k ) q e q ( t ) + 1 | B n k , q ( x ) = 1 2 ( n k ) q { B n k , q ( 1 ) + B n k , q } .
(2.20)

From (1.5), we can derive the following recurrence relation for the q-Bernoulli numbers:

t = ( l = 0 B l , q t l [ l ] q ! ) ( e q ( t ) 1 ) = n = 0 ( l = 0 n ( n l ) q B l , q ) t n [ n ] q ! n = 0 B n , q t n [ n ] q ! = n = 0 ( B n , q ( 1 ) B n , q ) t n [ n ] q ! .
(2.21)

Thus, by (2.21), we get

B 0 , q =1, B n , q (1) B n , q ={ 1 if  n = 1 , 0 if  n > 1 .
(2.22)

For example, B 0 , q =1, B 1 , q = 1 [ 2 ] q , B 2 , q = q 2 [ 3 ] q [ 2 ] q , .

By (2.19), (2.20) and (2.22), we get

B n , q ( x ) = b n , q E n , q ( x ) + b n 1 , q E n 1 , q ( x ) + k = 0 n 2 b k , q E k , q ( x ) = E n , q ( x ) + [ n ] q 2 ( 1 2 [ 2 ] q ) E n 1 , q ( x ) + k = 0 n 2 ( n k ) q B n k , q E k , q ( x ) = E n , q ( x ) [ n ] q ( 1 q ) 2 [ 2 ] q E n 1 , q ( x ) + k = 0 n 2 ( n k ) q B n k , q E k , q ( x ) .
(2.23)

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

Theorem 2.4 For n2, we have

B n , q (x)= E n , q (x)+ [ n ] q ( q 1 ) 2 [ 2 ] q E n 1 , q (x)+ k = 0 n 2 ( n k ) q B n k , q E k , q (x).

For r Z 0 , the q-Euler polynomials, E n , q ( r ) (x), of order r are defined by the generating function to be

( 2 e q ( t ) + 1 ) r e q ( x t ) = ( 2 e q ( t ) + 1 ) × × ( 2 e q ( t ) + 1 ) e q ( x t ) r - times = n = 0 E n , q ( r ) ( x ) t n [ n ] q ! .
(2.24)

In the special case, x=0, E n , q ( r ) (0)= E n , q ( r ) are called the n th q-Euler numbers of order r.

Let

g r (t)= ( e q ( t ) + 1 2 ) r (r Z 0 ).
(2.25)

Then g r (t) is an invertible series. From (2.24) and (2.25), we have

n = 0 E n , q ( r ) (x) t n [ n ] q ! = 1 g r ( t ) e q (xt)= n = 0 1 g r ( t ) x n t n [ n ] q ! .
(2.26)

By (2.26), we get

E n , q ( r ) (x)= 1 g r ( t ) x n ,
(2.27)

and

t E n , q ( r ) (x)= 1 g r ( t ) t x n = [ n ] q 1 g r ( t ) x n 1 = [ n ] q E n 1 , q ( r ) (x).
(2.28)

Thus, by (2.26), (2.27) and (2.28), we see that

E n , q ( r ) (x) ( ( e q ( t ) + 1 2 ) r , t ) .
(2.29)

By (1.9) and (2.24), we get

( 2 e q ( t ) + 1 ) r e q ( y t ) | x n = E n , q ( r ) (y)= l = 0 n ( n l ) q E n l , q ( r ) y l .
(2.30)

Thus, we have

( 2 e q ( t ) + 1 ) r | x n = m = 0 ( i 1 + + i r = m E i 1 , q E i r , q [ i 1 ] q ! [ i r ] q ! ) t m | x n = i 1 + + i r = n [ n ] q ! [ i 1 ] q ! [ i r ] q ! E i 1 , q E i r , q = i 1 + + i r = n ( n i 1 , , i r ) q E i 1 , q E i r , q ,
(2.31)

where ( n i 1 , , i r ) q = [ n ] q ! [ i 1 ] q ! [ i r ] q ! .

By (2.30), we easily get

( 2 e q ( t ) + 1 ) r | x n = E n , q ( r ) .
(2.32)

Therefore, by (2.31) and (2.32), we obtain the following theorem.

Theorem 2.5 For n0, we have

E n , q ( r ) = i 1 + + i r = n ( n i 1 , , i r ) q E i 1 , q E i r , q ,

where ( n i 1 , , i r ) q = [ n ] q ! [ i 1 ] q ! [ i r ] q ! .

Let us take p(x)= E n , q ( r ) (x) P n . Then, by Theorem 2.3, we get

E n , q ( r ) (x)=p(x)= k = 0 n b k , q E k , q (x),
(2.33)

where

b k , q = 1 2 [ k ] q ! ( e q ( t ) + 1 ) t k | p ( x ) = 1 2 [ k ] q ! ( e q ( t ) + 1 ) | t k p ( x ) = ( n k ) q 2 ( e q ( t ) + 1 ) | E n k , q ( r ) ( x ) = ( n k ) q 2 { E n k , q ( r ) ( 1 ) + E n k , q ( r ) } .
(2.34)

From (2.24), we have

k = 0 { E n , q ( r ) ( 1 ) + E n , q ( r ) } t n [ n ] q ! = ( 2 e q ( t ) + 1 ) r ( e q ( t ) + 1 ) = 2 ( 2 e q ( t ) + 1 ) r 1 = 2 n = 0 E n , q ( r 1 ) t n [ n ] q ! .
(2.35)

By comparing the coefficients on the both sides of (2.35), we get

E n , q ( r ) (1)+ E n , q ( r ) =2 E n , q ( r 1 ) (n0).
(2.36)

Therefore, by (2.33), (2.34) and (2.36), we obtain the following theorem.

Theorem 2.6 For n Z 0 , r Z > 0 , we have

E n , q ( r ) (x)= k = 0 ( n k ) q E n k , q ( r 1 ) E k , q (x).

Let us assume that

p(x)= k = 0 n b k , q r E k , q ( r ) (x) P n .
(2.37)

By (2.29) and (2.37), we get

( e q ( t ) + 1 2 ) r t k | p ( x ) = l = 0 n b l , q r ( e q ( t ) + 1 2 ) r t k | E l , q ( r ) ( x ) = l = 0 n b l , q r [ l ] q ! δ l , k = [ k ] q ! b k , q r .
(2.38)

From (2.38), we have

b k , q r = 1 [ k ] q ! ( e q ( t ) + 1 2 ) r t k | p ( x ) = 1 2 r [ k ] q ! ( e q ( t ) + 1 ) r | t k p ( x ) = 1 2 r [ k ] q ! l = 0 r ( r l ) m 0 ( i 1 + + i l = m ( m i 1 , , i l ) q ) 1 [ m ] q ! 1 | t m + k p ( x ) = 1 2 r [ k ] q ! l = 0 r ( r l ) m 0 i 1 + + i l = m ( m i 1 , , i l ) q 1 [ m ] q ! p ( m + k ) ( 0 ) .
(2.39)

Therefore by (2.37) and (2.39), we obtain the following theorem.

Theorem 2.7 For n0, let p(x)= k = 0 n b k , q r E k , q ( r ) (x) P n .

Then we have

b k , q r = 1 2 r [ k ] q ! = ( e q ( t ) + 1 ) r t k | p ( x ) = 1 2 r [ k ] q ! m 0 l = 0 r ( r l ) i 1 + + i l = m ( m i 1 , , i l ) q 1 [ m ] q ! p ( m + k ) ( 0 ) ,

where p ( k ) (x)= D q k p(x).

Let us take p(x)= E n , q (x) P n . Then, by Theorem 2.7, we get

E n , q (x)=p(x)= k = 0 n b k , q r E k , q ( r ) (x),
(2.40)

where

b k , q = 1 2 r [ k ] q ! m = 0 n k l = 0 r ( r l ) i 1 + + i l = m ( m i 1 , , i l ) q × 1 [ m ] q ! [ n ] q [ n m k + 1 ] q E n m k , q = 1 2 r m = 0 n k l = 0 r ( r l ) i 1 + + i l = m ( m i 1 , , i l ) q × [ m + k ] q ! [ m ] q ! [ k ] q ! [ n ] q [ n m k + 1 ] q [ m + k ] q ! E n m k , q = 1 2 r m = 0 n k l = 0 r i 1 + + i l = m ( r l ) ( m i 1 , , i l ) q ( m + k m ) q ( n m + k ) q E n m k , q .
(2.41)

Therefore, by (2.40) and (2.41), we obtain the following theorem.

Theorem 2.8 For n,r0, we have

E n , q ( x ) = 1 2 r k = 0 n { m = 0 n k l = 0 r i 1 + + i l = m ( r l ) ( m i 1 , , i l ) q ( m + k m ) q ( n m + k ) q × E n m k , q } E k , q ( r ) ( x ) .

For r Z 0 , let us consider q-Bernoulli polynomials of order r which are defined by the generating function to be

( 2 e q ( t ) - 1 ) r e q ( x t ) = ( 2 e q ( t ) - 1 ) × × ( 2 e q ( t ) - 1 ) e q ( x t ) r - times = n = 0 B n , q ( r ) ( x ) t n [ n ] q ! .
(2.42)

In the special case, x=0, B n , q ( r ) (0)= B n , q ( r ) are called the n th q-Bernoulli numbers of order r. By (2.42), we easily get

B n , q ( r ) (x)= l = 0 n ( n l ) q B l , q ( r ) x n l P n .
(2.43)

Let us take p(x)= B n , q ( r ) (x) P n . Then, by Theorem 2.7, we get

B n , q ( r ) (x)=p(x)= k = 0 n b k , q r E k , q ( r ) (x),
(2.44)

where

b k , q r = 1 2 r [ k ] q ! ( e q ( t ) + 1 ) r t k | B n , q ( r ) ( x ) ) = 1 2 r [ k ] q ! m = 0 n k l = 0 r ( r l ) i 1 + + i l = m ( m i 1 , , i l ) q [ n ] q [ n m k + 1 ] q [ m ] q ! B n m k , q ( r ) = 1 2 r m = 0 n k l = 0 r i 1 + + i l = m ( r l ) ( m i 1 , , i l ) q ( m + k m ) q ( n m + k ) q B n m k , q ( r ) .
(2.45)

Therefore, by (2.44) and (2.45), we obtain the following theorem.

Theorem 2.9 For n,r0, we have

B n , q ( r ) ( x ) = 1 2 r k = 0 n { m = 0 n k l = 0 r i 1 + + i l = m ( r l ) ( m i 1 , , i l ) q ( m + k m ) q ( n m + k ) q × B n m k , q ( r ) } E k , q ( r ) ( x ) .

Remark Recently, Aral, Gupta and Agarwal introduced many interesting properties and applications of q-calculus which are related to this paper (see [13]).