Next Article in Journal
Lorentz-Violating Matter-Gravity Couplings in Small-Eccentricity Binary Pulsars
Next Article in Special Issue
A Note on Degenerate Euler and Bernoulli Polynomials of Complex Variable
Previous Article in Journal
ELPKG: A High-Accuracy Link Prediction Approach for Knowledge Graph Completion
Previous Article in Special Issue
Degenerate Stirling Polynomials of the Second Kind and Some Applications
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Two Parametric Kinds of Eulerian-Type Polynomials Associated with Euler’s Formula

Department of Mathematics, Faculty of Science, University of Akdeniz, TR-07058 Antalya, Turkey
*
Author to whom correspondence should be addressed.
Submission received: 27 July 2019 / Revised: 15 August 2019 / Accepted: 16 August 2019 / Published: 2 September 2019

Abstract

:
The purpose of this article is to construct generating functions for new families of special polynomials including two parametric kinds of Eulerian-type polynomials. Some fundamental properties of these functions are given. By using these generating functions and the Euler’s formula, some identities and relations among trigonometric functions, two parametric kinds of Eulerian-type polynomials, Apostol-type polynomials, the Stirling numbers and Fubini-type polynomials are presented. Computational formulae for these polynomials are obtained. Applying a partial derivative operator to these generating functions, some derivative formulae and finite combinatorial sums involving the aforementioned polynomials and numbers are also obtained. In addition, some remarks and observations on these polynomials are given.

1. Introduction

Special polynomials and their generating functions have important roles in many branches of mathematics, probability, statistics, mathematical physics and also engineering. Since polynomials are suitable for applying well-known operations such as derivative and integral, polynomials are very useful to study real-world problems in aforementioned areas. For instance, generating functions for special polynomials with their congruence properties, recurrence relations, computational formulae and symmetric sum involving these polynomials has been studied by many authors in recent years (cf. [1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27]).
In this article, by combining the Euler’s formula with generating functions for two parametric kinds of Eulerian-type polynomials, their functional equations and partial derivative equations, we give many formulae and relations including the Stirling numbers, Fubini-type polynomials, two parametric kinds of Eulerian-type polynomials, and Apostol-type numbers and polynomials such as the Apostol–Bernoulli numbers and polynomials, the Apostol–Euler numbers and polynomials, and the Apostol–Genocchi numbers and polynomials.
Throughout this article, we use the following notations and definitions:
Let N = 1 , 2 , 3 , , N 0 = N 0 , Z denote the set of integers, R denote the set of real numbers and C denote the set of complex numbers.
Furthermore, 0 n = 1 if n = 0 , and, 0 n = 0 if n N , and α n denotes the Pochhammer symbol, which is defined as follows:
α v = α α + 1 α + 2 α + v 1 v = n N , α C . 1 v = 0 , α C \ 0 ,
where ( 0 ) 0 = 1 . Moreover,
α v = α α 1 α 2 α v + 1 v ! v N , α C , 1 v = 0
and
α v ̲ = 1 v α v
(cf. [1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25]).
The well-known Euler’s formula is defined as follows:
e i z = cos z + i sin z ,
where i 2 = 1 .
The Apostol–Bernoulli polynomials B n m ( x ; λ ) of order m are defined by
F A B m t , x ; λ = t λ e t 1 m e x t = n = 0 B n m ( x ; λ ) t n n ! ,
where t < 2 π when λ = 1 ; t < log λ when λ 1 and
B n m ( λ ) = B n m ( 0 ; λ ) ,
where B n m ( λ ) denotes the so-called Apostol–Bernoulli numbers of order m (cf. [1,21,22,24,25]).
The Apostol–Euler polynomials E n m x ; λ of order m are defined by
F A E m t , x ; λ = 2 λ e t + 1 m e x t = n = 0 E n m x ; λ t n n ! ,
where t < π when λ = 1 ; t < log λ when λ 1 and
E n m λ = E n m 0 ; λ ,
where E n m λ denotes the so-called Apostol–Euler numbers of order m (cf. [14,21,22,23,24]).
The λ -Stirling numbers of the second kind are defined by
F S 2 t , m ; λ = λ e t 1 m m ! = n = 0 S 2 n , m ; λ t n n ! ,
where m N 0 and λ C (cf. [15,19,21]). Substituting λ = 1 into (3), the numbers S 2 n , m ; λ reduces to the Stirling numbers of the second kind:
S 2 n , m = S 2 n , m ; 1
(cf. [1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25]).
Combining (2) with (3), a computation formula for the Apostol–Euler polynomials of order m is given as follows:
E n m x ; λ = 2 m k = 0 n n k x n k j = 0 k m + j 1 j j ! λ j λ + 1 j + m S 2 k , j
(cf. [14,24]).
The Apostol–Genocchi polynomials G n m x ; λ of order m are defined by
F A G m t , x ; λ = 2 t λ e t + 1 m e x t = n = 0 G n m x ; λ t n n ! ,
where t < π when λ = 1 ; t < log λ when λ 1 and
G n m λ = G n m 0 ; λ ,
where G n m λ denotes the so-called Apostol–Genocchi numbers of order m (cf. [15,22,24]).
The Apostol-type Frobenius–Euler polynomials H n m x ; λ , u of order m are defined by
F A H m t , x ; λ , u = 1 u λ e t u m e x t = n = 0 H n m x ; λ , u t n n ! ,
where u C with u λ , λ 1 and
H n m λ , u = H n m 0 ; λ , u ,
where H n m λ , u denotes the so-called Apostol-type Frobenius–Euler numbers of order m (cf. [2,19,22,24]). Substituting u = 1 into (6), we have
H n m x ; λ , 1 = E n m x ; λ
(cf. [2,19,22,24]).
Substituting λ = 1 into (6), we have
H n m x ; u = H n m x ; 1 , u ,
where H n m x ; u denotes the so-called Frobenius–Euler polynomials of order m.
Substituting x = 0 into (7), we have
H n m 0 ; u = H n m u ,
where H n m u denotes the so-called Frobenius–Euler numbers of order m (cf. [4,5,10,12,13,17,19,20,22,23,24]).
By using (6) and (7), we have
H n m x ; λ , u = 1 u λ u m H n m x ; u λ .
The polynomials C n x , y and S n x , y are defined respectively by
F C t , x , y = e x t cos y t = n = 0 C n x , y t n n !
and
F S t , x , y = e x t sin y t = n = 0 S n x , y t n n !
(cf. [11,16,25]).
By using (9) and (10), we have
C n x , y = k = 0 n 2 1 k n 2 k x n 2 k y 2 k
and
S n x , y = k = 0 n 1 2 1 k n 2 k + 1 x n 2 k 1 y 2 k + 1
(cf. [11,16,25]).
In [7], we defined the following generating function for the Fubini-type polynomials a n m ( x ) of order m
F a m ( t , x ) = 2 m 2 e t 2 m e x t = n = 0 a n m ( x ) t n n ! .
Substituting x = 0 into (11), we have
a n m ( 0 ) = a n m ,
where a n m denotes the so-called Fubini-type numbers of order m (cf. [7]).
In [9], we constructed the following generating functions for two kinds of Hermite-based r-parametric Milne–Thomson-type polynomials:
Let r-tuples v = v 1 , v 2 , , v r . Then, we have
B t , x , y , z , v , r , a , b = 2 b + f t , a z exp x t M 4 t , y , v , r = n = 0 h 1 n , x , y , z ; v , r , a , b t n n ! ,
where
M 4 t , y , v , r = exp j = 1 r v j t j cos y t = n = 0 C n v , y ; r t n n !
and
B 1 t , x , y , z , v , r , a , b = 2 b + f t , a z exp ( x t ) M 5 t , y , v , r = n = 0 h 2 n , x , y , z ; v , r , a , b t n n ! ,
where
M 5 t , y , v , r = exp j = 1 r v j t j sin y t = n = 0 S n v , y ; r t n n ! .
The rest of this article is briefly summarized as follows:
In Section 2, we define generating functions for two parametric kinds of Eulerian-type polynomials. By using Euler’s formula and these generating functions with their functional equations, we give relations and computation formulae for these polynomials. By using these formulae, we give a few values of these polynomials. Finally, we give some relations among the Apostol–Bernoulli polynomials, the Apostol–Euler polynomials, the Frobenius–Euler polynomials, the Apostol–Genocchi polynomials, the Stirling numbers, the Fubini-type polynomials and these polynomials.
In Section 3, we give functional equations and differential equations of these generating functions. By using these functional and differential equations, we derive derivative formulae and finite combinatorial sums involving the Apostol–Bernoulli numbers, the Apostol–Euler numbers, the Apostol–Genocchi numbers and for two parametric kinds of Eulerian-type polynomials.
Section 4 is the conclusions section.

2. New Families of Two Parametric Kinds of Eulerian-Type Polynomials

In this section, we construct generating functions for two parametric kinds of Eulerian-type polynomials. By combining these functions with the Euler’s formula, we give not only fundamental properties of these polynomials, but also new identities and relations related to the Apostol–Bernoulli numbers, the Apostol–Euler numbers, the Apostol–Genocchi numbers and for two parametric kinds of Eulerian-type polynomials.
We define the following generating functions for two parametric kinds of Eulerian-type polynomials:
F H C k 1 t , x , y ; λ , u = 1 u λ e t u k 1 e x t cos y t = n = 0 H n C , k 1 x , y ; λ , u t n n ! ,
and
F H S k 2 t , x , y ; λ , u = 1 u λ e t u k 2 e x t sin y t = n = 0 H n S , k 2 x , y ; λ , u t n n ! ,
where k 1 , k 2 N 0 .
The polynomials H n C , k 1 x , y ; λ , u and H n S , k 2 x , y ; λ , u are so-called two parametric kinds of Eulerian-type polynomials of order k 1 and k 2 , respectively.
Note that the symbols C and S occurring in the superscripts on the right-hand sides of Equations (14) and (15) denote the trigonometric cosine and the trigonometric sine functions, respectively.
Remark 1.
Substituting b = 0 and
f t , a u = u 1 u 1 u a e t u
and v = 0 into Equations (12) and (13), we have the following identities, respectively:
h 1 n , x , y , z ; 0 , r , a u , 0 = 2 u 1 u z H n C , z x , y ; a , u
and
h 2 n , x , y , z ; 0 , r , a u , 0 = 2 u 1 u z H n S , z x , y ; a , u .
Remark 2.
Substituting k 1 = k 2 = 1 into (14) and (15), we get the following generating functions, respectively:
F H C t , x , y ; λ , u = 1 u λ e t u e x t cos y t = n = 0 H n C x , y ; λ , u t n n !
and
F H S t , x , y ; λ , u = 1 u λ e t u e x t sin y t = n = 0 H n S x , y ; λ , u t n n ! .
Remark 3.
In ([19], p. 10), the second author defined following generating function for generalized Eulerian-type polynomials of order m:
F λ m t , x ; u , a , b , c = a t u λ b t u m c x t = n = 0 H n m x ; u ; a , b , c ; λ t n n ! .
Substituting a = 1 , b = c = e into the above equation, we have
F H C k 1 t , x , 0 ; λ , u = F λ k 1 t , x ; u , 1 , e , e
and
F H S k 2 t , x , π 2 ; λ , u = F λ k 2 t , x ; u , 1 , e , e .
Theorem 1.
Let n N 0 . Then, we have
H n m x + i y ; λ , u = H n C , m x , y ; λ , u + i H n S , m x , y ; λ , u .
Proof. 
By combining Equations (14) and (15) with the Euler’s formula, we obtain
1 u λ e t u m e x + i y t = n = 0 H n C , m x , y ; λ , u + i H n S , m x , y ; λ , u t n n ! .
Therefore,
n = 0 H n m x + i y ; λ , u t n n ! = n = 0 H n C , m x , y ; λ , u + i H n S , m x , y ; λ , u t n n ! .
Comparing the coefficients of t n n ! on both sides of the aforementioned equation, we arrive at the desired result. □
Theorem 2.
Let n N 0 . Then, we have
C n x , y = u 1 u k 1 k 1 ! j = 0 n n j S 2 n j , k 1 ; λ u H j C , k 1 x , y ; λ , u .
Proof. 
By using (3), (9) and (14), we get the following functional equation:
u k 1 k 1 ! F S 2 t , k 1 ; λ u F H C k 1 t , x , y ; λ , u = 1 u k 1 F C t , x , y .
Using the aforementioned equation, we get
1 u u k 1 n = 0 C n x , y t n n ! = k 1 ! n = 0 S 2 n , k 1 ; λ u t n n ! n = 0 H n C , k 1 x , y ; λ , u t n n ! .
Therefore,
n = 0 C n x , y t n n ! = u 1 u k 1 k 1 ! n = 0 j = 0 n n j S 2 n j , k 1 ; λ u H j C , k 1 x , y ; λ , u t n n ! .
Comparing the coefficients of t n n ! on both sides of the aforementioned equation, we arrive at the desired result. □
Theorem 3.
Let n N 0 . Then, we have
S n x , y = u 1 u k 2 k 2 ! j = 0 n n j S 2 n j , k 2 ; λ u H j S , k 2 x , y ; λ , u .
Proof. 
By using (3), (10) and (15), we obtain the following functional equation:
u k 2 k 2 ! F S 2 t , k 2 ; λ u F H S k 2 t , x , y ; λ , u = 1 u k 2 F S t , x , y .
Using the aforementioned functional equation, we get
1 u u k 2 n = 0 S n x , y t n n ! = k 2 ! n = 0 S 2 n , k 2 ; λ u t n n ! n = 0 H n S , k 2 x , y ; λ , u t n n ! .
Therefore,
n = 0 S n x , y t n n ! = u 1 u k 2 k 2 ! n = 0 j = 0 n n j S 2 n j , k 2 ; λ u H j S , k 2 x , y ; λ , u t n n ! .
Comparing the coefficients of t n n ! on both sides of the aforementioned equation, we arrive at the desired result. □
Theorem 4.
Let n N 0 . Then, we have
H n C , k 1 x , y ; λ , u = j = 0 n 2 1 j n 2 j H n 2 j k 1 x ; λ , u y 2 j .
Proof. 
By using (14) and (6), we obtain the following functional equation:
F H C k 1 t , x , y ; λ , u = F A H k 1 t , x ; λ , u cos y t .
By using the aforementioned equation, we get
n = 0 H n C , k 1 x , y ; λ , u t n n ! = n = 0 H n k 1 x ; λ , u t n n ! n = 0 1 n y t 2 n 2 n ! .
Therefore,
n = 0 H n C , k 1 x , y ; λ , u t n n ! = n = 0 j = 0 n 2 1 j n 2 j H n 2 j k 1 x ; λ , u y 2 j t n n ! .
Comparing the coefficients of t n n ! on both sides of the aforementioned equation, we arrive at the desired result. □
Combining (18) with (8), we get the following corollary:
Corollary 1.
Let n N 0 . Then, we have
H n C , k 1 x , y ; λ , u = 1 u λ u k 1 j = 0 n 2 1 j n 2 j y 2 j H n 2 j k 1 x ; u λ .
Theorem 5.
Let n N . Then, we have
H n S , k 2 x , y ; λ , u = j = 0 n 1 2 1 j n 2 j + 1 H n 1 2 j k 2 x ; λ , u y 2 j + 1 .
Proof. 
By using (15) and (6), we obtain the following functional equation:
F H S k 2 t , x , y ; λ , u = F A H k 2 t , x ; λ , u sin y t .
Using the aforementioned equation, we get
n = 0 H n S , k 2 x , y ; λ , u t n n ! = n = 0 H n k 2 x ; λ , u t n n ! n = 0 1 n y t 2 n + 1 2 n + 1 ! .
Therefore,
n = 0 H n S , k 2 x , y ; λ , u t n n ! = n = 0 j = 0 n 1 2 1 j n 2 j + 1 H n 1 2 j k 2 x ; λ , u y 2 j + 1 t n n ! .
Comparing the coefficients of t n n ! on both sides of the aforementioned equation, we arrive at the desired result. □
Combining (19) with (8), we arrive at the following corollary:
Corollary 2.
Let n N . Then, we have
H n S , k 2 x , y ; λ , u = 1 u λ u k 2 j = 0 n 1 2 1 j n 2 j + 1 y 2 j + 1 H n 1 2 j k 2 x ; u λ .
Theorem 6.
Let n N 0 . Then, we have
H n C , k 1 ( x , y ; λ , u ) = 1 u λ u k 1 j = 0 n n j H j k 1 u λ C n j x , y .
Proof. 
Using (8), (9) and (14), we get
n = 0 H n C , k 1 x , y ; λ , u t n n ! = 1 u λ u k 1 n = 0 H n k 1 u λ t n n ! n = 0 C n x , y t n n ! .
Therefore,
n = 0 H n C , k 1 x , y ; λ , u t n n ! = 1 u λ u k 1 n = 0 j = 0 n n j H j k 1 u λ C n j x , y t n n ! .
Comparing the coefficients of t n n ! on both sides of the aforementioned equation, we arrive at the desired result. □
Theorem 7.
Let n N 0 . Then, we have
H n S , k 2 x , y ; λ , u = 1 u λ u k 2 j = 0 n n j H j k 2 u λ S n j x , y .
Proof. 
Using (8), (10) and (15), we obtain
n = 0 H n S , k 2 x , y ; λ , u t n n ! = 1 u λ u k 2 n = 0 H n k 2 u λ t n n ! n = 0 S n x , y t n n ! .
Therefore,
n = 0 H n S , k 2 x , y ; λ , u t n n ! = 1 u λ u k 2 n = 0 j = 0 n n j H j k 2 u λ S n j x , y t n n ! .
Comparing the coefficients of t n n ! on both sides of the aforementioned equation, we arrive at the desired result. □
By using (20) and (21) in which k 1 = k 2 = m , we have
n = 0 H n C , m x , y ; λ , u + i H n S , m x , y ; λ , u t n n ! = 1 u λ u m n = 0 j = 0 n n j H j m u λ C n j x , y + i S n j x , y t n n ! .
Using the aforementioned Equation (17) and Euler’s formula, we obtain
n = 0 H n m x + i y ; λ , u t n n ! = 1 u λ u m n = 0 j = 0 n n j H j m u λ x + i y n j t n n ! .
Comparing the coefficients of t n n ! on both sides of the aforementioned equation, we get the following theorem:
Theorem 8.
Let n N 0 . Then, we have
H n m x + i y ; λ , u = 1 u λ u m j = 0 n n j H j m u λ x + i y n j .
Theorem 9.
Let n N 0 . Then, we have
H n S , k 1 + k 2 ( 2 x , 2 y ; λ , u ) = 2 j = 0 n n j H j C , k 1 x , y ; λ , u H n j S , k 2 x , y ; λ , u .
Proof. 
By using (14) and (15), we get the following functional equation:
F H S k 1 + k 2 t , 2 x , 2 y ; λ , u = 2 F H C k 1 t , x , y ; λ , u F H S k 2 t , x , y ; λ , u .
Using the aforementioned equation, we get
n = 0 H n S , k 1 + k 2 ( 2 x , 2 y ; λ , u ) t n n ! = 2 n = 0 H n C , k 1 x , y ; λ , u t n n ! n = 0 H n S , k 2 x , y ; λ , u t n n ! .
Therefore,
n = 0 H n S , k 1 + k 2 ( 2 x , 2 y ; λ , u ) t n n ! = 2 n = 0 j = 0 n n j H j C , k 1 x , y ; λ , u H n j S , k 2 x , y ; λ , u t n n ! .
Comparing the coefficients of t n n ! on both sides of the aforementioned equation, we arrive at the desired result. □
Theorem 10.
Let n N 0 . Then, we have
2 j = 0 n n j H j C , k 1 x , y ; λ , u H n j S , k 2 x , y ; λ , u = j = 0 n n j H j k 1 x ; λ , u H n j S , k 2 x , 2 y ; λ , u .
Proof. 
Combining (6), (14) with (15), we obtain the following functional equation:
2 F H C k 1 t , x , y ; λ , u F H S k 2 t , x , y ; λ , u = F A H k 1 t , x ; λ , u F H S k 2 t , x , 2 y ; λ , u .
From the above equation, we have
2 n = 0 H n C , k 1 x , y ; λ , u t n n ! n = 0 H n S , k 2 x , y ; λ , u t n n ! = n = 0 H n k 1 x ; λ , u t n n ! n = 0 H n S , k 2 x , 2 y ; λ , u t n n ! .
Therefore,
2 n = 0 j = 0 n n j H j C , k 1 x , y ; λ , u H n j S , k 2 x , y ; λ , u t n n ! = n = 0 j = 0 n n j H j k 1 x ; λ , u H n j S , k 2 x , 2 y ; λ , u t n n ! .
Comparing the coefficients of t n n ! on both sides of the aforementioned equation, we arrive at the desired result. □
Theorem 11.
Let n N 0 . Then, we have
H n k 1 C , k 1 x , y ; λ , u = 1 u u k 1 1 n k 1 k 1 ! j = 0 n 2 1 j n 2 j B n 2 j k 1 x ; λ u y 2 j .
Proof. 
Combining (1) with (14), we get the following functional equation:
F H C k 1 t , x , y ; λ , u = 1 u u t k 1 F A B k 1 t , x ; λ u cos y t .
By using the aforementioned equation, we get
t k 1 n = 0 H n C , k 1 x , y ; λ , u t n n ! = 1 u u k 1 n = 0 B n k 1 x ; λ u t n n ! n = 0 1 n y t 2 n 2 n ! .
Therefore,
n = 0 n k 1 k 1 ! H n k 1 C , k 1 x , y ; λ , u t n n ! = 1 u u k 1 n = 0 j = 0 n 2 1 j n 2 j B n 2 j k 1 x ; λ u y 2 j t n n ! .
Comparing the coefficients of t n n ! on both sides of the aforementioned equation, we arrive at the desired result. □
Theorem 12.
Let n N . Then, we have
H n k 2 S , k 2 x , y ; λ , u = 1 u u k 2 1 n k 2 k 2 ! j = 0 n 1 2 1 j n 2 j + 1 B n 1 2 j k 2 x ; λ u y 2 j + 1 .
Proof. 
Combining (1) with (15), we obtain the following functional equation:
F H S k 2 t , x , y ; λ , u = 1 u u t k 2 F A B k 2 t , x ; λ u sin y t .
Using the above functional equation, observe that proof of the assertion of (25) follows precisely along the same lines as that proof of the assertion of (24), and so we omit it. □
Theorem 13.
Let n N 0 . Then, we have
H n k 1 C , k 1 x , y ; λ , u = u 1 2 u k 1 1 n k 1 k 1 ! j = 0 n 2 1 j n 2 j G n 2 j k 1 x ; λ u y 2 j .
Proof. 
Combining (5) with (14), we have the following functional equation:
F H C k 1 t , x , y ; λ , u = u 1 2 u t k 1 F A G k 1 t , x ; λ u cos y t .
Using the aforementioned equation, we get
t k 1 n = 0 H n C , k 1 x , y ; λ , u t n n ! = u 1 2 u k 1 n = 0 G n k 1 x ; λ u t n n ! n = 0 1 n y t 2 n 2 n ! .
Therefore,
n = 0 n k 1 k 1 ! H n k 1 C , k 1 x , y ; λ , u t n n ! = u 1 2 u k 1 n = 0 j = 0 n 2 1 j n 2 j G n 2 j k 1 x ; λ u y 2 j t n n ! .
Comparing the coefficients of t n n ! on both sides of the aforementioned equation, we arrive at the desired result. □
Theorem 14.
Let n N . Then, we have
H n k 2 S , k 2 x , y ; λ , u = u 1 2 u k 2 n k 2 k 2 ! j = 0 n 1 2 1 j n 2 j + 1 G n 1 2 j k 2 x ; λ u y 2 j + 1 .
Proof. 
By using (5) and (15), we derive the following functional equation:
F H S k 2 t , x , y ; λ , u = u 1 2 u t k 2 F A G k 2 t , x ; λ u sin y t .
From the above equation, observe that proof of the assertion of (27) follows precisely along the same lines as that proof of assertion of (26), and so we omit it. □
Theorem 15.
Let n N 0 . Then, we have
H n C , k 1 x , y ; λ , u = u 1 2 u k 1 j = 0 n 2 1 j n 2 j E n 2 j k 1 x ; λ u y 2 j .
Proof. 
By using (2) and (14), we derive the following functional equation:
F H C k 1 t , x , y ; λ , u = u 1 2 u k 1 F A E k 1 t , x ; λ u cos y t .
Using the aforementioned equation, we get
n = 0 H n C , k 1 x , y ; λ , u t n n ! = u 1 2 u k 1 n = 0 E n k 1 x ; λ u t n n ! n = 0 1 n y t 2 n 2 n ! .
Therefore,
n = 0 H n C , k 1 x , y ; λ , u t n n ! = u 1 2 u k 1 n = 0 j = 0 n 2 1 j n 2 j E n 2 j k 1 x ; λ u y 2 j t n n ! .
Comparing the coefficients of t n n ! on both sides of the aforementioned equation, we arrive at the desired result. □
Combining (28) with (4), we have the following theorem:
Theorem 16.
Let n N 0 . Then, we have
H n C , k 1 x , y ; λ , u = u 1 u λ k 1 j = 0 n 2 1 j n 2 j y 2 j × l = 0 n 2 j n 2 j l x n 2 j l v = 0 l k 1 + v 1 v v ! λ u λ v S 2 l , v .
For k 1 = 1 , 2 , 3 and n = 1 , 2 , 3 , by using Equation (29), we compute a few values of the polynomials H n C , k 1 ( x , y ; λ , u ) as follows:
For k 1 = 1 , we have
H 0 C , 1 ( x , y ; λ , u ) = u 1 u λ , H 1 C , 1 ( x , y ; λ , u ) = u 1 u λ λ u λ + x , H 2 C , 1 ( x , y ; λ , u ) = u 1 u λ 2 λ 2 u λ 2 + λ 1 + 2 x u λ + x 2 y 2 , H 3 C , 1 ( x , y ; λ , u ) = u 1 u λ 6 λ 3 u λ 3 + 6 λ 2 1 + x u λ 2 + λ 1 + 3 x + 3 x 2 3 y 2 u λ + x 3 3 x y 2 .
For k 1 = 2 , we have
H 0 C , 2 ( x , y ; λ , u ) = u 1 u λ 2 , H 1 C , 2 ( x , y ; λ , u ) = u 1 u λ 2 2 λ u λ + x , H 2 C , 2 ( x , y ; λ , u ) = u 1 u λ 2 6 λ 2 u λ 2 + 2 λ 1 + 2 x u λ + x 2 y 2 , H 3 C , 2 ( x , y ; λ , u ) = u 1 u λ 2 24 λ 3 u λ 3 + 18 λ 2 1 + x u λ 2 + 2 λ 1 + 3 x + 3 x 2 3 y 2 u λ + x 3 3 x y 2 .
For k 1 = 3 , we have
H 0 C , 3 ( x , y ; λ , u ) = u 1 u λ 3 , H 1 C , 3 ( x , y ; λ , u ) = u 1 u λ 3 3 λ u λ + x , H 2 C , 3 ( x , y ; λ , u ) = u 1 u λ 3 12 λ 2 u λ 2 + 3 λ 1 + 2 x u λ + x 2 y 2 , H 3 C , 3 ( x , y ; λ , u ) = u 1 u λ 3 60 λ 3 u λ 3 + 36 λ 2 1 + x u λ 2 + 3 λ 1 + 3 x + 3 x 2 3 y 2 u λ + x 3 3 x y 2 .
Theorem 17.
Let n N . Then, we have
H n S , k 2 x , y ; λ , u = u 1 2 u k 2 j = 0 n 1 2 1 j n 2 j + 1 E n 1 2 j k 2 x ; λ u y 2 j + 1 .
Proof. 
Using (2) and (15), we derive the following functional equation:
F H S k 2 t , x , y ; λ , u = u 1 2 u k 2 F A E k 2 t , x ; λ u sin y t .
From the above equation, observe that proof of the assertion of (30) follows precisely along the same lines as that proof of the assertion of (28), and so we omit it. □
Combining (30) with (4), we have the following theorem:
Theorem 18.
Let n N 0 . Then, we have
H n S , k 2 x , y ; λ , u = u 1 u λ k 2 j = 0 n 1 2 1 j n 2 j + 1 y 2 j + 1 × l = 0 n 1 2 j n 1 2 j l x n 1 2 j l v = 0 l k 2 + v 1 v v ! λ u λ v S 2 l , v .
For k 2 = 1 , 2 , 3 and n = 1 , 2 , 3 , by using Equation (31), we compute a few values of the polynomials H n S , k 2 ( x , y ; λ , u ) as follows:
For k 2 = 1 , we have
H 0 S , 1 ( x , y ; λ , u ) = 0 , H 1 S , 1 ( x , y ; λ , u ) = u 1 u λ y , H 2 S , 1 ( x , y ; λ , u ) = u 1 u λ 2 λ y u λ + 2 x y , H 3 S , 1 ( x , y ; λ , u ) = u 1 u λ 6 λ 2 y u λ 2 + 3 λ y + 2 x y u λ + 3 x 2 y y 3 .
For k 2 = 2 , we have
H 0 S , 2 ( x , y ; λ , u ) = 0 , H 1 S , 2 ( x , y ; λ , u ) = u 1 u λ 2 y , H 2 S , 2 ( x , y ; λ , u ) = u 1 u λ 2 4 λ y u λ + 2 x y , H 3 S , 2 ( x , y ; λ , u ) = u 1 u λ 2 18 λ 2 y u λ 2 + 6 λ y + 2 x y u λ + 3 x 2 y y 3 .
For k 2 = 3 , we have
H 0 S , 3 ( x , y ; λ , u ) = 0 , H 1 S , 3 ( x , y ; λ , u ) = u 1 u λ 3 y , H 2 S , 3 ( x , y ; λ , u ) = u 1 u λ 3 6 λ y u λ + 2 x y , H 3 S , 3 ( x , y ; λ , u ) = u 1 u λ 3 36 λ 2 y u λ 2 + 9 λ y + 2 x y u λ + 3 x 2 y y 3 .
Theorem 19.
Let n N 0 . Then, we have
H n C , 2 k 1 x , y ; 1 , 2 = 1 2 k 1 j = 0 n 2 1 j n 2 j a n 2 j k 1 x y 2 j .
Proof. 
By using (11) and (14), the following functional equation is obtained:
F H C 2 k 1 t , x , y ; 1 , 2 = 1 2 k 1 F a k 1 ( t , x ) cos y t .
Using the aforementioned equation, we get
n = 0 H n C , 2 k 1 x , y ; 1 , 2 t n n ! = 1 2 k 1 n = 0 j = 0 n 2 1 j n 2 j a n 2 j k 1 x y 2 j t n n ! .
Comparing the coefficients of t n n ! on both sides of the aforementioned equation, we arrive at the desired result. □
Theorem 20.
Let n N . Then, we have
H n S , 2 k 2 x , y ; 1 , 2 = 1 2 k 2 j = 0 n 1 2 1 j n 2 j + 1 a n 1 2 j k 2 x y 2 j + 1 .
Proof. 
By using (11) and (15), we derive the following functional equation:
F H S 2 k 2 t , x , y ; 1 , 2 = 1 2 k 2 F a k 2 ( t , x ) sin y t .
From the above equation, observe that proof of the assertion of (33) follows precisely along the same lines as that proof of the assertion of (32), and so we omit it. □

3. Partial Derivative Equations of Generating Functions for Two Parametric Kinds of Eulerian-Type Polynomials

In this section, by applying partial derivative operator to Equations (14) and (15), we give some derivative formulae and finite combinatorial sums for the two parametric kinds of Eulerian-type polynomials.

3.1. Partial Derivative Formulas for the Polynomials H n C , k 1 x , y ; λ , u

Here, partial derivative equations of generating functions for the polynomials H n C , k 1 x , y ; λ , u are given. By applying partial differential operator to Equation (14), we derive derivative formulae and finite combinatorial sums related to the polynomials H n C , k 1 x , y ; λ , u , the Apostol–Bernoulli numbers of higher order, the Apostol–Euler numbers of higher order, and the Apostol–Genocchi numbers of higher order.
Theorem 21.
Let n , m N . Then, we have
m x m H n C , k 1 x , y ; λ , u = 1 u u m j = 0 n n j B j m λ u H n j C , k 1 m x , y ; λ , u .
Proof. 
By applying the derivative operator m x m to Equation (14), we get
n = 0 m x m H n C , k 1 x , y ; λ , u t n n ! = 1 u u m n = 0 B n m λ u t n n ! n = 0 H n C , k 1 m x , y ; λ , u t n n ! .
Therefore,
n = 0 m x m H n C , k 1 x , y ; λ , u t n n ! = 1 u u m n = 0 j = 0 n n j B j m λ u H n j C , k 1 m x , y ; λ , u t n n ! .
Comparing the coefficients of t n n ! on both sides of the aforementioned equation, we arrive at the desired result. □
Theorem 22.
Let n , m N . Then, we have
m x m H n C , k 1 x , y ; λ , u = u 1 2 u m j = 0 n n j G j m λ u H n j C , k 1 m x , y ; λ , u .
Proof. 
By applying the derivative operator m x m to Equation (14), we get
n = 0 m x m H n C , k 1 x , y ; λ , u t n n ! = u 1 2 u m n = 0 G n m λ u t n n ! n = 0 H n C , k 1 m x , y ; λ , u t n n ! .
Therefore,
n = 0 m x m H n C , k 1 x , y ; λ , u t n n ! = u 1 2 u m n = 0 j = 0 n n j G j m λ u H n j C , k 1 m x , y ; λ , u t n n ! .
Comparing the coefficients of t n n ! on both sides of the aforementioned equation, we arrive at the desired result. □
Theorem 23.
Let n , m N with n m . Then, we have
m x m H n C , k 1 x , y ; λ , u = u 1 2 u m n m m ! j = 0 n m n m j E j m λ u H n m j C , k 1 m x , y ; λ , u .
Proof. 
By applying the derivative operator m x m to Equation (14), we obtain
n = 0 m x m H n C , k 1 x , y ; λ , u t n n ! = u 1 2 u m t m n = 0 E n m λ u t n n ! n = 0 H n C , k 1 m x , y ; λ , u t n n ! .
Therefore,
n = 0 m x m H n C , k 1 x , y ; λ , u t n n ! = u 1 2 u m n = 0 j = 0 n m n m j n m m ! E j m λ u H n m j C , k 1 m x , y ; λ , u t n n ! .
Comparing the coefficients of t n n ! on both sides of the aforementioned equation, we arrive at the desired result. □
Combining (34) and (35) with (36), we arrive at the following theorem:
Theorem 24.
Let n , m N 0 with n m . Then, we have
j = 0 n n j B j m λ u H n j C , k 1 m x , y ; λ , u = m ! 2 m n m j = 0 n m n m j E j m λ u H n m j C , k 1 m x , y ; λ , u ,
j = 0 n n j B j m λ u H n j C , k 1 m x , y ; λ , u = 1 2 m j = 0 n n j G j m λ u H n j C , k 1 m x , y ; λ , u ,
and
j = 0 n n j G j m λ u H n j C , k 1 m x , y ; λ , u = n m m ! j = 0 n m n m j E j m λ u H n m j C , k 1 m x , y ; λ , u .

3.2. Partial Derivative Formulas for the Polynomials H n S , k 2 x , y ; λ , u

Here, partial derivative equations for generating functions of the polynomials H n S , k 2 x , y ; λ , u are given.
By applying the partial differential operator to Equation (15), we give derivative formulae and finite combinatorial sums related to the polynomials H n S , k 2 x , y ; λ , u , the Apostol–Bernoulli numbers of higher order, the Apostol–Euler numbers of higher order, and the Apostol–Genocchi numbers of higher order.
Theorem 25.
Let n , m N . Then, we have
m x m H n S , k 2 x , y ; λ , u = 1 u u m j = 0 n n j B j m λ u H n j S , k 2 m x , y ; λ , u .
Proof. 
By applying the derivative operator m x m to Equation (15), we have
n = 0 m x m H n S , k 2 x , y ; λ , u t n n ! = 1 u u m n = 0 B n m λ u t n n ! n = 0 H n S , k 2 m x , y ; λ , u t n n ! .
Therefore,
n = 0 m x m H n S , k 2 x , y ; λ , u t n n ! = 1 u u m n = 0 j = 0 n n j B j m λ u H n j S , k 2 m x , y ; λ , u t n n ! .
Comparing the coefficients of t n n ! on both sides of the aforementioned equation, we arrive at the desired result. □
Theorem 26.
Let n , m N . Then, we have
m x m H n S , k 2 x , y ; λ , u = u 1 2 u m j = 0 n n j G j m λ u H n j S , k 2 m x , y ; λ , u .
Proof. 
By applying the derivative operator m x m to Equation (15), we get
n = 0 m x m H n S , k 2 x , y ; λ , u t n n ! = 1 u 2 u m n = 0 G n m λ u t n n ! n = 0 H n S , k 2 m x , y ; λ , u t n n ! .
Therefore,
n = 0 m x m H n S , k 2 x , y ; λ , u t n n ! = 1 u 2 u m n = 0 j = 0 n n j G j m λ u H n j S , k 2 m x , y ; λ , u t n n ! .
Comparing the coefficients of t n n ! on both sides of the aforementioned equation, after some elementary calculations, we arrive at the desired result. □
Theorem 27.
Let n , m N with n m . Then, we have
m x m H n S , k 2 x , y ; λ , u = u 1 2 u m n m m ! j = 0 n m n m j E j m λ u H n m j S , k 2 m x , y ; λ , u .
Proof. 
By applying derivative operator m x m to Equation (15), we obtain
n = 0 m x m H n S , k 2 x , y ; λ , u t n n ! = 1 u 2 u m t m n = 0 E n m λ u t n n ! n = 0 H n S , k 2 m x , y ; λ , u t n n ! .
Therefore,
n = 0 m x m H n S , k 2 x , y ; λ , u t n n ! = 1 u 2 u m n = 0 n m m ! j = 0 n m n m j E j m λ u H n m j S , k 2 m x , y ; λ , u t n n ! .
Comparing the coefficients of t n n ! on both sides of the aforementioned equation, after some elementary calculations, we arrive at the desired result. □
Combining (37) and (38) with (39), we arrive at the following theorem:
Theorem 28.
Let n , m N 0 with n m . Then, we have
j = 0 n n j B j m λ u H n j S , k 2 m x , y ; λ , u = m ! 2 m n m j = 0 n m n m j E j m λ u H n m j S , k 2 m x , y ; λ , u ,
j = 0 n n j B j m λ u H n j S , k 2 m x , y ; λ , u = 1 2 m j = 0 n n j G j m λ u H n j S , k 2 m x , y ; λ , u ,
and
j = 0 n n j G j m λ u H n j S , k 2 m x , y ; λ , u = n m m ! j = 0 n m n m j E j m λ u H n m j S , k 2 m x , y ; λ , u .

4. Conclusions

In this article, we defined new families of two parametric kinds of Eulerian-type polynomials with their generating functions. Combining the Euler’s formula with these generating functions, their functional equations and partial derivative equations, we investigated some properties of these polynomials. We also derived new identities and relations involving Apostol-type numbers and polynomials, the Stirling numbers, Fubini-type polynomials, combinatorial sums and also the aforementioned new families of polynomials. Thus, the aforementioned results have the potential to motivate the curious researchers and readers for future research on these special numbers and polynomials. Consequently, the results of this article may potentially be used in mathematics, in mathematical physics and in engineering.

Author Contributions

All authors contribute equally to this paper.

Funding

This research received no external funding.

Acknowledgments

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

Conflicts of Interest

The authors declare no conflict of interest.

References

  1. Apostol, T. On the Lerch zeta function. Pac. J. Math. 1951, 1, 161–167. [Google Scholar] [CrossRef] [Green Version]
  2. Bayad, A.; Kim, T. Identities for Apostol-type Frobenius–Euler polynomials resulting from the study of a nonlinear operator. Russ. J. Math. Phys. 2016, 23, 164–171. [Google Scholar] [CrossRef]
  3. Cangul, I.N.; Cevik, S.; Simsek, Y. Generalization of q-Apostol-type Eulerian numbers and polynomials, and their interpolation functions. Adv. Stud. Contemp. Math. 2015, 25, 211–220. [Google Scholar]
  4. Carlitz, L. Eulerian numbers and polynomials. Math. Mag. 1959, 32, 247–260. [Google Scholar] [CrossRef]
  5. Choi, J.; Kim, D.S.; Kim, T.; Kim, Y.H. A note on some identities of Frobenius–Euler numbers and polynomials. Int. J. Math. Math. Sci. 2012, 861797, 1–9. [Google Scholar] [CrossRef]
  6. Duan, R.; Shen, S. Bernoulli polynomials and their some new congruence properties. Symmetry 2019, 11, 365. [Google Scholar] [CrossRef]
  7. Kilar, N.; Simsek, Y. A new family of Fubini type numbers and polynomials associated with Apostol–Bernoulli numbers and polynomials. J. Korean Math. Soc. 2017, 54, 1605–1621. [Google Scholar]
  8. Kilar, N.; Simsek, Y. Relations on Bernoulli and Euler polynomials related to trigonometric functions. Adv. Stud. Contemp. Math. 2019, 29, 191–198. [Google Scholar]
  9. Kilar, N.; Simsek, Y. Some classes of generating functions for generalized Hermite- and Chebyshev-type polynomials: Analysis of Euler’s formula. arXiv 2019, arXiv:1907.03640. [Google Scholar]
  10. Kim, D.S.; Kim, T. Some new identities of Frobenius–Euler numbers and polynomials. J. Inequal. Appl. 2012, 307, 1–10. [Google Scholar] [CrossRef]
  11. Kim, T.; Ryoo, C.S. Some identities for Euler and Bernoulli polynomials and their zeros. Axioms 2018, 7, 56. [Google Scholar] [CrossRef]
  12. Kucukoglu, I.; Simsek, Y. Identities and relations on the q-Apostol type Frobenius–Euler numbers and polynomials. J. Korean Math. Soc. 2019, 56, 265–284. [Google Scholar]
  13. Kurt, B.; Simsek, Y. On the generalized Apostol-type Frobenius–Euler polynomials. Adv. Differ. Equ. 2013, 1, 1–9. [Google Scholar] [CrossRef]
  14. Luo, Q.-M. Apostol–Euler polynomials of higher order and Gaussian hypergeometric functions. Taiwan. J. Math. 2006, 10, 917–925. [Google Scholar] [CrossRef]
  15. 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]
  16. Masjed-Jamei, M.; Koepf, W. Symbolic computation of some power-trigonometric series. J. Symb. Comput. 2017, 80, 273–284. [Google Scholar] [CrossRef]
  17. Simsek, Y. Complete sum of products of (h; q)-extension of Euler polynomials and numbers. J. Differ. Equ. Appl. 2010, 16, 1331–1348. [Google Scholar] [CrossRef]
  18. Simsek, Y. Generating functions for q-Apostol type Frobenius–Euler numbers and polynomials. Axioms 2012, 1, 395–403. [Google Scholar] [CrossRef]
  19. Simsek, Y. Generating functions for generalized Stirling type numbers, Array type polynomials, Eulerian type polynomials and their applications. Fixed Point Theory Appl. 2013, 87, 1–28. [Google Scholar] [CrossRef]
  20. 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] [Green Version]
  21. Srivastava, H.M. Some generalizations and basic (or q-) extensions of the Bernoulli, Euler and Genocchi polynomials. Appl. Math. Inf. Sci. 2011, 5, 390–444. [Google Scholar]
  22. Srivastava, H.M.; Kim, K.; 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]
  23. Srivastava, H.M.; Boutiche, M.A.; Rahmani, M. Some explicit formulas for the Frobenius–Euler polynomials of higher order. Appl. Math. Inf. Sci. 2017, 11, 621–626. [Google Scholar] [CrossRef]
  24. Srivastava, H.M.; Choi, J. Zeta and q-Zeta Functions and Associated Series and Integrals; Elsevier: Amsterdam, The Netherlands, 2012. [Google Scholar]
  25. Srivastava, H.M.; Masjed, M.J.; Beyki, M.R. A parametric type of the Apostol–Bernoulli, Apostol–Euler and Apostol–Genocchi polynomials. Appl. Math. Inf. Sci. 2018, 12, 907–916. [Google Scholar] [CrossRef]
  26. Srivastava, H.M.; Kizilates, C. A parametric kind of the Fubini-type polynomials. RACSAM 2019. [Google Scholar] [CrossRef]
  27. Zhao, J.H.; Chen, Z.Y. Some symmetric identities involving Fubini polynomials and Euler numbers. Symmetry 2018, 10, 303. [Google Scholar]

Share and Cite

MDPI and ACS Style

Kilar, N.; Simsek, Y. Two Parametric Kinds of Eulerian-Type Polynomials Associated with Euler’s Formula. Symmetry 2019, 11, 1097. https://0-doi-org.brum.beds.ac.uk/10.3390/sym11091097

AMA Style

Kilar N, Simsek Y. Two Parametric Kinds of Eulerian-Type Polynomials Associated with Euler’s Formula. Symmetry. 2019; 11(9):1097. https://0-doi-org.brum.beds.ac.uk/10.3390/sym11091097

Chicago/Turabian Style

Kilar, Neslihan, and Yilmaz Simsek. 2019. "Two Parametric Kinds of Eulerian-Type Polynomials Associated with Euler’s Formula" Symmetry 11, no. 9: 1097. https://0-doi-org.brum.beds.ac.uk/10.3390/sym11091097

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop