1. Introduction
Special polynomials and numbers possess much importance in multifarious areas of sciences such as physics, mathematics, applied sciences, engineering and other related research fields covering differential equations, number theory, functional analysis, quantum mechanics, mathematical analysis, mathematical physics and so on,
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] and see also each of the references cited therein. For example; Bernoulli polynomials and numbers are closely related to the Riemann zeta function, which possesses a connection with the distribution of prime numbers,
cf. [
22,
24]. Some of the most significant polynomials in the theory of special polynomials are the Bell, Euler, Bernoulli, Hermite, and Genocchi polynomials. Recently, the aforesaid polynomials and their diverse generalizations have been densely considered and investigated by many physicists and mathematicians,
cf. [
1,
2,
3,
4,
5,
6,
7,
8,
9,
10,
11,
12,
13,
14,
15,
16,
17,
18,
19,
20,
21,
22,
26] and see also the references cited therein.
In recent years, properties of special polynomials arising from umbral calculus have been studied and examined by several mathematicians. For instance, Dere et al. [
7] considered Hermite base Bernoulli type polynomials and, by applying the umbral algebra to these polynomials, gave new identities for the Bernoulli polynomials of higher order, the Hermite polynomials and the Stirling numbers of the second kind. Kim et al. [
11] acquired several new formulas for the Bernulli polynomials based upon the theory of the umbral calculus. Kim et al. [
12] derived some identities of Bernoulli, Euler and Abel polynomials arising from umbral calculus. Kim et al. [
14] studied partially degenerate Bell numbers and polynomials by using umbral calculus and derived some new identities. Kim et al. [
16] investigated some properties and new identities for the degenerate ordered Bell polynomials associated with special polynomials derived from umbral calculus.
In this paper, we consider Bell-based Stirling polynomials of the second kind and derive some useful relations and properties including some summation formulas related to the Bell polynomials and Stirling numbers of the second kind. Then, we introduce Bell-based Bernoulli polynomials of order and investigate multifarious correlations and formulas including some summation formulas and derivative properties. Also, we acquire diverse implicit summation formulas and symmetric identities for Bell-based Bernoulli polynomials of order . Moreover, we analyze some special cases of the results. Furthermore, we attain several interesting formulas of Bell-based Bernoulli polynomials of order arising from umbral calculus to have alternative ways of deriving our results.
2. Preliminaries
Throughout this paper, the familiar symbols , , , and refer to the set of all complex numbers, the set of all real numbers, the set of all integers, the set of all natural numbers and the set of all non-negative integers, respectively.
The Stirling polynomials
and numbers
of the second kind are given by the following exponential generating functions (
cf. [
3,
8,
13,
15,
26]):
In combinatorics, Stirling numbers of the second kind
counts the number of ways in which
n distinguishable objects can be partitioned into
k indistinguishable subsets when each subset has to contain at least one object. The Stirling numbers of the second kind can also be derived by the following recurrence relation for
(
cf. [
3,
8,
13,
15,
26]):
where
for
with
(see [
4,
18,
19]).
For each integer
,
is named the sum of integer powers. The exponential generating function of
is as follows (
cf. [
20]):
The bivariate Bell polynomials are defined as follows:
When
,
is called the classical Bell polynomials (also called exponential polynomials) given by means of the following generating function (
cf. [
3,
4,
9,
26]):
The Bell numbers
are attained by taking
in (
5), that is
and are given by the following exponential generating function (
cf. [
3,
4,
9,
26]):
The Bell polynomials considered by Bell [
26] appear as a standard mathematical tool and arise in combinatorial analysis. Since the first consideration of the Bell polynomials, these polynomials have been intensely investigated and studied by several mathematicians,
cf. [
2,
3,
8,
12,
13,
14,
15,
16,
22,
26] and see also the references cited therein.
The usual Bell polynomials and Stirling numbers of the second kind satisfy the following relation (
cf. [
9])
The Bernoulli polynomials
of order
are defined as follows (
cf. [
1,
7,
11,
12,
18,
21]):
Setting
in (
8), we get
known as the Bernoulli numbers of order
. We also note that when
in (
8), the polynomials
and numbers
reduce to the classical Bernoulli polynomials
and numbers
.
4. Bell-Based Bernoulli Polynomials and Numbers of Order
In this section, we introduce Bell-based Bernoulli polynomials of order and investigate multifarious correlations and formulas including summation formulas, derivation rules, and correlations with the Bell-based Stirling numbers of the second kind.
We now introduce Bell-based Bernoulli polynomials of order as follows.
Definition 2. The Bell-based Bernoulli polynomials of order α are defined by the following exponential generating function: Some special cases of the Bell-based Bernoulli polynomials of order are analyzed below.
Remark 6. In the special casein (18), we acquire Bell-Bernoulli polynomialsof order α, which are also new extensions of the Bernoulli numbers of order α in (8), as follows: Remark 7. Upon lettingin (18), the Bell-based Bernoulli polynomialsof order α reduce to the familiar Bernoulli polynomialsof order α in (8). Remark 8. Whenand, the polynomialsreduce to the usual Bernoulli polynomials.
We also note that
which we call the Bell-based Bernoulli polynomials.
We now perform to derive some properties of the Bell-based Bernoulli polynomials of order and we first provide the following theorem.
Theorem 6. Each of the following summation formulaehold for . Proof. They are similar to Theorem 1. So, we omit them. □
We provide an implicit summation formula for the Bell-based Bernoulli polynomials by the following theorem.
Theorem 7. The following relationshipis valid for.
Proof. Using the following equality
the proof is similar to Theorem 1. So, we omit it. □
One of the special cases of Theorem 7 is given, for every
, by
which is a generalization of the well-known formula for usual Bernoulli polynomials given by (
cf. [
11])
We now provide derivative operator properties for the polynomials as follows.
Theorem 8. The difference operator formulas for the Bell-based Bernoulli polynomialsandhold for.
Proof. Based on the following derivative properties
the proof is completed. □
A recurrence relation for the Bell-based Bernoulli polynomials is given by the following theorem.
Theorem 9. The following summation formulaholds for . Proof. By means of Definition 2, based on the following equality
the proof is done. □
Remark 9. The result (27) is an extension of the well-known formula for Bernoulli polynomials given by (cf. [22,23]) An explicit formula for the Bell-based Bernoulli polynomials is given by the following theorem.
Theorem 10. The following explicit formulaholds for . Proof. By means of Definition 2, based on the following equality
which gives the asserted result. □
We give the following theorem.
Theorem 11. The following formula including the Bell-based Bernoulli polynomials of higher-order and Stirling numbers of the second kindis valid for and . Proof. By means of Definition 2, based on the following equality
the proof is completed. □
Here, we present the following theorem including the Bell-based Bernoulli polynomials and the Stirling polynomials of the second kind.
Theorem 12. The following correlationholds for non-negative integers n. Proof. By means of Definition 2 and, using (
1) and (
19), we obtain
which gives the asserted result (
29). □
A correlation including the Bell-based Bernoulli polynomials of order and the Bell-based Stirling polynomials of the second kind is stated below.
Theorem 13. The following summation formulaholds for non-negative integers k and n with . Proof. By (
4) and (
9), we have
which implies the claimed result (
30). □
Recently, implicit summation formulas and symmetric identities for special polynomials have been studied by some mathematicians,
cf. [
8,
20] and see the references cited therein. Now, we investigate some implicit summation formula and symmetric identities for Bell-based Bernoulli polynomials of order
.
We note that the following series manipulation formulas hold (
cf. [
20,
24]):
and
We give the following theorem.
Theorem 14. The following implicit summation formulaholds. Proof. Upon setting
t by
in (
18), we derive
Again, replacing
z by
x in the last equation, and using (
31), we get
By the last two equations, we obtain
which yields
Utilizing (
32), we acquire
which implies the asserted result (
33). □
Corollary 1. Letting in (33), the following implicit summation formula holds: Corollary 2. Upon setting and replacing x by in (33), we attain Now, we give the following theorem.
Theorem 15. The following symmetric identityholds for and Proof. Then, the expression for
is symmetric in
a and
b, and we derive the following two expansions of
:
and, similarly,
which gives the desired result (
34).
□
Here is another symmetric identity for as follows.
Theorem 16. Let and . Then the following identity holds: Proof. By (
18), the formula (
36) can be expanded as follows
and similarly,
which means the claimed result (
35).
□
Lastly, we provide the following symmetric identity.
Theorem 17. The following symmetric identityholds for and . Proof. By (
3) and (
18), we observe that
and also
which imply the claimed result (
37).
□
5. Applications Arising from Umbral Calculus
We now review briefly the concept of umbral calculus. For the properties of umbral calculus, we refer the reader to see the references [
1,
4,
5,
6,
9,
10,
11,
13,
15,
18].
Let
be the set of all formal power series in the variable
t over
with
Let
be the algebra of polynomials in the single variable
x over the field complex numbers and let
be the vector space of all linear functionals on
. In the umbral calculus,
means the action of a linear functional
L on the polynomial
. This operator has a linear property on
given by
and
for any constant
c in
.
The formal power series
defines a linear functional on
by setting
Taking
in (
38) and (
39) gives
where
Actually, any linear functional
L in
has the form (
38). That is, since
we have
and so as linear functionals
. Moreover, the map
is a vector space isomorphism from
onto
. Henceforth,
will denote both the algebra of formal power series in
t and the vector space of all linear functionals on
, and so an element
of
will be thought of as both a formal power series and a linear functional. From (
39), we have
and so
The order
of a power series
is the smallest integer
k for which the coefficient of
does not vanish. If
, then
is called an invertible series. A series
for which
will be called a delta series (
cf. [
1,
4,
5,
6,
9,
10,
11,
13,
15,
18]).
If
are in
, then
where
We use the notation
for the
k-th derivative operator on
as follows:
If
and
are in
, then
for all polynomials
. Notice that for all
in
, and for all polynomials
Using (
43), we obtain
Thus, from (
44), we note that
Let
be a delta series and let
be an invertible series. Then there exists a unique sequence
of polynomials satisfying the following property:
which is called an orthogonality condition for any Sheffer sequence,
cf. [
1,
4,
5,
6,
9,
10,
11,
13,
15,
18,
22].
The sequence is called the Sheffer sequence for the pair of , or this is Sheffer for , which is denoted by .
Let
be Sheffer for
. Then for any
in
, and for any polynomial
, we have
and the sequence
is Sheffer for
if and only if
for all
x in
, where
.
An important property for the Sheffer sequence
having
is the Appell sequence. It is also called Appell for
with the following consequence:
Further important property for Sheffer sequence
is as follows
For further information about the properties of umbral theory, see [
19] and cited references therein. Recently, several authors have studied Bernoulli polynomials, Euler polynomials with various generalizations under the theory of umbral calculus [
1,
4,
5,
6,
9,
10,
11,
13,
15,
22].
Recall from (
18) that
As
t approaches to 0 in (
50) gives
that stands for
. It means that the generating function of Bell-based Bernoulli polynomials is invertible and thus can be used as an application of Sheffer sequence.
Now we list some properties of Bell-based Bernoulli polynomials arising from umbral calculus as follows.
From (
48) and (
49), we have
and
It follows from (
52) that
is Appell for
.
By (
40) and (
50), we have
which is the special case of the result in (
21). By (
45) and (
50), we also see that
We give the following theorem.
Theorem 18. For all , there exist constants such that , where Proof. By (
46), (
48) and (
51), we observe that
which yield the following relation
which gives the result in (
53). □
We give the following theorem.
Proof. From (
40) and (
50), we get
which is the claimed result (
54). □
Here are some integral formulas by the following theorems.
Theorem 20. Let . We have Proof. By (
41) and (
42), we obtain the following calculations
Thus, from (
55), we arrive at
So, the proof is completed. □
Example 1. If we take in Theorem 20, on the one hand, we derive On the other hand,which yields the following interesting property for Proof. From (
51) and (
52), we write
By (
41) and (
42), we obtain the following calculations
So, the proof is completed. □
Theorem 22. Let n be non-negative integer. Then, we have Proof. By using (
22) and (
25) for
, we obtain
Hence, by utilizing (
52), we obtain
Comparing (
56) with (
57), we complete the proof. □
The following theorem is useful for deriving any polynomial as a linear combination of the Bell-based Bernoulli polynomials.
Theorem 23. For , letwhere Proof. It follows from Theorem 18 that for
, we have
with
Thus, from (
58), we have
Thus the proof is completed. □
When we choose , we have the following corollary, which is given by its proof.
Proof. Recall that the Euler polynomials
are defined by (
cf. [
12,
23])
which yields
and
Set
Then it becomes
Let us now compute the coefficients
as follows
Using
and
we have
□
Recall from (
18) that Bell-based Bernoulli polynomials of order
are given by the following generating function:
If t tends to 0 on the above, we have that stands for . It means that the generating function of Bell-based Bernoulli polynomials of order r is invertible and thus can be used as an application of Sheffer sequence.
Since
is an invertible series. It follows from (
60) that
is Appell for
. So, by (
49), we have
and
We give the following theorem.
Theorem 24. Let n be non-negative integer. Then, we have Therefore, by (
63) and (
64), we arrive at the desired result (
61). □
By setting in Theorem 23, we provide the following Corollary.
Corollary 4. Let and . Then Proof. By Theorem 23, we write
where the coefficient
is given by
From (
60), we have
By comparing the coefficients
in the above equation, we get
From (
65), (
66) and (
67), the proof is completed. □
The following theorem is useful for acquiring any polynomial as a linear combination of the Bell-based Bernoulli polynomials of order r.
Theorem 25. For , we havewhere Proof. Let us assume that
We use a similar method in order to find the coefficient
as same as Theorem 23. So we omit the details and give the following equality:
which gives for
,
Henceforth, by (
68) and coefficient
, the proof is done. □
Finally, we state the following Corollary:
Corollary 5. The following equalityholds for , Proof. Let us consider
. Then, by Theorem 25, we have
From Theorem 25 and (
69), after some basic computations, we arrive at the claimed result. □