Metrics 0

## Export Article

Axioms 2018, 7(2), 22; doi:10.3390/axioms7020022

Article
Special Numbers and Polynomials Including Their Generating Functions in Umbral Analysis Methods
Department of Mathematics, Faculty of Science University of Akdeniz, TR-07070 Antalya, Turkey
Received: 20 January 2018 / Accepted: 30 March 2018 / Published: 1 April 2018

## Abstract

:
In this paper, by applying umbral calculus methods to generating functions for the combinatorial numbers and the Apostol type polynomials and numbers of order k, we derive some identities and relations including the combinatorial numbers, the Apostol-Bernoulli polynomials and numbers of order k and the Apostol-Euler polynomials and numbers of order k. Moreover, by using p-adic integral technique, we also derive some combinatorial sums including the Bernoulli numbers, the Euler numbers, the Apostol-Euler numbers and the numbers $y 1 n , k ; λ$. Finally, we make some remarks and observations regarding these identities and relations.
Keywords:
Apostol-Bernoulli polynomials and numbers; Apostol-Euler polynomials and numbers; Sheffer sequences; Appell sequences; Fibonacci numbers; umbral algebra; p-adic integral
MSC:
05A40; 11B68; 11B73; 11B83; 11S80; 26C05; 30B10

## 1. Introduction

In order to give the results presented in this paper, we use two techniques which are p-adic integral technique and the umbral calculus technique. In [1,2,3,4,5], we constructed generating functions for families of combinatorial numbers which are used in counting techniques and problems and also computing negative order of the first and the second kind Euler numbers and other combinatorial sums. In this paper, by applying umbral algebra and umbral analysis methods and their operators to generating functions of the combinatorial numbers and the Apostol type polynomials and numbers, we give many identities and relations including the Fibonacci numbers, the combinatorial numbers, the Apostol-Bernoulli polynomials and numbers of higher order and the Apostol-Euler polynomials and numbers of higher order.
Throughout this paper, we use the following notations, definitions and relations.
Here and in the following, let $C$, $R$, $Z$, and $N$ be the sets of complex numbers, real numbers, integers, and positive integers, respectively, and let $N 0 : = N ∪ 0$. We assume $0 0 = 1$.
Moreover, throughout this paper, $log z$ is tacitly assumed to denote the principal branch of the many-valued function $log z$ with the imaginary part $log z$ constrained by
$− π < Im ( log z ) ≤ π$
(cf. [6,7,8,9]).
The Apostol-Bernoulli polynomials $B n k ( x , λ )$ of order k are defined by
$F B t , x ; λ , k = t λ e t − 1 k e t x = ∑ n = 0 ∞ B n k ( x , λ ) t n n ! ,$
where $λ$ is an arbitrary (real or complex) parameter and $x ∈ R$, and $| t | < 2 π$ when $λ = 1$ and $| t | < 2 π | log λ |$ when $λ ≠ 1$. Moreover, $B n k ( λ ) : = B n k ( 0 , λ )$ denote the Apostol-Bernoulli numbers of order. $B n k : = B n k ( 1 )$ denote the Bernoulli numbers of order k and also $B n : = B n 1$ denote the Bernoulli numbers (cf. see, for details, [6,8,9,10,11,12,13,14], and the references cited therein).
The Apostol-Euler polynomials $E n k ( x , λ )$ of order k are defined by
$F E t , x ; λ , k = 2 λ e t + 1 k e t x = ∑ n = 0 ∞ E n k ( x , λ ) t n n ! ,$
where $λ$ is an arbitrary (real or complex) parameter and $x ∈ R$, and $| t | < π$ when $λ = 1$ and $| t | < π | log λ |$ when $λ ≠ 1$. Moreover, $E n k ( λ ) : = E n k ( 0 , λ )$ denote the Apostol-Euler numbers of order k. $E n k : = E n k ( 1 )$ denote the Euler numbers of order k and also $E n : = E n 1$ denote the Euler numbers (cf. see, for details, [6,8,9,10,11,12,13,14,15], and the references cited therein).
The $λ$-array polynomials $S v n x ; λ$ are defined by
$F S ( t , x , v ; λ ) = λ e t − 1 v v ! e x t = ∑ n = 0 ∞ S v n x ; λ t n n !$
where $v ∈ N 0$ and $λ ∈ C$ (cf. [16]). Furthermore,
$S 2 n , v ; λ : = S v n 0 ; λ$
where, as usual, $S 2 n , v ; λ$ denote the $λ$-Stirling numbers (cf. [8,12]). Substituting $λ = 1$ into (3), we have the array polynomials:
$S v n x : = S v n x ; 1$
(cf. [16,17,18] and (Theorem 2 [19])).
In (cf. Equation (8) [1]), we defined the combinatorial numbers $y 1 n , k ; λ$ by means of the following generating function:
$F y 1 t , k ; λ = 1 k ! λ e t + 1 k = ∑ n = 0 ∞ y 1 n , k ; λ t n n !$
where $k ∈ N 0$ and $λ ∈ C$.
By using (4), we have
$y 1 n , k ; λ = 1 k ! ∑ j = 0 k k j j n λ j$
where $n ∈ N 0$ (cf. Equation (9) [1]).
Relationships between the $λ$-array polynomials $S v n x ; λ$ and the numbers $y 1 n , k ; λ$ and the Stirling numbers of the second kind $S 2 ( n , k )$ are given below, respectively:
$S k n 0 ; λ = S 2 n , v ; λ = − 1 k y 1 n , k ; − λ$
and
$S 2 ( n , k ) = − 1 k y 1 n , k ; − 1$
(cf. [1,17,20,21,22,23,24,25]).
The Fibonacci numbers $F j$ are defined by the following generating function
$t 1 − t − t 2 = ∑ n = 0 ∞ F n t n$
(cf. (p. 229. [26])). We need the following well-known formulas for the Fibonacci numbers. Let $λ = 1 + 5 2$ and $β = 1 − 5 2$. Let $j ∈ N$, we have
$λ j = λ F j + F j − 1$
and
$β j = β F j + F j − 1$
(cf. (p. 78, Lemma 5.1. [26])). Using the above identities, one easily derives the following Binet’s formula:
$F j = λ j − β j λ − β .$
Substituting $− n$ with $n ∈ N$, into the above equation, we easily have
$F − n = ( − 1 ) n + 1 F n$
(cf. (p. 84 [26])).

In the last section, we will give some combinatorial sums with p-adic integrals technique. Hence, let us give definitions of these integrals and a few properties of them.
Let $f ( x ) ∈ C 1 ( Z p → K )$, a set of continuous derivative functions, and $K$ is a field with a complete valuation.
The Volkenborn integral (the bosonic p-adic integral) is defined by
$∫ Z p f ( x ) d μ 1 ( x ) = lim N → ∞ 1 p N ∑ x = 0 p N − 1 f ( x ) ,$
where $μ 1 ( x ) = μ 1 x + p N Z p$ is the Haar distribution on $Z p$:
$μ 1 x + p N Z p = 1 p N ,$
(cf. [27,28]). On the other hand, the p-adic fermionic integral is defined by
$∫ Z p f x d μ − 1 x = lim N → ∞ ∑ x = 0 p N − 1 − 1 x f x$
where
$μ − 1 x = μ − 1 x + p N Z p = ( − 1 ) x p N$
(cf. [29]).
The Bernoulli numbers and the Euler numbers are related to the following p-adic integrals representations, respectively,
$B n = ∫ Z p x n d μ 1 x ,$
(cf. [27,28]) and
$E n = ∫ Z p x n d μ − 1 x ,$
(cf. [27]).

#### 1.2. Umbral Algebra and Calculus

Throughout this section, we use the notations and definitions of the Roman’s book (cf. [13]). Let $P = C x$ be the algebra of polynomials in the single variable x over the field of complex numbers. Let $P *$ be the vector space of all linear functionals on $P$. Let $L ∣ p ( x )$ be the action of a linear functional L on a polynomial $p ( x )$. Let $F$ denote the algebra of formal power series
$f t = ∑ k = 0 ∞ a k t k k ! ,$
(cf. [13]). Furthermore, for all $n ∈ N 0$, one has
$f t ∣ x n = a n$
and also
$f ( t ) g ( t ) ∣ p x = f ( t ) ∣ g ( t ) p x ,$
where $f ( t )$, $g ( t )$ are in $F$ (cf. [13]).
For $p x ∈ P$, as a linear functional, we have
$e y t ∣ p x = p y .$
and as a linear operator, we have
$e y t p x = p x + y$
(cf. [13]). The Sheffer polynomials for pair $( g ( t ) , f ( t ) )$, where $g ( t )$ must be invertible and $f ( t )$ must be delta series. The Sheffer polynomials for pair $( g ( t ) , t )$ is the Appell polynomials or Appell sequences for $g ( t )$. The Appell polynomials are defined by means of the following generating function
$∑ k = 0 ∞ s k x k ! t k = 1 g ( t ) e x t ,$
(cf. [13]). Some properties of the Appell polynomials are given as follows.
$s n x = g ( t ) − 1 x n ,$
(p. 86, Theorem 2.5.5 [13]), derivative formula
$t s n x = n s n − 1 x$
We summarize the results presented in this paper as follows:
In Section 2, by applying the umbral algebra and umbral calculus methods to generating functions of the special numbers and polynomials, we derive some identities and relations including the numbers $y 1 n , k ; λ$, combinatorial sums, the Fibonacci numbers, Apostol-Bernoulli type numbers and polynomials, and the Apostol-Euler type numbers and polynomials. Finally, we give some remarks and observations.
In Section 3, by using the p-adic integrals, we give many combinatorial sums related to the Bernoulli numbers, the Euler numbers, the Apostol-Euler numbers and the numbers $y 1 n , k ; λ$.

## 2. Identities Including the Numbers $y 1 n , k ; λ$, Combinatorial Sums, and Apostol-Euler Type Numbers and Polynomials

In this section, by using the umbral algebra and umbral calculus methods, we derive many identities and relations containing the numbers $y 1 n , k ; λ$, combinatorial sums, the Fibonacci numbers, Apostol-Bernoulli type numbers and polynomials, and the Apostol-Euler type numbers and polynomials.
Theorem 1.
$1 k ! ∑ j = 0 k k j λ j ∑ v = 0 m m v x m − v j v = 1 k ! ∑ j = 0 k k j λ j x + j m$
or
$∑ v = 0 m m v v ! x m − v y 1 v , k ; λ = 1 k ! ∑ j = 0 k k j λ j x + j m$
Proof.
By applying linear operators in (15) and (18) to (4), respectively, we obtain
$1 k ! λ e t + 1 k x m = 1 k ! ∑ j = 0 k k j λ j x + j m$
and
$1 k ! λ e t + 1 k x m = ∑ n = 0 ∞ y 1 n , k ; λ 1 n ! t n x m = 0 , n > m y 1 n , k ; λ , n = m ∑ v = 0 m m v v ! x m − v y 1 v , k ; λ n < m .$
Combining (20) with (21), we get the desired results. ☐
Remark 1.
Substituting $x = 0$ into (19), we arrive at (5).
By applying the action of a linear operator $λ e t + 1 k$ to the Apostol-Euler polynomial $E n a x , λ$, we obtain the following result.
Theorem 2.
$∑ j = 0 k k j λ j E n a x + j , λ = ∑ j = 0 k k j ∑ v = 0 j ( − 1 ) j − v j v 2 v E n a − v x , λ .$
Proof.
By applying the action of a linear operator $λ e t + 1 k$ to the Apostol-Euler polynomial $E n a x , λ$, we obtain
$λ e t + 1 k E n a x , λ = ∑ j = 0 k k j λ j e t j E n a x , λ .$
Applying linear operators in (15) to the above equation, we have
$λ e t + 1 k E n a x , λ = ∑ j = 0 k k j λ j E n a x + j , λ .$
Combining the following relation with (23)
$E n a x , λ = 2 λ e t + 1 a x n$
(cf. p. 101 [13]), we have
$λ e t + 1 k E n a x , λ = ∑ j = 0 k k j ∑ v = 0 j ( − 1 ) j − v j v 2 v 2 λ e t + 1 a − v x n .$
After some elementary calculation in the above equation, we have
$λ e t + 1 k E n a x , λ = ∑ j = 0 k k j ∑ v = 0 j ( − 1 ) j − v j v 2 v E n a − v x , λ .$
Combining (24) and (25), we arrive at the desired result. ☐
Substituting $λ = k = 1$ into (22), we arrive at the following corollary, which was proved by Roman (p. 103, Equation (4.2.11) [13]), see also (cf. [32]).
Corollary 1.
$2 E n ( a − 1 ) ( x ) = E n ( a ) ( x + 1 ) + E n ( a ) ( x )$
We assume that, $λ ≠ 1$ and $a ∈ N$, we have the following well-known relationships between the polynomials $B n a x , λ$ and $E n a x , − λ$:
$∑ n = 0 ∞ E n a x , − λ t n n ! = 2 − λ e t + 1 a e t x = − 2 t a ∑ n = 0 ∞ B n a x , λ t n n ! .$
Therefore
$n a E n − a a x , − λ = − 2 a B n a x , λ$
or
$E n a x , λ = − 2 a n + a a B n + a a x , − λ .$
Substituting the above relation into (22), we get the following result.
Theorem 3.
$∑ j = 0 k k j λ j − 2 a n + a a B n + a a x + j , − λ = ∑ j = 0 k k j ∑ v = 0 j ( − 1 ) j + a j v 2 a n + a − v a − v B n + a − v a − v x , − λ .$
Setting $k = 1$ in (26), we get the following corollary.
Corollary 2.
$B n + a a x , − λ + λ B n + a a x + 1 , − λ = − n + a B n + a − 1 a − 1 x , − λ .$
Remark 2.
Another proof of the Equation (27) is given by Dere et al. [6] and see also (cf. [32]).
Remark 3.
Substituting $n + a = m$ and $λ = − 1$ into (27), we get
$B m ( a ) ( x + 1 ) = B m ( a ) ( x ) + m B m − 1 ( a − 1 ) ( x )$
(cf. p. 95, Equation (4.2.6) [13]).
The following theorem was proved in (cf. [1]). Here, we give a proof different from that in (cf. [1]).
Theorem 4.
Let n and k be nonnegative integers. Then we have
$y 1 n , k ; λ = 2 k k ! E n − k 0 , λ .$
Proof.
Using (12), we obtain
$y 1 n , k ; λ = 1 k ! λ e t + 1 k ∣ x n .$
From the above equation, we have
$y 1 n , k ; λ = 2 k k ! λ e t + 1 2 k ∣ x n = 2 k k ! t 0 ∣ λ e t + 1 2 − k x n = 2 k k ! E n − k 0 , λ .$
Therefore, we arrive at the desired result. ☐
Theorem 5.
$2 k k ! ∑ j = 0 n n j E j a λ E n − j − k λ = ∑ j = 0 n n j E j a λ y 1 n − j , k ; λ$
Proof.
We set
$1 k ! λ e t + 1 k ∣ E n a λ = 1 k ! λ e t + 1 k ∣ ∑ j = 0 n n j E j a λ x n − j = 1 k ! ∑ j = 0 n n j E j a λ λ e t + 1 k ∣ x n − j$
Combining the above equation with (28), we get
$1 k ! λ e t + 1 k ∣ E n a λ = 1 k ! ∑ j = 0 n n j E j a λ y 1 n − j , k ; λ .$
On the other hand
$1 k ! ∑ j = 0 n n j E j a λ λ e t + 1 k ∣ x n − j = 2 k k ! ∑ j = 0 n n j E j a λ t 0 ∣ λ e t + 1 2 − k x n − j .$
Therefore, combining (29) with (30), we arrive at the desired result. ☐
Theorem 6.
$y 1 m , k ; λ = 1 2 k ! ∑ j = 0 k k j λ j 2 E m j + 1 + E m j .$
Proof.
We set the following functional equation
$F y 1 t , k ; λ = 1 2 k ! ∑ j = 0 k k j λ j F E t , j + 1 ; 1 , k + F E t , j ; 1 , 1 .$
By combining the above equation with (4) and (2), we get
$∑ n = 0 ∞ y 1 n , k ; λ t n n ! = ∑ n = 0 ∞ 1 2 k ! ∑ j = 0 k k j λ j E n j + 1 + E n j t n n ! .$
Comparing the coefficients of $t n n !$ on both sides of the above equation yields the desired result. ☐
Theorem 7.
Let $m ∈ N$. Then we have
$S 2 m − 1 , k ; λ = 1 m k ! ∑ j = 0 k ( − 1 ) k − j k j λ j B m j + 1 , λ − B m j , λ .$
Proof.
We also set the following functional equation
$F S ( t , 0 , k ; λ ) = 1 t k ! ∑ j = 0 k ( − 1 ) k − j k j λ j F B t , j + 1 ; λ , 1 − F B t , j ; λ , 1 .$
By combining the above equation with (1) and (3), we get
$∑ m = 0 ∞ S 2 m , k ; λ t m m ! = ∑ m = 0 ∞ 1 t k ! ∑ j = 0 k ( − 1 ) k − j k j λ j B m j + 1 , λ − B m j , λ t m m ! .$
Comparing the coefficients of $t m m !$ on both sides of the above equation yields the desired result. ☐
Theorem 8.
Let $2 λ = 1 + 5$. Then we have
$∑ j = 0 n n j E j a λ y 1 n − j , k ; λ = 1 k ! ∑ j = 0 k k j λ F j + F j − 1 E n a j , λ .$
Proof.
We define the following functional equation:
$F y 1 t , k ; λ F E t , 0 ; λ , a = 1 k ! ∑ j = 0 k k j λ j F E t , j ; λ , a .$
By combining the above equation with (4), (2), and (7), we get
$∑ n = 0 ∞ ∑ j = 0 n n j E j a λ y 1 n − j , k ; λ t n n ! = ∑ n = 0 ∞ 1 k ! ∑ j = 0 k k j λ F j + F j − 1 E n a j , λ t n n ! ,$
where $λ = 1 + 5 2$. Comparing the coefficients of $t n n !$ on both sides of the above equation yields the desired result. ☐

## 3. Combinatorial Sums via $p$-Adic Integral

In this section, by using the p-adic integrals, we derive some combinatorial sums containing the Bernoulli numbers, the Euler numbers, the Apostol-Euler numbers and the numbers $y 1 n , k ; λ$.
Theorem 9.
$B n = k ! 2 k ∑ j = 0 n n j y 1 n − j , k ; λ ∑ v = 0 j j v E v k λ B j − v .$
Proof.
Combining (2) with (4), we set the following functional equation:
$F y 1 t , k ; λ F E t , x ; λ , k = 2 k k ! e t x .$
By using the above equation, we get
$∑ n = 0 ∞ E n k ( x , λ ) t n n ! ∑ n = 0 ∞ y 1 n , k ; λ t n n ! = 2 k k ! ∑ n = 0 ∞ x n t n n ! .$
Therefore
$∑ n = 0 ∞ ∑ j = 0 n n j y 1 n − j , k ; λ ∑ v = 0 j j v x j − v E v k λ t n n ! = 2 k k ! ∑ n = 0 ∞ x n t n n ! .$
Comparing the coefficients of $t n n !$ on both sides of the above equation yields the following relation:
$∑ j = 0 n n j y 1 n − j , k ; λ ∑ v = 0 j j v x j − v E v k λ = 2 k k ! x n .$
By applying the Volkenborn integral to (31), we get
$∑ j = 0 n n j y 1 n − j , k ; λ ∑ v = 0 j j v E v k λ ∫ Z p x j − v d μ 1 x = 2 k k ! ∫ Z p x n d μ 1 x .$
Combining the above equation with (10), we arrive at the desired result. ☐
Remark 4.
Replacing x by k and λ by $λ 2$, the Equation (31) is reduced to the following relation:
$∑ j = 0 n n j y 1 n − j , k ; λ 2 E j k k , λ 2 = 2 k k ! k n .$
Since
$λ k 2 n E n k ( k , λ 2 ) = ∑ m = 0 n n m k m E n − m * k λ$
where $E n * k λ$ denote the Apostol-type Euler numbers of the second kind of order k (cf. [25,33]), the Equation (32) yields
$∑ j = 0 n n j y 1 n − j , k ; λ 2 2 j ∑ m = 0 j j m k m E j − m * k λ = 2 λ k k ! k n .$
By combining the above equation with the following identity
$∑ m = 0 n n m 2 m y 1 m , k ; λ 2 E n − m * k λ = 2 λ k k ! k n$
(cf. [33]), we get the following combinatorial sums
$∑ j = 0 n n j y 1 n − j , k ; λ 2 2 j ∑ m = 0 j j m k m E j − m * k λ = ∑ m = 0 n n m 2 m y 1 m , k ; λ 2 E n − m * k λ .$
Theorem 10.
$E n = k ! 2 k ∑ j = 0 n n j y 1 n − j , k ; λ ∑ v = 0 j j v E v k λ E j − v .$
Proof.
By applying the fermionic p-adic integral to (31), we have
$∑ j = 0 n n j y 1 n − j , k ; λ ∑ v = 0 j j v E v k λ ∫ Z p x j − v d μ − 1 x = 2 k k ! ∫ Z p x n d μ − 1 x .$
Combining the above equation with (11), we arrive at the desired result. ☐
Theorem 11.
$∑ j = 0 n n j y 1 n − j , k ; λ ∑ v = 0 j j v E v k λ j + 1 − v = 2 k ( n + 1 ) k ! .$
Proof.
Integrate Equation (31) with respect to x from 0 to 1, we obtain
$∑ j = 0 n n j y 1 n − j , k ; λ ∑ v = 0 j j v E v k λ ∫ 0 1 x j − v d x = 2 k k ! ∫ 0 1 x n d x .$
After some calculations, we get the desired result. ☐
Theorem 12.
$∑ j = 0 n n j y 1 j , k ; λ B n − j − E n − j = 1 k ! ∑ j = 0 k k j λ j B n ( j ) − E n ( j ) .$
Proof.
Setting
$e t x F y 1 t , k ; λ = 1 k ! ∑ j = 0 k k j λ j e ( x + j ) t .$
Combining (4), we have
$∑ n = 0 ∞ ∑ j = 0 n n j x n − j y 1 j , k ; λ t n n ! = ∑ n = 0 ∞ 1 k ! ∑ j = 0 k k j λ j ( x + j ) n t n n ! .$
Comparing the coefficients of $t n n !$ on both sides of the above equation yields the following relation:
$∑ j = 0 n n j x n − j y 1 j , k ; λ = 1 k ! ∑ j = 0 k k j λ j ( x + j ) n .$
By applying the bosonic p-adic integral to (33) and combining with (10), we have
$∑ j = 0 n n j B n − j y 1 j , k ; λ = 1 k ! ∑ j = 0 k k j λ j B n ( j ) .$
By applying the fermionic p-adic integral to (33) and combining with (11), we obtain
$∑ j = 0 n n j E n − j y 1 j , k ; λ = 1 k ! ∑ j = 0 k k j λ j E n ( j ) .$
Subtracting both sides of Equations (34) and (35), after some elementary calculations, we arrive at the desired result. ☐
Theorem 13.
$∑ j = 0 n n j y 1 j , k ; λ n + 1 − j = 1 k ! ∑ j = 0 k k j λ j ( j + 1 ) n + 1 − j n + 1 n + 1 .$
Proof.
Integrate Equation (33) with respect to x from 0 to 1, we obtain
$∑ j = 0 n n j y 1 j , k ; λ ∫ 0 1 x n − j d x = 1 k ! ∑ j = 0 k k j λ j ∫ 0 1 ( x + j ) n d x .$
After some calculations, we get the desired result. ☐

## Acknowledgments

The present investigation was supported by the Scientific Research Project Administration of Akdeniz University. The author would like to thank to all referees for their valuable comments.

## Conflicts of Interest

The authors declare no conflict of interest.

## References

1. Simsek, Y. New families of special numbers for computing negative order Euler numbers and related numbers and polynomials. arXiv, 2018; 12. [Google Scholar]
2. Simsek, Y. Analysis of the Bernstein basis functions: an approach to combinatorial sums involving binomial coefficients and Catalan numbers. Math. Method Appl. Sci. 2015, 38, 3007–3021. [Google Scholar] [CrossRef]
3. Simsek, Y. Identities and relations related to combinatorial numbers and polynomials. Proc. Jangjeon Math. Soc. 2017, 20, 127–135. [Google Scholar]
4. Simsek, Y. Apostol type Daehee numbers and polynomials. Adv. Stud. Contemp. Math. 2016, 26, 555–566. [Google Scholar]
5. Simsek, Y. Construction of some new families of Apostol-type numbers and polynomials via Dirichlet character and p-adic q-integrals. Turk. J. Math. 2018, 42, 557–577. [Google Scholar] [CrossRef]
6. Dere, R.; Simsek, Y.; Srivastava, H.M. A unified presentation of three families of generalized Apostol type polynomials based upon the theory of the umbral calculus and the umbral algebra. J. Number Theory 2013, 133, 3245–3263. [Google Scholar] [CrossRef]
7. Srivastava, H.M.; Kurt, B.; Simsek, Y. Some families of Genocchi type polynomials and their interpolation functions. Integral Transforms Spec. Funct. 2012, 24, 919–938. [Google Scholar] [CrossRef]
8. Srivastava, H.M. Some generalizations and basic (or q-) extensions of the Bernoulli, Euler and Genocchi polynomials. Appl. Math. Inform. Sci. 2011, 5, 390–444. [Google Scholar]
9. Srivastava, H.M.; Choi, J. Zeta and q-Zeta Functions and Associated Series and Integrals; Elsevier Science Publishers: Amsterdam, The Netherlands; London, UK; New York, NY, USA, 2012. [Google Scholar]
10. 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]
11. 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]
12. Luo, Q.-M.; Srivastava, H.M. Some generalizations of the Apostol-Genocchi polynomials and the Stirling numbers of the second kind. Appl. Math. Comput. 2011, 217, 5702–5728. [Google Scholar] [CrossRef]
13. Roman, S. The Umbral Calculus; Dover Publication Inc.: New York, NY, USA, 2005. [Google Scholar]
14. Srivastava, H.M.; Kim, T.; Simsek, Y. q-Bernoulli numbers and polynomials associated with multiple q-zeta functions and basic L-series. Russ. J. Math. Phys. 2005, 12, 241–268. [Google Scholar]
15. Khan, N.U.; Usman, T.; Choi, J. A new generalization of Apostol type Laguerre-Genocchi polynomials. C. R. Acad. Sci. Paris Ser. I 2017. [Google Scholar] [CrossRef]
16. Simsek, Y. Generating functions for generalized Stirling type numbers, array type polynomials, Eulerian type polynomials and their applications. Fixed Point Theory Appl. 2013, 2013, 1–28. [Google Scholar] [CrossRef]
17. Bayad, A.; Simsek, Y.; Srivastava, H.M. Some array type polynomials associated with special numbers and polynomials. Appl. Math. Comput. 2014, 244, 149–157. [Google Scholar] [CrossRef]
18. Cakic, N.P.; Milovanovic, G.V. On generalized Stirling numbers and polynomials. Math. Balk. 2004, 18, 241–248. [Google Scholar]
19. Simsek, Y. Interpolation Function of Generalized q-Bernstein Type Polynomials and Their Application; Curves and Surfaces 2011, LNCS 6920; Boissonnat, J.-D., Chenin, P., Cohen, A., Gout, C., Lyche, T., Mazure, M.-L., Schumaker, L.L., Eds.; Springer: Berlin/Heidelberg, Germany, 2012; pp. 647–662. [Google Scholar]
20. Bona, M. Introduction to Enumerative Combinatorics; The McGraw-Hill Companies Inc.: New York, NY, USA, 2007. [Google Scholar]
21. Riordan, J. Introduction to Combinatorial Analysis; Princeton University Press: Princeton, NJ, USA, 1958. [Google Scholar]
22. Simsek, Y. On parametrization of the q-Bernstein Basis functions and Their Applications. J. Inequal. Spec. Funct. 2017, 8, 158–169. [Google Scholar]
23. Spivey, M.Z. Combinatorial Sums and Finite Differences. Discrete Math. 2007, 307, 3130–3146. [Google Scholar] [CrossRef]
24. Yuluklu, E.; Simsek, Y.; Komatsu, T. Identities Related to Special Polynomials and Combinatorial Numbers. Filomat 2017, 31, 4833–4844. [Google Scholar] [CrossRef]
25. Simsek, Y. Computation methods for combinatorial sums and Euler type numbers related to new families of numbers. Math. Method Appl. Sci. 2017, 40, 2347–2361. [Google Scholar] [CrossRef]
26. Koshy, T. Fibonacci and Lucas Numbers with Applications; A Wiley-Interscience Publication; John Wiley & Sons, Inc.: New York, NY, USA; Chichester, UK; Weinheim, Germany; Brisbane, Australial; Singapore; Toronto, ON, Canada, 2001. [Google Scholar]
27. Kim, T. q-Volkenborn integration. Russ. J. Math. Phys. 2002, 19, 288–299. [Google Scholar]
28. Schikhof, W.H. Ultrametric Calculus: An Introduction to p-adic Analysis; Cambridge Studies in Advanced Mathematics 4; Cambridge University Press: Cambridge, UK, 1984. [Google Scholar]
29. Kim, T. q-Euler numbers and polynomials associated with p-adic q-integral and basic q-zeta function. Trend Math. Inf. Cent. Math. Sci. 2006, 9, 7–12. [Google Scholar]
30. Dattoli, G.; Migliorati, M.; Srivastava, H.M. Sheffer polynomials, monomiality principle, algebraic methods and the theory of classical polynomials. Math. Comput. Model. 2007, 45, 1033–1041. [Google Scholar] [CrossRef]
31. Dere, R.; Simsek, Y. Genocchi polynomials associated with the Umbral algebra. Appl. Math. Comput. 2011, 218, 756–761. [Google Scholar] [CrossRef]
32. Komatsu, T.; Simsek, Y. Identities related to the Stirling numbers and modified Apostol-type numbers on Umbral Calculus. Miskolc Math. Notes 2017, 18, 905–916. [Google Scholar] [CrossRef]
33. Kucukoglu, I.; Simsek, Y. Identities and derivative formulas for the combinatorial and Apostol-Euler type numbers by their generating functions. preprint.