Bell-Based Bernoulli Polynomials with Applications

: 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 attain several interesting formulas of Bell-based Bernoulli polynomials of order α arising from umbral calculus.


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.  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. 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 S 2 (n, k : x) t n n! = e t − 1 k k! e tx and ∞ ∑ n=0 S 2 (n, k) t n n! = e t − 1 In combinatorics, Stirling numbers of the second kind S 2 (n, k) 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 ζ ∈ N 0 (cf. [3,8,13,15,26]): where (x) n = x(x − 1)(x − 2) · · · (x − (n − 1)) for n ∈ N with (x) 0 = 1 (see [4,18,19]). For each integer k ∈ N 0 , S k (n) = ∑ n l=0 l k is named the sum of integer powers. The exponential generating function of S k (n) is as follows (cf. [20]): The bivariate Bell polynomials are defined as follows: Bel n (x; y) t n n! = e y(e t −1) e xt .
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 B (α) n (x) of order α are defined as follows (cf. [1,7,11,12,18,21]): Setting n known as the Bernoulli numbers of order α. We also note that when α = 1 in (8), the polynomials B

Bell-Based Stirling Polynomials of the Second Kind
In this section, we introduce the Bell-based Stirling polynomials of the second kind and analyze their elementary properties and relations.
Here is the definition of the Bell-based Stirling polynomials of the second kind as follows.
Definition 1. The Bell-based Stirling polynomials of the second kind are introduced by the following generating function: Diverse special circumstances of Bel S 2 (n, k : x, y) are discussed below: Remark 1. Replacing x = 0 in (9), we acquire Bell-Stirling polynomials Bel S 2 (n, k : y) of the second kind, which are also a new generalization of the usual Stirling numbers of the second kind in (1), as follows: Remark 2. Substituting y = 0 in (9), we get the Stirling polynomials of the second kind given by (1), cf. [11,21,22].

Remark 3.
Upon setting x = y = 0 in (9), the Bell-based Stirling polynomials of the second kind reduce to the classical Stirling numbers of the second kind S 2 (n, k) by (1), cf. [9,22,24].
We now ready to derive some properties of the Bel S 2 (n, k : x, y).

Theorem 1. The following correlation
holds for non-negative integer n.
and Bel S 2 (n, k : x, y) = n ∑ l=0 n l S 2 (l, k : x)Bel n−l (y) (13) hold for non-negative integers n and k with n ≥ k.
Proof. The proofs are similar to Theorem 1.

Theorem 3.
The following summation formulae for Bell-based Stirling polynomials of the second kind Bel S 2 (n, k : and Bel S 2 (n, k : x, y 1 + y 2 ) = n ∑ u=0 n u Bel S 2 (u, k : x, y 1 )Bel n−u (y 2 ) (15) hold for non-negative integers n and k with n ≥ k.

Theorem 4. The following relation
is valid for non-negative integer n.
Theorem 5. The following relation holds for non-negative integer n.
Proof. Utilizing the following equality it is similar to Theorem 1. So, we omit the proof.

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 case x = 0 in (18), we acquire Bell-Bernoulli polynomials Bel B (α) n (y) of order α, which are also new extensions of the Bernoulli numbers of order α in (8), as follows:   n (x; y) reduce to the usual Bernoulli polynomials B n (x).
We also note that Bel B (1) n (x; y) := Bel B n (x; y), 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 formulae 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 relationship
is valid for n ∈ N 0 .
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 n ∈ N 0 , by which is a generalization of the well-known formula for usual Bernoulli polynomials given by We now provide derivative operator properties for the polynomials Bel B (α) n (x; y) as follows.

Theorem 8. The difference operator formulas for the Bell-based Bernoulli polynomials
and hold for n ∈ N.
Proof. Based on the following derivative properties ∂ ∂x e xt+y(e t −1) = te xt+y(e t −1) and ∂ ∂y e xt+y(e t −1) = e t − 1 e xt+y(e t −1) , the proof is completed.
A recurrence relation for the Bell-based Bernoulli polynomials is given by the following theorem.
Theorem 9. The following summation formula Proof. By means of Definition 2, based on the following equality the proof is done. (27) is an extension of the well-known formula for Bernoulli polynomials given by (cf. [22,23])

Remark 9. The result
An explicit formula for the Bell-based Bernoulli polynomials is given by the following theorem.

Theorem 10. The following explicit formula
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 kind is valid for n ∈ N 0 and k ∈ N.
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 correlation
holds 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 Bellbased Stirling polynomials of the second kind is stated below. Theorem 13. The following summation formula l (x 2 ; y 2 ) Bel S 2 (n + k − l, k : x 1 , y 1 ) (30) holds for non-negative integers k and n with n ≥ k.
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. holds.
Proof. Upon setting t by t + u 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 Utilizing (32), we acquire which implies the asserted result (33).

Corollary 2.
Upon setting k = 0 and replacing x by x + z in (33), we attain Now, we give the following theorem.
Theorem 15. The following symmetric identity holds for a, b ∈ R and n ≥ 0. k (ax; y)a n−k b k t n n! and, similarly,

Proof. Let
n−k (ax; y)a k b n−k t n n! , which gives the desired result (34).
Here is another symmetric identity for Bel B (α) n (x; y) as follows.
Theorem 16. Let a, b ∈ R and n ≥ 0. Then the following identity holds: n−k (ax 2 ; y)a k b n−k t n n! and similarly, n−k (bx 1 ; x)a n−k b k t n n! , which means the claimed result (35).
Lastly, we provide the following symmetric identity. holds for a, b ∈ Z and n ≥ 0.
Let F be the set of all formal power series in the variable t over C with Let P be the algebra of polynomials in the single variable x over the field complex numbers and let P * be the vector space of all linear functionals on P. In the umbral calculus, L|p(x) means the action of a linear functional L on the polynomial p(x). This operator has a linear property on P * given by for any constant c in C.
The formal power series defines a linear functional on P by setting f (t)|x n = a n (n ≥ 0).
Taking f (t) = t k in (38) and (39) gives Actually, any linear functional L in P * has the form (38). That is, since we have f L (t)|x n = L|x n , and so as linear functionals L = f L (t). Moreover, the map L → f L (t) is a vector space isomorphism from P * onto F . Henceforth, F will denote both the algebra of formal power series in t and the vector space of all linear functionals on P, and so an element f (t) of F will be thought of as both a formal power series and a linear functional. From (39), we have e yt |x n = y n and so e yt |p(x) = p(y) (p(x) ∈ P).
We use the notation t k for the k-th derivative operator on P as follows: If f (t) and g(t) are in F , then for all polynomials p(x). Notice that for all f (t) in F , and for all polynomials p(x), Using (43), we obtain Thus, from (44), we note that t k p(x) = p (k) (x).
Let f (t) ∈ F be a delta series and let g(t) ∈ F be an invertible series. Then there exists a unique sequence s n (x) 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 s n (x) is called the Sheffer sequence for the pair of (g(t), f (t)), or this s n (x) is Sheffer for (g(t), f (t)), which is denoted by s n (x) ∼ (g(t), f (t)).
Let s n (x) be Sheffer for (g(t), f (t)). Then for any h(t) in F , and for any polynomial p(x), we have and the sequence s n (x) is Sheffer for (g(t), f (t)) if and only if An important property for the Sheffer sequence s n (x) having (g(t), t) is the Appell sequence. It is also called Appell for g(t) with the following consequence: x n ⇔ ts n (x) = ns n−1 (x).
As t approaches to 0 in (50) gives Bel B 0 (x; y) = 1 that stands for o( t e t −1 e xt+y(e t −1) ) = 0. 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.
It follows from (52) that Bel B n (x; y) is Appell for e t −1 t e −y(e t −1) . By (40) and (50), we have Bel B n (x; y) = t e t − 1 e y(e t −1) x n = e y(e t −1) B n (x) which is the special case of the result in (21). By (45) and (50), we also see that We give the following theorem.
We give the following theorem.
Here are some integral formulas by the following theorems.
Theorem 20. Let p(x) ∈ P. 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 p(x) = Bel B n (x; y) in Theorem 20, on the one hand, we derive On the other hand, which yields the following interesting property for n ≥ 0 : Bel B n−u (y)
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 l Bel B n (u + 1; y)du.
The following theorem is useful for deriving any polynomial as a linear combination of the Bell-based Bernoulli polynomials. Theorem 23. For q(x) ∈ P n , let Proof. It follows from Theorem 18 that for q(x) ∈ P n , we have Thus, from (58), we have Thus the proof is completed.
When we choose q(x) = E n (x), we have the following corollary, which is given by its proof. Proof. Recall that the Euler polynomials E n (x) are defined by (cf. [12,23]) Then it becomes Let us now compute the coefficients b k as follows .
Recall from (18) that Bell-based Bernoulli polynomials of order r ∈ N 0 are given by the following generating function: n (x; y) t n n! = t r (e t − 1) r e xt+y(e t −1) .
If t tends to 0 on the above, we have Bel B (r) 0 (x; y) = 1 that stands for o( t r (e t −1) r e xt+y(e t −1) ) = 0. 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. Let g r (t, x) = e t − 1 r t r e −y(e t −1) .
Since g r (t, x) is an invertible series. It follows from (60) that Bel B k (x; y) ∈ P n .
We use a similar method in order to find the coefficient b r k as same as Theorem 23. So we omit the details and give the following equality: Henceforth, by (68) and coefficient b r k , the proof is done.
Finally, we state the following Corollary: From Theorem 25 and (69), after some basic computations, we arrive at the claimed result.

Conclusions
In the present paper, we have considered Bell-based Stirling polynomials of the second kind and derived some useful relations and properties including some summation formulas related to the Bell polynomials and Stirling numbers of the second kind. Then, we have introduced Bell-based Bernoulli polynomials of order α and have investigated multifarious correlations and formulas including some summation formulas and derivative properties. Also, we have acquired diverse implicit summation formulas and symmetric identities for Bell-based Bernoulli polynomials of order α. Moreover, we have analyzed some special cases of the results. Furthermore, we have attained several interesting formulas of Bellbased Bernoulli polynomials of order α arising from umbral calculus to have alternative ways of deriving our results.The results obtained in this paper are generalizations of the many earlier results, some of which are involved in the related references in . For future directions, we will consider that the polynomials introduced in this paper can be examined within the context of the monomiality principle.
Author Contributions: All authors contributed equally to this work. All authors have read and agreed to the published version of the manuscript.
Funding: This research received no external funding.