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 , , denote the set of integers, denote the set of real numbers and denote the set of complex numbers.
Furthermore,
if
, and,
if
, and
denotes the Pochhammer symbol, which is defined as follows:
where
. Moreover,
and
(
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:
where
.
The Apostol–Bernoulli polynomials
of order
m are defined by
where
when
when
and
where
denotes the so-called Apostol–Bernoulli numbers of order
m (
cf. [
1,
21,
22,
24,
25]).
The Apostol–Euler polynomials
of order
m are defined by
where
when
when
and
where
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
where
and
(
cf. [
15,
19,
21]). Substituting
into (
3), the numbers
reduces to the Stirling numbers of the second kind:
(
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:
(
cf. [
14,
24]).
The Apostol–Genocchi polynomials
of order
m are defined by
where
when
when
and
where
denotes the so-called Apostol–Genocchi numbers of order
m (
cf. [
15,
22,
24]).
The Apostol-type Frobenius–Euler polynomials
of order
m are defined by
where
with
,
and
where
denotes the so-called Apostol-type Frobenius–Euler numbers of order
m (
cf. [
2,
19,
22,
24]). Substituting
into (
6), we have
(
cf. [
2,
19,
22,
24]).
Substituting
into (
6), we have
where
denotes the so-called Frobenius–Euler polynomials of order
m.
Substituting
into (
7), we have
where
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
The polynomials
and
are defined respectively by
and
(
cf. [
11,
16,
25]).
By using (
9) and (
10), we have
and
(
cf. [
11,
16,
25]).
In [
7], we defined the following generating function for the Fubini-type polynomials
of order
mSubstituting
into (
11), we have
where
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
. Then, we have
where
and
where
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.
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:
and
where
,
The polynomials and are so-called two parametric kinds of Eulerian-type polynomials of order and , 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 andand into Equations (
12)
and (
13)
, we have the following identities, respectively:and Remark 2. Substituting into (
14)
and (
15)
, we get the following generating functions, respectively:and Remark 3. In ([
19], p. 10)
, the second author defined following generating function for generalized Eulerian-type polynomials of order m: Substituting , into the above equation, we haveand Theorem 1. Let . Then, we have Proof. By combining Equations (
14) and (
15) with the Euler’s formula, we obtain
Comparing the coefficients of on both sides of the aforementioned equation, we arrive at the desired result. □
Theorem 2. Let . Then, we have Proof. By using (
3), (
9) and (
14), we get the following functional equation:
Using the aforementioned equation, we get
Comparing the coefficients of on both sides of the aforementioned equation, we arrive at the desired result. □
Theorem 3. Let . Then, we have Proof. By using (
3), (
10) and (
15), we obtain the following functional equation:
Using the aforementioned functional equation, we get
Comparing the coefficients of on both sides of the aforementioned equation, we arrive at the desired result. □
Theorem 4. Let . Then, we have Proof. By using (
14) and (
6), we obtain the following functional equation:
By using the aforementioned equation, we get
Comparing the coefficients of 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 . Then, we have Theorem 5. Let . Then, we have Proof. By using (
15) and (
6), we obtain the following functional equation:
Using the aforementioned equation, we get
Comparing the coefficients of 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 . Then, we have Theorem 6. Let . Then, we have Proof. Using (
8), (
9) and (
14), we get
Comparing the coefficients of on both sides of the aforementioned equation, we arrive at the desired result. □
Theorem 7. Let . Then, we have Proof. Using (
8), (
10) and (
15), we obtain
Comparing the coefficients of on both sides of the aforementioned equation, we arrive at the desired result. □
By using (
20) and (
21) in which
, we have
Using the aforementioned Equation (
17) and Euler’s formula, we obtain
Comparing the coefficients of
on both sides of the aforementioned equation, we get the following theorem:
Theorem 8. Let . Then, we have Theorem 9. Let . Then, we have Proof. By using (
14) and (
15), we get the following functional equation:
Using the aforementioned equation, we get
Comparing the coefficients of on both sides of the aforementioned equation, we arrive at the desired result. □
Theorem 10. Let . Then, we have Proof. Combining (
6), (
14) with (
15), we obtain the following functional equation:
From the above equation, we have
Comparing the coefficients of on both sides of the aforementioned equation, we arrive at the desired result. □
Theorem 11. Let . Then, we have Proof. Combining (
1) with (
14), we get the following functional equation:
By using the aforementioned equation, we get
Comparing the coefficients of on both sides of the aforementioned equation, we arrive at the desired result. □
Theorem 12. Let . Then, we have Proof. Combining (
1) with (
15), we obtain the following functional equation:
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 . Then, we have Proof. Combining (
5) with (
14), we have the following functional equation:
Using the aforementioned equation, we get
Comparing the coefficients of on both sides of the aforementioned equation, we arrive at the desired result. □
Theorem 14. Let . Then, we have Proof. By using (
5) and (
15), we derive the following functional equation:
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 . Then, we have Proof. By using (
2) and (
14), we derive the following functional equation:
Using the aforementioned equation, we get
Comparing the coefficients of 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 . Then, we have For
and
, by using Equation (
29), we compute a few values of the polynomials
as follows:
Theorem 17. Let . Then, we have Proof. Using (
2) and (
15), we derive the following functional equation:
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 . Then, we have For
and
, by using Equation (
31), we compute a few values of the polynomials
as follows:
Theorem 19. Let . Then, we have Proof. By using (
11) and (
14), the following functional equation is obtained:
Using the aforementioned equation, we get
Comparing the coefficients of on both sides of the aforementioned equation, we arrive at the desired result. □
Theorem 20. Let . Then, we have Proof. By using (
11) and (
15), we derive the following functional equation:
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. □