Next Article in Journal
Fuzzy Multi-Hypergroups
Previous Article in Journal
Several Fixed Point Theorems in Convex b-Metric Spaces and Applications
Previous Article in Special Issue
Studies in Sums of Finite Products of the Second, Third, and Fourth Kind Chebyshev Polynomials

Mathematics 2020, 8(2), 243; https://doi.org/10.3390/math8020243

Article
Generalized Tepper’s Identity and Its Application
by Dmitry Kruchinin 1,* , Vladimir Kruchinin 2 and Yilmaz Simsek 3 1
Department of Complex Information Security of Computer Systems, Tomsk State University of Control Systems and Radioelectronics, 634050 Tomsk, Russia
2
Institute of Innovation, Tomsk State University of Control Systems and Radioelectronics, 634050 Tomsk, Russia
3
Department of Mathematics, Akdeniz University, 07070 Antalya, Turkey
*
Author to whom correspondence should be addressed.
Received: 8 January 2020 / Accepted: 7 February 2020 / Published: 14 February 2020

## Abstract

:
The aim of this paper is to study the Tepper identity, which is very important in number theory and combinatorial analysis. Using generating functions and compositions of generating functions, we derive many identities and relations associated with the Bernoulli numbers and polynomials, the Euler numbers and polynomials, and the Stirling numbers. Moreover, we give applications related to the Tepper identity and these numbers and polynomials.
Keywords:
Tepper identity; generating function; composition of generating functions; Bernoulli numbers and polynomials; Euler numbers and polynomials; Stirling numbers; Frobenius–Euler polynomials
MSC:
11B68; 05A15; 11B73

## 1. Introduction

The following interesting identity had been conjectured by Tepper  and had proved by Long  and Papp :
$∑ j = 0 n ( − 1 ) j n j ( x − j ) n = n ! ,$
where n is a positive integer and x is any real number. If we consider the special case where $x = 0$, then it will be a variant of the well-known Euler’s formula (Equation (2.1) in )
$∑ k = 0 n ( − 1 ) n − k n k k n = n ! .$
Gould  wrote a detailed expository paper about Euler’s formula. Using the calculus of finite differences, he gave another generalization of Equation (1):
$∑ k = 0 n ( − 1 ) n − k n k ( A + B k ) m = 0 , 0 ≤ m < n ; B n n ! , m = n ,$
where A and B are any constants (Equation (5.12) in ).
There are many other variants of generalizations of the Tepper identity. For example, Egorychev (Equation (2.2) in ) showed another proof for the Tepper identity and obtained the following identity:
$∑ k = 0 n ( − 1 ) k n k ( x − k ) m = 0 , 0 ≤ m < n ; n ! , m = n .$
For $m = n$ the identity (2) corresponds to the identity (1). A similar result was obtained by Bayat and Teimoori [6,7]: For any positive integer n, m $( 0 ≤ m ≤ n )$ and any real number x,we have
$∑ k = 0 n ( − 1 ) k n k ( x + k ) m = ( − 1 ) m m ! δ n , m ,$
where $δ n , m$ is the Kronecker delta function.
Bayat and Teimoori (Corollary 5 in ) also presented another generalization of the Tepper identity: For any positive integer n and any real numbers x and $λ$
$∑ k = 0 n ( − 1 ) n − k n k ( x + k ) n | λ = n ! ,$
where the notation $x n | λ$ is defined as follows:
$x n | λ = x ( x + λ ) ⋯ ( x + ( n − 1 ) λ ) , n > 0 ; 1 , n = 0 .$
For $λ = 0$ the identity (3) corresponds to the identity (1). A similar result was obtained by Zhao and Wang (Theorem 4.4 in ): For any positive integer n and any real numbers x and y, we have
$∑ k = 0 n ( − 1 ) n − k n k φ n ( k x + y ) = n ! x n ,$
where
$φ n ( x ) = x ( x + 1 ) ⋯ ( x + n − 1 ) .$
Polynomials play an extremely important role in mathematics, physics and engineering. There are a lot of problems that can be solved by applying polynomials and methods for their investigations. A great contribution to the development of the theory of polynomials is made by various identities that operate with special polynomials. Several recent results can be found in [10,11,12,13,14]. Moreover, there are several generalizations of the Tepper identity that are related to polynomials. For example, for any arbitrary polynomial $f ( x )$ with degree m, we have [6,8,15,16]
$∑ k = 0 n ( − 1 ) k n k f ( x + k ) = ( − 1 ) m a m m ! δ n , m ,$
in which $a m$ is the leading coefficient of the polynomial $f ( x )$. The following similar result is presented in (Equation (31) in ):
$∑ k = 0 n ( − 1 ) n − k n k f ( x + k ) = Δ n f ( x ) ,$
where $Δ$ denote the difference operator given by
$Δ f ( x ) = f ( x + 1 ) − f ( x ) .$
Yang and Micek (Equation (34) in ) proved that for any positive integers n and m $( m ≤ n )$ and any functions $f ( x )$ and $g ( x )$ with n-th order derivatives, we have
$∑ k = 0 n ( − 1 ) n − k n k [ f k ( x ) g ( x ) ] ( m ) f n − k ( x ) = n ! ( f ′ ( x ) ) n g ( x ) δ n , m ,$
where $δ n , m$ is the Kronecker delta function.
As a corollary, they also obtained (Equation (39) in ) the following result: If $g m ( x )$ is the sequence of binomial-type polynomials, then we have
$∑ k = 0 n ( − 1 ) n − k n k g m ( k x + y ) = n ! g 1 n ( x ) δ n , m$
for any positive integers n and m $( m ≤ n )$ and any real numbers x and y.
In addition, there are generalizations of the Tepper identity that are related to the Stirling numbers. For instance, Gould highlight (Equation (1.16 in ) conjectured the following formula for arbitrary complex A:
$∑ j = 0 n ( − 1 ) j n j ( A − j ) n + k = ∑ j = 0 k A − n j ( n + j ) ! S ( n + k , n + j ) ,$
where $S ( n , k )$ are the Stirling numbers of the second kind.
There are many notations for the Stirling numbers of the second kinds. In this paper, we will use the notation $n k$ given by Knuth . The values of the Stirling numbers count the number of ways to partition a set of n elements into k nonempty subsets [18,19,20].
A general formula for the Stirling numbers of the second kind is given as follows [19,21]:
$n k = 1 k ! ∑ j = 0 k ( − 1 ) k − j k j j n .$
The Stirling numbers of the second kind are defined by the generating function [19,22]
$Φ k ( x ) = ∑ n ≥ k n k x n n ! = 1 k ! ( e x − 1 ) k .$
The Tepper identity is a great tool to check mathematical methods for their application. Sun applied the Tepper identity to obtain some interesting combinatorial identities and formulas (for example, formulas for enumerating Dyck paths according to the number of udus , identities for the Jacobsthal and Fibonacci polynomials ). Using an exponential generating function and the Bell polynomials, Yang  obtained several identities related to the Tepper identity.
The aim of this paper is to study the Tepper identity and show a way for applying the Tepper identity to get various identities based on the coefficients of the powers of generating functions .
This paper is organized as follows:
In Section 2, using generating functions for the Bernoulli polynomials, we give another proof of (1). We also prove a generalization of the Tepper identity for any variable x and present it in a convenient form for obtaining various identities based on the composition. Then in Section 3 we apply the obtained generalization for getting new identities for the Bernoulli and Euler numbers and polynomials. Using generating functions and our identities, we also obtain many novel formulas related to the combinatorial sums including binomial coefficients, the Bernoulli polynomials, the Euler polynomials, the Stirling numbers and the Tepper identity. Finally, in Section 4 we get various identities based on the coefficients of the powers of generating functions.

## 2. Generalized Tepper’S Identity

The Bernoulli polynomials $B n ( x )$ are defined by the following generating function [27,28]:
$A ( t , x ) = t e t − 1 e x t = ∑ n ≥ 0 B n ( x ) t n n ! .$
Let a generating function $V ( t , x )$ be a reciprocal generating function for the Bernoulli polynomials:
$V ( t , x ) = t A ( t , x ) = ( e t − 1 ) e − x t .$
The generating function (4) can be represented as the following formal power series:
$V ( t , x ) = ∑ n ≥ 0 y n ( x ) t n n ! .$
Then, for the coefficients $y n ( x )$, the following explicit formula can be obtained:
$y n ( x ) = ( 1 − x ) n + ( − 1 ) n + 1 x n .$
Let us introduce the following polynomials $K ( x ; n , k )$ that are defined by the k-th power of the generating function (4):
$V ( t , x ) k = ( e t − 1 ) k e − x t k = ∑ n ≥ k K ( x ; n , k ) t n n ! .$
The generating function (5) can be represented as a function of the form
$( e − x t + t − e − x t ) k .$
For the function (6) we can apply the binomial theorem
$( x + y ) k = ∑ j = 0 k k j x k − j y j$
and the Taylor series for the exponential function
$e t = ∑ n ≥ 0 t n n ! .$
Hence, we get the following explicit formula for the polynomials $K ( x ; n , k )$:
$K ( x ; n , k ) = ∑ j = 0 k ( − 1 ) k − j k j ( j − k x ) n .$
We also can calculate polynomials $K ( x ; n , k )$ using the next theorem:
Theorem 1.
$K ( x ; n , k ) = k ! ∑ j = k n j k n j ( − k x ) n − j ,$
where $j k$ denotes the Stirling numbers of the second kind.
Proof.
The generating function (5) can be represented as the product of two generating functions $( e t − 1 ) k$ and $e − x t k$. For the product of generating functions $A ( t ) = ∑ n ≥ 0 a ( n ) t n = B ( t ) C ( t )$, where $B ( t ) = ∑ n > 0 b ( n ) t n$, $C ( t ) = ∑ n ≥ 0 c ( n ) t n$, the coefficients are
$a ( n ) = ∑ j = 0 n b ( j ) c ( n − j ) .$
Therefore, we get the coefficients of the first generating function $( e t − 1 ) k$, using the well-known formula (p. 206 in )
$( e t − 1 ) k = ∑ n ≥ k k ! n ! n k t n ,$
and the coefficients of the second generating function $e − x t k$, using the Taylor series for the exponential function. Next we apply (9) and obtain
$( e t − 1 ) k e − x t k = ∑ n ≥ k ∑ j = 0 n k ! j ! j k ( − k x ) n − j ( n − j ) ! t n .$
Using (5) and simplifying (10), we get the explicit formula (7) for the polynomials $K ( x ; n , k )$. □
Corollary 1.
$∑ j = 0 n ( − 1 ) n − j n j ( j − k x ) n = n ! .$
Proof.
Substituting $k = n$ in (8), we get
$K ( x ; n , n ) = n ! .$
We also can apply (7) for calculating $K ( x ; n , n )$. Hence, we obtain the desired result (11). □
If we consider the special case $K ( x k ; n , n )$, then we rederive the Tepper identity (1):
$K ( x k ; n , n ) = ∑ j = 0 n ( − 1 ) j n j ( x − j ) n = n ! .$
Next we give a generalization of the Tepper identity by the following theorem:
Theorem 2.
For any variable x there hold the following:
$1 n ! ∑ j = 0 n ( − 1 ) n − j n j ( j + x ) n + k = ∑ j = 0 k n + k j n + k − j n x j .$
Proof.
Integrating the Tepper identity (1) with respect to x, we get
$1 ( n + 1 ) ! ∑ j = 0 n ( − 1 ) n − j n j ( j + x ) n + 1 = x + C .$
For finding the value of C, we set $x = 0$ in the above equation, then we have
$C = 1 ( n + 1 ) ! ∑ j = 0 n ( − 1 ) n − j n j j n + 1 .$
Since
$n + k n = 1 n ! ∑ j = 0 n ( − 1 ) n − j n j j n + k ,$
we get
$C = 1 n + 1 n + 1 n = n 2 .$
Therefore,
$1 n ! ∑ j = 0 n ( − 1 ) n − j n j ( j + x ) n + 1 = ( n + 1 ) x + n ( n + 1 ) 2 .$
If we repeat the above process for $k = 1$, then we obtain
$1 n ! ∑ j = 0 n ( − 1 ) n − j n j ( j + x ) n + 2 = ( n + 2 ) ( n + 1 ) 2 x 2 + ( n + 2 ) ( n + 1 ) n 2 x + n + 2 n .$
Then we can generalize it with k-times integrating and get
$1 n ! ∑ j = 0 n ( − 1 ) n − j n j ( j + x ) n + k = ∑ j = 0 k n + k j n + k − j n x j .$
Hence, the proof of the theorem is completed. □
We can represent the left part of (12) as polynomials of degree k
$T ( x ; n , k ) = 1 n ! ∑ j = 0 n ( − 1 ) n − j n j ( j + x ) n + k .$
If we take the derivative of these polynomials with respect to x, then we have the following derivative formula:
$d d x T ( x ; n , k ) = ( n + k ) T ( x ; n , k − 1 ) .$

## 3. New Identities Related to the Bernoulli and Euler Polynomials

It is known that for a polynomial $P ( x )$ one can define two symbolical operators that are based on properties of the Bernoulli and Euler polynomials [29,30]. The Euler polynomials are defined by the following generating function [31,32]:
$2 e x t 1 + e t = ∑ n ≥ 0 E n ( x ) t n n ! .$
Let
$B n ( x + h ) = ( B ( x ) + h ) n ,$
$E n ( x + h ) = ( E ( x ) + h ) n ,$
where $B ( x ) n$ and $E ( x ) n$ are replaced conventionally by $B n ( x )$ and $E n ( x )$, respectively, and
$P ( B ( x ) + 1 ) − P ( B ( x ) ) = P ′ ( x ) ,$
$P ( E ( x ) + 1 ) + P ( E ( x ) ) = 2 P ( x ) .$
Since
$P ( x + h ) = R ( x ) ,$
where $P ( x )$ and $R ( x )$ are any polynomials in x, we get
$P ( B ( x ) + h ) = R ( B ( x ) )$
and
$P ( E ( x ) + h ) = R ( E ( x ) ) .$
Next applying those symbolical operators, we arrive at the following identities including the Bernoulli polynomials and the Euler polynomials:
Theorem 3.
For the Bernoulli and Euler polynomials there hold the following identities:
$1 n ! ∑ j = 0 n ( − 1 ) n − j n j B n + k ( j + x ) = ∑ j = 0 k n + k j n + k − j n B j ( x )$
and
$1 n ! ∑ j = 0 n ( − 1 ) n − j n j E n + k ( j + x ) = ∑ j = 0 k n + k j n + k − j n E j ( x ) .$
Proof.
Applying (13) for the generalized Tepper identity (12) and the Bernoulli polynomials, we get
$1 n ! ∑ j = 0 n ( − 1 ) n − j n j ( j + B ( x ) ) n + k = ∑ j = 0 k n + k j n + k − j n B ( x ) j .$
Therefore, we obtain (14).
Similarly, for the Euler polynomials we have
$1 n ! ∑ j = 0 n ( − 1 ) n − j n j ( j + E ( x ) ) n + k = ∑ j = 0 k n + k j n + k − j n E ( x ) j .$
Therefore, we obtain (15). So the proof of the theorem is completed. □
For the Bernoulli polynomials, the Tepper identity (12) with $k = 0$ takes the following form:
$1 n ! ∑ j = 0 n ( − 1 ) n − j n j B n ( j + x ) = 1 .$
For the Euler polynomials, the Tepper identity (12) with $k = 0$ takes the following form:
$1 n ! ∑ j = 0 n ( − 1 ) n − j n j E n ( j + x ) = 1 .$
The formula (12) gives us an opportunity for obtaining an explicit formula for the Bernoulli polynomials and the Euler polynomials through the Stirling numbers of the second kind. Applying (12) tofor the following well-known results:
$B n ( x ) = ∑ k = 0 n 1 k + 1 ∑ j = 0 k ( − 1 ) j k j ( j + x ) n$
and
$E n ( x ) = ∑ k = 0 n 1 2 k ∑ j = 0 k ( − 1 ) j k j ( j + x ) n ,$
we obtain the known formulas [33,34]
$B n ( x ) = ∑ k = 0 n ( − 1 ) k k ! k + 1 ∑ j = 0 n − k n j n − j k x j$
and
$E n ( x ) = ∑ k = 0 n ( − 1 ) k k ! 2 k ∑ j = 0 n − k n j n − j k x j .$
Theorem 4.
Let n and k be nonnegative integers. Then we have
$∑ j = 0 k n + k j n + k − j n B j = n + k n ! ∑ j = 0 n ( − 1 ) n − j n j ∑ m = 1 j − 1 m n + k − 1 .$
Proof.
It is known that 
$B n ( j ) = B n + n ∑ m = 1 j − 1 m n − 1 .$
Let us write the formula for the generalized Tepper identity for the Bernoulli polynomials (14) with $x = 0$
$1 n ! ∑ j = 0 n ( − 1 ) n − j n j B n + k ( j ) = ∑ j = 0 k n + k j n + k − j n B j .$
Substituting the value of $B n + k ( j )$ in the above formula and using
$∑ j = 0 n ( − 1 ) n − j n j B n + k = 0 ,$
we arrive at desired result. □
The identity (14) can also be expanded for the generalized Bernoulli polynomials. The generalized Bernoulli polynomials are defined by the following generating function :
$e x t t e t − 1 α = ∑ n ≥ 0 B n α ( x ) t n n !$
for an arbitrary parameter $α$.
Theorem 5.
Let n and $k$ be nonnegative integers. Then we have
$1 n ! ∑ j = 0 n ( − 1 ) n − j n j B n + k α ( j + x ) = ∑ j = 0 k n + k j n + k − j n B j α ( x ) .$
Proof.
For the generalized Bernoulli polynomials there hold a well-known relation
$B n α ( x + h ) = ∑ k = 0 n n k B k α ( x ) h n − k .$
It means that the mention above two symbolical operators can be applied for the generalized Bernoulli polynomials. Therefore, the desired identity is true. □
The identity (15) can also be expanded for the Frobenius–Euler polynomials of order $α$. The Frobenius–Euler polynomials of order $α$ are defined by the following generating function [37,38]:
$1 − λ e t − λ α e x t = ∑ n ≥ 0 H n α , λ ( x ) t n n ! ,$
where $λ$ is an arbitrary parameter and $λ ≠ 1$, $α$ is a positive integer. Observe that
$E n ( x ) = H n 1 , − 1 ( x )$
(cf. ).
Theorem 6.
For the Frobenius–Euler polynomials $H n α , λ ( x )$ of order α there hold the following:
$1 n ! ∑ j = 0 n ( − 1 ) n − j n j H n + k α , λ ( j + x ) = ∑ j = 0 k n + k j n + k − j n H j α , λ ( x ) .$
Proof.
For the Frobenius–Euler polynomials there hold a well-known relation 
$H n α , λ ( x + h ) = ∑ k = 0 n n k H k α , λ ( x ) h n − k .$
It means that the mention above two symbolical operators can be applied for the Frobenius–Euler polynomials. Therefore, the desired identity is true. □

## 4. Taylor Series for the Generalized Tepper Identity

The obtained generalized Tepper identity allows us to get various identities based on the coefficients of the powers of generating functions [41,42,43]. For that we substitute a generating function $F ( x ) = ∑ m ≥ 0 f ( m ) x m$ in the identity and get
$1 n ! ∑ j = 0 n ( − 1 ) n − j n j ( j + F ( x ) ) n + k = ∑ j = 0 k n + k j n + k − j n F ( x ) j .$
After evaluating, we get
$1 n ! ∑ j = 0 n ( − 1 ) n − j n j ∑ i = 0 n + k n + k i j n + k − i F ( x ) i = ∑ j = 0 k n + k j n + k − j n F ( x ) j .$
Equating coefficients of the Taylor series, we have
$1 n ! ∑ j = 0 n ( − 1 ) n − j n j ∑ i = 0 n + k n + k i j n + k − i F ( m , i ) = ∑ j = 0 k n + k j n + k − j n F ( m , j ) ,$
where
$F ( x ) i = ∑ m ≥ 0 F ( m , i ) x m .$
Example 1.
Let
$F ( x ) = 1 1 − x$
and
$F ( m , i ) = m + i − 1 m .$
Then we have
$1 n ! ∑ j = 0 n ( − 1 ) n − j n j ∑ i = 0 n + k n + k i j n + k − i m + i − 1 m = ∑ j = 0 k n + k j n + k − j n m + j − 1 m .$
Substituting $m = k = n$ in (16), we get the following identity:
$1 n ! ∑ j = 0 n ( − 1 ) n − j n j ∑ i = 0 2 n 2 n i j 2 n − i n + i − 1 n = ∑ j = 0 n 2 n j 2 n − j n n + j − 1 n .$
Substituting $m = n$, $k = 0$ in (16), we get the following identity:
$1 n ! ∑ j = 0 n ( − 1 ) n − j n j ∑ i = 0 n n i j n − i n + i − 1 n = 0 .$
Example 2.
Let
$F ( x ) = e x$
and
$F ( m , i ) = j m m ! .$
Then we have
$1 n ! ∑ j = 0 n ( − 1 ) n − j n j ∑ i = 0 n + k n + k i j n + k − i i m m ! = ∑ j = 0 k n + k j n + k − j n j m m ! .$
Substituting $m = k = n$ in (17), we get the following identity:
$1 n ! ∑ j = 0 n ( − 1 ) n − j n j ∑ i = 0 2 n 2 n i j 2 n − i i n n ! = ∑ j = 0 n 2 n j 2 n − j n j n n ! .$
Substituting $m = n$, $k = 0$ in (17), we get the following identity:
$1 n ! ∑ j = 0 n ( − 1 ) n − j n j ∑ i = 0 n n i j n − i i n = 0 .$
Example 3.
Let
$F ( x ) = e x − 1$
and
$F ( m , i ) = i ! m ! m i .$
Then we have
$1 n ! ∑ j = 0 n ( − 1 ) n − j n j ∑ i = 0 n + k n + k i j n + k − i i ! m ! m i = ∑ j = 0 k n + k j n + k − j n j ! m ! m j .$

## 5. Conclusions

The main results of this paper are in six theorems, one corollary and three examples. In the paper we have studied polynomials $K ( x ; n , k )$ related to the Tepper identity (1). Using generating functions and the Bernoulli polynomials, we have given another proof of the Tepper identity. We also have introduced a new generalization of the Tepper identity (12) that is related to Gould’s formulas and we have proved the presented generalization for any variable x.
As an application of the presented generalization of the Tepper identity, we have obtained new identities related to the combinatorial sums including binomial coefficients, the Bernoulli and Euler numbers and polynomials, the Stirling numbers. The obtained identities can be applied for studying properties of special numbers and polynomials. They also can be used for effectively calculating the sums that are related to special numbers and polynomials.

## Author Contributions

All authors conceived of the study, participated in its design, read and approved the final manuscript. D.K. wrote the paper; V.K. and Y.S. checked the results of the paper and completed the revision of the article. All authors have read and agreed to the published version of the manuscript.

## Funding

This work was funded by Russian Foundation for Basic Research and the government of the Tomsk region of Russian Federation (grant no. 18-41-703006) and the Ministry of Education and Science of Russian Federation (government order no. 2.8172.2017/8.9, TUSUR).

## Acknowledgments

The authors would like to thank the referees for their helpful comments and suggestions. The authors would also like to express thanks to Associated Yuriy Shablya for the useful comments and for various help during preparing the paper.

## Conflicts of Interest

The authors declare no conflict of interest.

## References

1. Tepper, M. A factorial conjecture. Math. Mag. 1965, 38, 303–304. [Google Scholar] [CrossRef]
2. Long, C.T. Proof of Tepper’s factorial conjecture. Math. Mag. 1965, 38, 304–305. [Google Scholar] [CrossRef]
3. Papp, F.J. Another proof of Tepper’s identity. Math. Mag. 1972, 45, 119–121. [Google Scholar] [CrossRef]
4. Gould, H.W. Euler’s formula for n-th differences of powers. Am. Math. Mon. 1978, 85, 450–467. [Google Scholar]
5. Egorychev, G.P. Integral Representation and the Computation of Combinatorial Sums; American Mathematical Society: Providence, RI, USA, 1984. [Google Scholar]
6. Bayat, M.; Teimoori, H. Pascal k-eliminated functional matrix and its property. Linear Algebra Appl. 2000, 308, 65–75. [Google Scholar] [CrossRef]
7. Bayat, M.; Teimoori, H. Minimal polynomial of Pascal matrices over the field Zp. Discret. Math. 2001, 232, 91–94. [Google Scholar] [CrossRef]
8. Bayat, M.; Teimoori, H. The linear algebra of the generalized Pascal functional matrix. Linear Algebra Appl. 1999, 295, 81–89. [Google Scholar] [CrossRef]
9. Zhaot, X.; Wang, T. The algebraic properties of the generalized Pascal functional matrices associated with the exponential families. Linear Algebra Appl. 2000, 318, 45–52. [Google Scholar]
10. Chen, G.; Chen, L. Some identities involving the Fubini polynomials and Euler polynomials. Mathematics 2018, 6, 300. [Google Scholar] [CrossRef]
11. Ma, Y.; Zhang, W. Some identities involving Fibonacci polynomials and Fibonacci numbers. Mathematics 2018, 6, 334. [Google Scholar] [CrossRef]
12. Shen, S.; Chen, L. Some types of identities involving the Legendre polynomials. Mathematics 2019, 7, 114. [Google Scholar] [CrossRef]
13. Dolgy, D.V.; Kim, D.S.; Kwon, J.; Kim, T. Some identities of ordinary and degenerate Bernoulli numbers and polynomials. Symmetry 2019, 11, 847. [Google Scholar] [CrossRef]
14. Kim, T.; Kim, D.S.; Kim, H.Y.; Kwon, J. Some identities of degenerate Bell polynomials. Mathematics 2020, 8, 40. [Google Scholar] [CrossRef]
15. Arponen, T. Matrix approach to polynomials 2. Linear Algebra Appl. 2005, 394, 257–276. [Google Scholar] [CrossRef]
16. Yang, Y.; Micek, C. Generalized Pascal functional matrix and its applications. Linear Algebra Appl. 2007, 423, 230–245. [Google Scholar] [CrossRef]
17. Gould, H.W. Combinatorial Identities: A standardized Set of Tables Listing 500 Binomial Coefficient Summations; Morgantown Printing: Morgantown, WV, USA, 1972. [Google Scholar]
18. Graham, R.L.; Knuth, D.E.; Patashnik, O. Concrete Mathematics; Addison-Wesley: Boston, MA, USA, 1989. [Google Scholar]
19. Comtet, L. Advanced Combinatorics; D. Reidel Publishing Company: Dordrecht, The Netherlands, 1974. [Google Scholar]
20. Boyadzhiev, K.N. Close encounters with the Stirling numbers of the second kind. Math. Mag. 2012, 85, 252–266. [Google Scholar] [CrossRef]
21. Simsek, Y. New families of special numbers for computing negative order euler numbers and related numbers and polynomials. Appl. Anal. Discret. Math. 2018, 12, 1–35. [Google Scholar] [CrossRef]
22. Simsek, Y. Generating functions for finite sums involving higher powers of binomial coefficients: Analysis of hypergeometric functions including new families of polynomials and numbers. J. Math. Anal. Appl. 2019, 477, 1328–1352. [Google Scholar] [CrossRef]
23. Sun, Y. The statistic “number of udu’s” in Dyck paths. Discret. Math. 2004, 287, 177–186. [Google Scholar] [CrossRef]
24. Sun, Y. Numerical triangles and several classical sequences. Fibonacci Quart. 2005, 43, 359–370. [Google Scholar]
25. Yang, S.-L. Some identities involving the binomial sequences. Discret. Math. 2008, 308, 51–58. [Google Scholar] [CrossRef]
26. Simsek, Y. Construction method for generating functions of special numbers and polynomials arising from analysis of new operators. Math. Methods Appl. Sci. 2018, 41, 6934–6954. [Google Scholar] [CrossRef]
27. Srivastava, H.M.; Manocha, H.L. A Treatise on Generating Functions; Halsted Press: New York, NY, USA, 1984. [Google Scholar]
28. Roman, S. The Umbral Calculus; Academic Press: Cambridge, MA, USA, 1984. [Google Scholar]
29. Gessel, I.M. Applications of the classical umbral calculus. Algebra Universalis 2003, 49, 397–434. [Google Scholar] [CrossRef]
30. Dilcher, K. Bernoulli and Euler polynomials. In NIST Handbook of Mathematical Functions; U.S. Dept. Commerce: Washington, DC, USA; Cambridge University Press: Cambridge, UK, 2010; pp. 587–599. [Google Scholar]
31. Kim, T.; Kim, D.S.; Kim, H.Y.; Kwon, J. Ordinary and degenerate Euler numbers and polynomials. J. Inequal. Appl. 2019, 2019, 265. [Google Scholar] [CrossRef]
32. Qi, F.; Guo, B.-N. Explicit formulas for special values of the Bell polynomials of the second kind and for the Euler numbers and polynomials. Mediterr. J. Math. 2017, 14, 140. [Google Scholar] [CrossRef]
33. Todorov, P.G. On the theory of the Bernoulli polynomials and numbers. J. Math. Anal. Appl. 1984, 104, 309–350. [Google Scholar] [CrossRef]
34. Chang, C.-H.; Ha, C.-W. A multiplication theorem for the Lerch zeta function and explicit representations of the Bernoulli and Euler polynomials. J. Math. Anal. Appl. 2006, 315, 758–767. [Google Scholar] [CrossRef]
35. Prudnikov, A.P.; Brychkov, Y.A.; Marichev, O.I. The generalized Zeta function zeta(s,x), Bernoulli polynomials Bn(x), Euler polynomials En(x), and polylogarithms Linu(x). In Integrals and Series, Vol. 3: More Special Functions; Gordon and Breach Science Publishers: New York, NY, USA, 1990; pp. 23–24. [Google Scholar]
36. Srivastava, H.M.; Todorov, P.G. An explicit formula for the generalized Bernoulli polynomials. J. Math. Anal. Appl. 1988, 130, 509–513. [Google Scholar] [CrossRef]
37. Kim, D.S.; Kim, T.; Lee, S.-H. Umbral calculus and the Frobenius–Euler polynomials. Abstr. Appl. Anal. 2013, 2013, 871512. [Google Scholar] [CrossRef]
38. Kurt, B.; Simsek, Y. On the generalized Apostol-type Frobenius–Euler polynomials. Adv. Differ. Equ. 2013, 2013, 1. [Google Scholar] [CrossRef]
39. Simsek, Y. Generating functions for generalized Stirling type numbers, array type polynomials, Eulerian type polynomials and their applications. Fixed Point Theory Appl. 2013, 87, 343–1355. [Google Scholar] [CrossRef]
40. Kim, D.S.; Kim, T.; Lee, S.-H.; Rim, S.-H. Frobenius–Euler polynomials and umbral calculus in the p-adic case. Adv. Differ. Equ. 2012, 2012, 222. [Google Scholar] [CrossRef]
41. Kruchinin, D.V.; Kruchinin, V.V. A method for obtaining generating function for central coefficients of triangles. J. Integer Seq. 2012, 15, 12.9.3. [Google Scholar]
42. Kruchinin, D.V.; Kruchinin, V.V. Application of a composition of generating functions for obtaining explicit formulas of polynomials. J. Math. Anal. Appl. 2013, 404, 161–171. [Google Scholar] [CrossRef]
43. Kruchinin, D.V.; Kruchinin, V.V. Explicit formulas for reciprocal generating function and its application. Adv. Stud. Contemp. Math. 2019, 29, 365–372. [Google Scholar]