Next Article in Journal
An Efficient Chicken Search Optimization Algorithm for the Optimal Design of Fuzzy Controllers
Next Article in Special Issue
Explicit, Determinantal, and Recurrent Formulas of Generalized Eulerian Polynomials
Previous Article in Journal
Note on Common Fixed Point Theorems in Convex Metric Spaces
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Bell-Based Bernoulli Polynomials with Applications

1
Department of Basic Sciences of Engineering, Faculty of Engineering and Natural Sciences, Iskenderun Technical University, TR-31200 Hatay, Turkey
2
Department of Economics, Faculty of Economics, Administrative and Social Sciences, Hasan Kalyoncu University, TR-27410 Gaziantep, Turkey
3
Department of Mathematics, Faculty of Arts and Science, University of Gaziantep, TR-27310 Gaziantep, Turkey
*
Author to whom correspondence should be addressed.
Submission received: 5 February 2021 / Revised: 23 February 2021 / Accepted: 24 February 2021 / Published: 2 March 2021
(This article belongs to the Special Issue p-adic Analysis and q-Calculus with Their Applications)

Abstract

:
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.

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 C , R , Z , N and N 0 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 S 2 n , k : x and numbers S 2 n , k of the second kind are given by the following exponential generating functions (cf. [3,8,13,15,26]):
n = 0 S 2 n , k : x t n n ! = e t 1 k k ! e t x and n = 0 S 2 n , k t n n ! = e t 1 k k ! .
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]):
x n = k = 0 n S 2 n , k x k ,
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 = l = 0 n l k is named the sum of integer powers. The exponential generating function of S k n is as follows (cf. [20]):
k = 0 S k n t k k ! = e n + 1 t 1 e t 1 .
The bivariate Bell polynomials are defined as follows:
n = 0 B e l n x ; y t n n ! = e y e t 1 e x t .
When x = 0 , B e l n 0 ; y : = B e l n y is called the classical Bell polynomials (also called exponential polynomials) given by means of the following generating function (cf. [3,4,9,26]):
n = 0 B e l n y t n n ! = e y e t 1 .
The Bell numbers B e l n are attained by taking y = 1 in (5), that is B e l n 0 ; 1 = B e l n 1 : = B e l n and are given by the following exponential generating function (cf. [3,4,9,26]):
n = 0 B e l n t n n ! = e e t 1 .
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])
B e l n y = m = 0 n S 2 n , m y m .
The Bernoulli polynomials B n α x of order α are defined as follows (cf. [1,7,11,12,18,21]):
n = 0 B n α x t n n ! = t e t 1 α e x t t < 2 π .
Setting x = 0 in (8), we get B n α 0 : = B n α known as the Bernoulli numbers of order α . We also note that when α = 1 in (8), the polynomials B n α x and numbers B n α reduce to the classical Bernoulli polynomials B n x and numbers B n .

3. 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:
n = 0 B e l S 2 n , k : x , y t n n ! = e t 1 k k ! e x t + y e t 1 .
Diverse special circumstances of B e l S 2 n , k : x , y are discussed below:
Remark 1.
Replacing x = 0 in (9), we acquire Bell-Stirling polynomials B e l 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:
n = 0 B e l S 2 n , k : y t n n ! = e t 1 k k ! e y e t 1 .
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 B e l S 2 n , k : x , y .
Theorem 1.
The following correlation
B e l S 2 n , k : x , y = u = 0 n n u S 2 u , k B e l n u x ; y
holds for non-negative integer n.
Proof. 
This theorem is proved by (1), (4), and (9), as follows:
n = 0 B e l S 2 n , k : x , y t n n ! = e t 1 k k ! e x t + y e t 1 = n = k S 2 n , k t n n ! n = 0 B e l n x ; y t n n ! = n = 0 u = 0 n n u S 2 u , k B e l n u x ; y t n n ! ,
which provides the desired result (11).    □
Remark 4.
Theorem 1 gives the following formula including the Stirling numbers of the second kind, the Bell-Stirling polynomials of the second kind, and Bell polynomials:
B e l S 2 n , k : y = u = 0 n n u S 2 u , k B e l n u y .
Theorem 2.
The following relations
B e l S 2 n , k : x , y = l = 0 n n l B e l S 2 l , k : y x n l
and
B e l S 2 n , k : x , y = l = 0 n n l S 2 l , k : x B e l n l y
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
B e l S 2 n , k : x 1 + x 2 , y = u = 0 n n u B e l S 2 u , k : x 1 , y x 2 n u
and
B e l S 2 n , k : x , y 1 + y 2 = u = 0 n n u B e l S 2 u , k : x , y 1 B e l n u y 2
hold for non-negative integers n and k with n k .
Proof. 
Using the following equalities
e x 1 + x 2 t + y e t 1 = e x 1 t + y e t 1 e x 2 t and e x t + y 1 + y 2 e t 1 = e x t + y 1 e t 1 e y 2 e t 1 ,
the proofs are similar to Theorem 1. So, we omit them.    □
Theorem 4.
The following relation
B e l S 2 n , k 1 + k 2 : x , y = k 1 ! k 2 ! k 1 + k 2 ! u = 0 n n u B e l S 2 u , k 1 : x , y S 2 n u , k 2
is valid for non-negative integer n.
Proof. 
In view of (1) and (9), we have
n = 0 B e l S 2 n , k 1 + k 2 : x , y t n n ! = e t 1 k 1 + k 2 k 1 + k 2 ! e x t + y e t 1 = k 1 ! k 2 ! k 1 + k 2 ! e t 1 k 1 k 1 e x t + y e t 1 e t 1 k 2 k 2 ! = k 1 ! k 2 ! k 1 + k 2 ! n = 0 u = 0 n n u B e l S 2 u , k 1 : x , y S 2 n u , k 2 t n n ! ,
which gives the asserted result (16).    □
Theorem 5.
The following relation
S 2 n , k = u = 0 n n u B e l S 2 u , k : x , y B e l n u x ; y
holds for non-negative integer n.
Proof. 
Utilizing the following equality
e t 1 k k ! = e t 1 k k ! e x t + y e t 1 e x t y e t 1 ,
it is similar to Theorem 1. So, we omit the proof.    □
Remark 5.
Theorem 5 gives the following formula including the Stirling numbers of the second kind, the Bell-Stirling polynomials of the second kind, and Bell polynomials:
S 2 n , k = u = 0 n n u B e l S 2 u , k : y B e l n u y .

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:
n = 0 B e l B n α x ; y t n n ! = t e t 1 α e x t + y e t 1 .
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 B e l B n α y of order α, which are also new extensions of the Bernoulli numbers of order α in (8), as follows:
n = 0 B e l B n α y t n n ! = t e t 1 α e y e t 1 .
Remark 7.
Upon letting y = 0 in (18), the Bell-based Bernoulli polynomials B e l B n α x ; y of order α reduce to the familiar Bernoulli polynomials B n α x of order α in (8).
Remark 8.
When y = 0 and α = 1 , the polynomials B e l B n α x ; y reduce to the usual Bernoulli polynomials B n x .
We also note that
B e l B n 1 x ; y : = B e l 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
B e l B n α x ; y = k = 0 n n k B k α B e l n k x ; y
B e l B n α x ; y = k = 0 n n k B k α x B e l n k y
B e l B n α x ; y = k = 0 n n k B e l B k α y x n k
hold for n N 0 .
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
B e l B n α 1 + α 2 x 1 + x 2 ; y 1 + y 2 = k = 0 n n k B e l B k α 1 x 1 ; y 1 B e l B n k α 2 x 2 ; y 2
is valid for n N 0 .
Proof. 
Using the following equality
t α 1 + α 2 e t 1 α 1 + α 2 e x 1 + x 2 t + y 1 + y 2 e t 1 = t α 1 e t 1 α 1 e x 1 t + y 1 e t 1 t α 2 e t 1 α 2 e x 2 t + y 2 e t 1 ,
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
B e l B n α x + 1 ; y = k = 0 n n k B e l B k α x ; y ,
which is a generalization of the well-known formula for usual Bernoulli polynomials given by (cf. [11])
B n x + 1 = k = 0 n n k B k x
We now provide derivative operator properties for the polynomials B e l B n α x ; y as follows.
Theorem 8.
The difference operator formulas for the Bell-based Bernoulli polynomials
x B e l B n α x ; y = n B e l B n 1 α x ; y
and
y B e l B n α x ; y = n B e l B n 1 α 1 x ; y .
hold for n N .
Proof. 
Based on the following derivative properties
x e x t + y e t 1 = t e x t + y e t 1 and y e x t + y e t 1 = e t 1 e x t + 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
B e l n x ; y = B e l B n + 1 x + 1 ; y B e l B n + 1 x ; y n + 1 = 1 n + 1 k = 0 n n + 1 k B e l B k x ; y
holds for n N 0 .
Proof. 
By means of Definition 2, based on the following equality
e x t + y e t 1 = e t 1 t n = 0 B e l B n x ; y t n n ! ,
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])
x n = B n + 1 x + 1 B n + 1 x n + 1
An explicit formula for the Bell-based Bernoulli polynomials is given by the following theorem.
Theorem 10.
The following explicit formula
B e l B n x ; y = k = 0 l = 0 k 1 y k k 1 l 1 k l 1 l + x n + 1 n + 1
holds for n N 0 .
Proof. 
By means of Definition 2, based on the following equality
n = 0 B e l B n x ; y t n n ! = t e x t e t 1 e y e t 1 = t e x t k = 0 y k e t 1 k 1 = t k = 0 l = 0 k 1 y k k 1 l 1 k l 1 e l + x t = n = 0 k = 0 l = 0 k 1 y k k 1 l 1 k l 1 l + x n t n 1 n ! ,
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
B e l n x ; y = n ! k ! n + k ! l = 0 n + k n + k l B e l B l k x ; y S 2 n + k l , m
is valid for n N 0 and k N .
Proof. 
By means of Definition 2, based on the following equality
e x t + y e t 1 = k ! t k e t 1 k k ! n = 0 B e l B n k x ; y t n n ! ,
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
B e l B n α x ; y = l = 0 n k = 0 n l x k S 2 l , k B e l B n l α y
holds for non-negative integers n.
Proof. 
By means of Definition 2 and, using (1) and (19), we obtain
n = 0 B e l B n α x ; y t n n ! = t α e t 1 α e y e t 1 e t 1 + 1 x = t α e t 1 α e y e t 1 k = 0 x k e t 1 k k ! = n = 0 l = 0 n k = 0 n l x k S 2 l , k B e l B n l α y t n n ! ,
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 formula
B e l n x 1 + x 2 ; y 1 + y 2 = n ! k ! n + k ! l = 0 n + k n + k l B e l B l k x 2 ; y 2 B e l S 2 n + k l , k : x 1 , y 1
holds for non-negative integers k and n with n k .
Proof. 
By (4) and (9), we have
n = 0 B e l S 2 n , k : x 1 , y 1 t n n ! n = 0 B e l B n k x 2 ; y 2 t n n ! = t k k ! e x 1 + x 2 t + y 1 + y 2 e t 1 ,
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]):
N = 0 f ( N ) ( x + y ) N N ! = n , m = 0 f ( n + m ) x n n ! y m m !
and
k , l = 0 A l , k = k = 0 l = 0 k A l , k l .
We give the following theorem.
Theorem 14.
The following implicit summation formula
B e l B k + l α x ; y = n , m = 0 k , l k n l m x z n + m B e l B k + l n m α z ; y
holds.
Proof. 
Upon setting t by t + u in (18), we derive
t + u e t + u 1 α e y e t + u 1 = e z t + u k , l = 0 B e l B k + l α z ; y t k k ! u l l ! .
Again, replacing z by x in the last equation, and using (31), we get
e x t + u k , l = 0 B e l B k + l α x ; y t k k ! u l l ! = t + u e t + u 1 α e y e t + u 1
By the last two equations, we obtain
k , l = 0 B e l B k + l α x ; y t k k ! u l l ! = e x z t + u k , l = 0 B e l B k + l α z ; y t k k ! u l l ! ,
which yields
k , l = 0 B e l B k + l α x ; y t k k ! u l l ! = n , m = 0 x z n + m t n n ! u m m ! k , l = 0 B e l B k + l α z ; y t k k ! u l l ! .
Utilizing (32), we acquire
k , l = 0 B e l B k + l α x ; y t k k ! u l l ! = k , l = 0 n , m = 0 k , l x z n + m B e l B k + l n m α z ; y n ! m ! k l ! l m ! t k u l ,
which implies the asserted result (33).    □
Corollary 1.
Letting k = 0 in (33), the following implicit summation formula holds:
B e l B l α x ; y = m = 0 l l m x z m B e l B l m α z ; y .
Corollary 2.
Upon setting k = 0 and replacing x by x + z in (33), we attain
B e l B l α x + z ; y = m = 0 l l m x m B e l B l m α z ; y .
Now, we give the following theorem.
Theorem 15.
The following symmetric identity
k = 0 n n k B e l B n k α b x ; y B e l B k α a x ; y a n k b k = k = 0 n n k B e l B k α b x ; y B e l B n k α a x ; y a k b n k
holds for a , b R and n 0 .
Proof. 
Let
Υ = t 2 e a t 1 e b t 1 α e 2 a b x t + y e a t 1 + y e b t 1 .
Then, the expression for Υ is symmetric in a and b, and we derive the following two expansions of Υ :
Υ = n = 0 B e l B n α b x ; y a t n n ! n = 0 B e l B n α a x ; y b t n n ! = n = 0 k = 0 n n k B e l B n k α b x ; y B e l B k α a x ; y a n k b k t n n !
and, similarly,
Υ = n = 0 k = 0 n n k B e l B k α b x ; y B e l B n k α a x ; y a k b n k t n n ! ,
which gives the desired result (34).
Here is another symmetric identity for B e l B n α x ; y as follows.
Theorem 16.
Let a , b R and n 0 . Then the following identity holds:
k = 0 n i = 0 b 1 j = 0 a 1 n k B e l B k α i + b a j + b x 1 ; y B e l B n k α a x 2 ; y a k b n k = k = 0 n i = 0 b 1 j = 0 a 1 n k B e l B k α a b i + j + a x 2 ; y B e l B n k α b x 1 ; y b k a n k .
Proof. 
Let
Ψ = a t α b t α e a t 1 α + 1 e b t 1 α + 1 e a b t 1 2 e a b x 1 + x 2 t + y e a t 1 + x e b t 1 = a t e a t 1 α e a b t 1 e a t 1 e a b x 1 t + y e a t 1 b t e b t 1 α e a b t 1 e b t 1 e a b x 2 t + y e b t 1 .
By (18), the formula (36) can be expanded as follows
Ψ = a t e a t 1 α e a b x 1 t + y e a t 1 i = 0 b 1 e a t i b t e b t 1 α e a b x 2 t + y e b t 1 j = 0 a 1 e b t j = i = 0 b 1 j = 0 a 1 a t e a t 1 α e i + b a j + b x 1 a t + y e a t 1 b t e b t 1 α e a b x 2 t + y e b t 1 = n = 0 k = 0 n i = 0 b 1 j = 0 a 1 n k B e l B k α i + b a j + b x 1 ; y B e l B n k α a x 2 ; y a k b n k t n n !
and similarly,
Ψ = n = 0 k = 0 n i = 0 b 1 j = 0 a 1 n k B e l B k α a b i + j + a x 2 ; x B e l B n k α b x 1 ; x a n k b k t n n ! ,
which means the claimed result (35).
Lastly, we provide the following symmetric identity.
Theorem 17.
The following symmetric identity
l = 0 n k = 0 l n l l k S n l b 1 B e l B k α b x 1 ; y B e l B l k α + 1 a x 2 ; y a n + k + 1 l b l k = l = 0 n k = 0 l n l l k S n l a 1 B e l B k α a x 2 ; y B e l B l k α + 1 b x 1 ; y b n + k + 1 l a l k
holds for a , b Z and n 0 .
Proof. 
Let
Ω = a t α + 1 b t α + 1 e a t 1 α + 1 e b t 1 α + 1 e a b t 1 e a b x 1 + x 2 t + y e a t 1 + y e b t 1 .
By (3) and (18), we observe that
Ω = a t e a b t 1 e a t 1 a t e a t 1 α e a b x 1 t + y e a t 1 b t e b t 1 α + 1 e a b x 2 t + y e b t 1 = a t n = 0 S n b 1 a t n n ! n = 0 B e l B n α b x 1 ; y a t n n ! n = 0 B e l B n α + 1 a x 2 ; y b t n n ! = n = 0 l = 0 n k = 0 l n l l k S n l b 1 B e l B k α b x 1 ; y B e l B l k α + 1 a x 2 ; y a n + k + 1 l b l k t n 1 n !
and also
Ω = n = 0 l = 0 n k = 0 l n l l k S n l a 1 B e l B k α a x 2 ; y B e l B l k α + 1 b x 1 ; y a l k b n + k + 1 l t n 1 n ! ,
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 F be the set of all formal power series in the variable t over C with
F = f f ( t ) = k = 0 a k t k k ! , ( a k C ) .
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
L + M | p ( x ) = L | p ( x ) + M | p ( x )
and
c L | p ( x ) = c L | p ( x )
for any constant c in C .
The formal power series
f ( t ) = k = 0 a k t k k !
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
t k | x n = n ! δ n , k , ( n , k 0 )
where
δ n , k = 1 , if n = k 0 , if n k .
Actually, any linear functional L in P * has the form (38). That is, since
f L ( t ) = k = 0 L | x k t k k ! ,
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 y t | x n = y n
and so
e y t | p ( x ) = p ( y ) ( p ( x ) P ) .
The order o ( f ( t ) ) of a power series f ( t ) is the smallest integer k for which the coefficient of t k does not vanish. If o ( f ( t ) ) = 0 , then f ( t ) is called an invertible series. A series f ( t ) for which o ( f ( t ) ) = 1 will be called a delta series (cf. [1,4,5,6,9,10,11,13,15,18]).
If f 1 ( t ) , . . . , f m ( t ) are in F , then
f 1 ( t ) . . . f m ( t ) | x n = i 1 + i 2 + . . . + i m = n n i 1 , . . . , i m f 1 ( t ) | x i 1 . . . f m ( t ) | x i m ,
where
n i 1 , , i r = n ! i 1 ! i r ! .
We use the notation t k for the k-th derivative operator on P as follows:
t k x n = n ! n k ! x n k , k n 0 , k > n .
If f ( t ) and g ( t ) are in F , then
f ( t ) g ( t ) | p ( x ) = f ( t ) | g ( t ) p ( x ) = g ( t ) | f ( t ) p ( x )
for all polynomials p ( x ) . Notice that for all f ( t ) in F , and for all polynomials p ( x ) ,
f ( t ) = k = 0 f ( t ) | x k t k k ! and p ( x ) = k = 0 t k | p ( x ) x k k ! .
Using (43), we obtain
p ( k ) ( x ) : = D k p ( x ) = l = k t l | p ( x ) l ! x l k s = 1 k l s + 1
providing
p ( k ) ( 0 ) = t k | p ( x ) and 1 | p ( k ) ( x ) = p ( k ) ( 0 ) .
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:
g ( t ) f ( t ) k | s n ( x ) = n ! δ n , k n , k 0 ,
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
h ( t ) = k = 0 h ( t ) | s k ( x ) k ! g ( t ) f ( t ) k , p ( x ) = k = 0 g ( t ) f ( t ) k | p ( x ) k ! s k ( x )
and the sequence s n ( x ) is Sheffer for ( g ( t ) , f ( t ) ) if and only if
1 g ( f ¯ ( t ) ) e x f ¯ ( t ) = n = 0 s n ( x ) t n n !
for all x in C , where f ¯ f ( t ) = f f ¯ t = t .
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:
s n ( x ) = 1 g ( t ) x n t s n ( x ) = n s n 1 ( x ) .
Further important property for Sheffer sequence s n ( x ) is as follows
s n ( x ) is Appell for g t 1 g ( t ) e x t = n = 0 s n ( x ) t n n ! x C .
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
n = 0 B e l B n x ; y t n n ! = t e t 1 e x t + y e t 1 .
As t approaches to 0 in (50) gives B e l B 0 x ; y = 1 that stands for o ( t e t 1 e x t + 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.
From (48) and (49), we have
B e l B n x ; y e t 1 t e y e t 1 , t
and
t B e l B n x ; y = n B e l B n 1 x ; y .
It follows from (52) that B e l B n x ; y is Appell for e t 1 t e y e t 1 .
By (40) and (50), we have
B e l B n x ; y = t e t 1 e y e t 1 x n = e y e t 1 B n x = k = 0 n n k B e l k y B n k x ,
which is the special case of the result in (21). By (45) and (50), we also see that
B e l B n x ; y = t e t 1 e y e t 1 x n = t e t 1 B e l n x ; y = k = 0 B k k ! t k B e l n x ; y = k = 0 n n k B k B e l n k x ; y .
We give the following theorem.
Theorem 18.
For all p x P , there exist constants c 0 , c 1 , , c n such that p x = k = 0 n c k B e l B k x ; y , where
c k = 1 k ! e t 1 t e y e t 1 t k p x .
Proof. 
By (46), (48) and (51), we observe that
e t 1 t e y e t 1 t k B e l B n x ; y = n ! δ n , k n , k 0 ,
which yield the following relation
e t 1 t e y e t 1 t k p x = l = 0 n c l e t 1 t e y e t 1 t k B e l B l x ; y = l = 0 n c l l ! δ l , k = k ! c k ,
which gives the result in (53).    □
We give the following theorem.
Theorem 19.
For n > 0 , we have
B e l B n x ; y = n k = 1 l = 0 k 1 y k k ! k 1 l 1 k 1 l x + l n 1 .
Proof. 
From (40) and (50), we get
B e l B n x ; y = t e t 1 e y e t 1 x n = t e t 1 k = 0 y k e t 1 k k ! x n = t k = 1 l = 0 k 1 y k k ! k 1 l 1 k 1 l e l t x n = n k = 1 l = 0 k 1 y k k ! k 1 l 1 k 1 l x + l n 1 ,
which is the claimed result (54).    □
Here are some integral formulas by the following theorems.
Theorem 20.
Let p ( x ) P . We have
e t 1 t e y e t 1 p x = k = 0 l = 0 k + 1 y k k + 1 l 1 k l + 1 0 l p u d u .
Proof. 
By (41) and (42), we obtain the following calculations
e t 1 t e y e t 1 x n = 1 n + 1 e t 1 t e y e t 1 t x n + 1 = 1 n + 1 k = 0 y k e t 1 k + 1 | x n + 1 = 1 n + 1 k = 0 l = 0 k + 1 y k k + 1 l 1 k l + 1 e l t | x n + 1 = 1 n + 1 k = 0 l = 0 k + 1 y k k + 1 l 1 k l + 1 l n + 1 = k = 0 l = 0 k + 1 y k k + 1 l 1 k l + 1 0 l x n d x .
Thus, from (55), we arrive at
e t 1 t e y e t 1 t k p x = k = 0 l = 0 k + 1 y k k + 1 l 1 k l + 1 0 l p u d u p ( x ) P .
So, the proof is completed.    □
Example 1.
If we take p ( x ) = B e l B n x ; y in Theorem 20, on the one hand, we derive
k = 0 l = 0 k + 1 y k k + 1 l 1 k l + 1 0 l B e l B n x ; y d x = e t 1 t e y e t 1 B e l B n x ; y = 1 e t 1 t e y e t 1 t B e l B n + 1 x ; y n + 1 = 1 n + 1 t 0 | x n + 1 = n ! δ n + 1 , 0 .
On the other hand,
n + 1 k = 0 l = 0 k + 1 y k k + 1 l 1 k l + 1 0 l B e l B n x ; y d x = n + 1 k = 0 l = 0 k + 1 y k k + 1 l 1 k l + 1 u = 0 n n u B e l B n u y 0 l x u d x = k = 0 l = 0 k + 1 u = 0 n B e l B n u y n + 1 u + 1 k + 1 l y k 1 k l + 1 l u + 1 ,
which yields the following interesting property for n 0 :
k = 0 l = 0 k + 1 u = 0 n B e l B n u y n + 1 u + 1 k + 1 l y k 1 k l + 1 l u + 1 = 0 .
Theorem 21.
We have
e t 1 t e y e t 1 x n = 0 1 B e l n u ; y d u .
Proof. 
From (51) and (52), we write
B e l B n x ; y = t e t 1 e y e t 1 x n ( n 0 ) .
By (41) and (42), we obtain the following calculations
e t 1 t e y e t 1 x n = 1 n + 1 e t 1 t e y e t 1 t x n + 1 = 1 n + 1 e t 1 e y e t 1 | x n + 1 = 1 n + 1 k = 0 B e l k 1 ; y B e l k y k ! t k | x n + 1 = 1 n + 1 k = 0 B e l k 1 ; y B e l k y k ! n + 1 ! δ n + 1 , k = B e l n + 1 1 ; y B e l n + 1 y n + 1 = 0 1 B e l n u ; y d u .
So, the proof is completed.    □
Theorem 22.
Let n be non-negative integer. Then, we have
e t 1 t e y e t 1 B e l B n x ; y = k = 0 l = 0 k + 1 y k k + 1 l 1 k l + 1 l l + 1 B e l B n u + 1 ; y d u .
Proof. 
By using (22) and (25) for α = 1 , we obtain
x x + z B e l B n u ; y d u = 1 n + 1 B e l B n + 1 x + z ; y B e l B n + 1 x ; y .
Hence, by utilizing (52), we obtain
e t 1 t e y e t 1 B e l B n x ; y = 1 n + 1 e t 1 t e y e t 1 t B e l B n + 1 x ; y = 1 n + 1 k = 0 l = 0 k y k k l 1 k l e l + 1 t e l t B e l B n + 1 x ; y = 1 n + 1 k = 0 l = 0 k + 1 y k k + 1 l 1 k l + 1 B e l B n + 1 l + 1 ; y B e l B n + 1 l ; y = k = 0 l = 0 k + 1 y k k + 1 l 1 k l + 1 l l + 1 B e l B n u + 1 ; y d u .
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 q ( x ) P n , let
q ( x ) = k = 0 n b k B e l B k x ; y ,
where
b k = m = 0 l = 0 m y m m l 1 m l q k 1 l + 1 q k 1 l k ! .
Proof. 
It follows from Theorem 18 that for q ( x ) P n , we have
q ( x ) = k = 0 n b k B e l B k x ; y ,
with
e t 1 t e y e t 1 t k | q x = k ! b k .
Thus, from (58), we have
b k = 1 k ! e t 1 e y e t 1 t k 1 | q x = 1 k ! m = 0 l = 0 m y m m l 1 m l e l + 1 t e l t t k 1 q x = 1 k ! m = 0 l = 0 m y m m l 1 m l e l + 1 t e l t q k 1 x = 1 k ! m = 0 l = 0 m y m m l 1 m l q k 1 l + 1 q k 1 l .
Thus the proof is completed.    □
When we choose q x = E n x , we have the following corollary, which is given by its proof.
Corollary 3.
Let n 1 . We have
E n x = m = 0 l = 0 m y m m l 1 m l B e l B n x ; y + 2 k = 0 n 1 n k 1 k ! m = 0 l = 0 m y m 1 m l m l l n k + 1 E n k + 1 l B e l B k x ; y .
Proof. 
Recall that the Euler polynomials E n ( x ) are defined by (cf. [12,23])
n = 0 E n ( x ) t n n ! = 2 e t + 1 e x t
which yields
E n ( x ) e t + 1 2 , t n 0
and
t E n ( x ) = n E n 1 ( x ) .
Set
q ( x ) = E n ( x ) P n .
Then it becomes
E n ( x ) = k = 0 n b k B e l B k x ; y .
Let us now compute the coefficients b k as follows
b k = 1 k ! e t 1 e y e t 1 t k 1 | E n x = n k 1 k ! e t 1 e y e t 1 E n k + 1 x = n k 1 k ! m = 0 l = 0 m y m m l 1 m l e l + 1 t e l t E n k + 1 x = n k 1 k ! m = 0 l = 0 m y m m l 1 m l E n k + 1 l + 1 E n k + 1 l .
Using E 1 x = x 1 2 and
E n x + 1 E n x = 2 x n E n x ,
we have
E n x = b n B e l B n x ; y + k = 0 n 1 b k B e l B k x ; y = m = 0 l = 0 m y m m l 1 m l B e l B n x ; y + 2 k = 0 n 1 n k 1 k ! m = 0 l = 0 m y m 1 m l m l l n k + 1 E n k + 1 l B e l B k x ; y .
Recall from (18) that Bell-based Bernoulli polynomials of order r N 0 are given by the following generating function:
n = 0 B e l B n r x ; y t n n ! = t r e t 1 r e x t + y e t 1 .
If t tends to 0 on the above, we have B e l B 0 r x ; y = 1 that stands for o ( t r e t 1 r e x t + 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 B e l B n r x ; y is Appell for e t 1 t r e y e t 1 . So, by (49), we have
B e l B n r x ; y = 1 g r ( t , x ) x n ,
and
t B e l B n r x ; y = n B e l B n r x ; y .
Thus, we have
B e l B n r x ; y e t 1 r t r e y e t 1 , t .
We give the following theorem.
Theorem 24.
Let n be non-negative integer. Then, we have
B e l B n r x = i 1 + + i r = n n i 1 , , i r B e l B i r x j = 1 r 1 B i j .
Proof. 
By (39) and (60), we get
t r e t 1 r e z t + y e t 1 | x n = B e l B n r z ; y = l = 0 n n l B e l B n l r y z l .
Here we find that
t r e t 1 r e y e t 1 x n = t e t 1 × × t e y e t 1 e t 1 x n = i 1 + + i r = n n i 1 , , i r B e l B i r y × B i 1 × × B i r 1 .
By using (62), we have
t r e t 1 r e y e t 1 | x n = B e l B n r y .
Therefore, by (63) and (64), we arrive at the desired result (61).    □
By setting q ( x ) = B e l B n r x ; y P n in Theorem 23, we provide the following Corollary.
Corollary 4.
Let n N 0 and r N 0 . Then
B e l B n r x ; y = k = 0 n m = 0 l = 0 m m l n k y m 1 m l B e l B n k r 1 l ; y B e l B k x ; y .
Proof. 
By Theorem 23, we write
B e l B n r x ; y = k = 0 n b k B e l B k x ; y ,
where the coefficient b k is given by
b k = m = 0 l = 0 m y m m l 1 m l q k 1 l + 1 q k 1 l k ! = m = 0 l = 0 m y m m l 1 m l n k 1 k ! B e l B n k + 1 r l + 1 ; y B e l B n k + 1 r l ; y .
From (60), we have
n = 0 B e l B n r l + 1 ; y B e l B n r l ; y t n n ! = t r e t 1 r e l t + y e t 1 e t 1 = t t r 1 e t 1 r 1 e l t + y e t 1 = n = 0 B e l B n r 1 l ; y t n + 1 n ! .
By comparing the coefficients t n in the above equation, we get
B e l B n r l + 1 ; y B e l B n r l ; y = n B e l B n 1 r 1 l ; y .
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 n N 0 , we have
q ( x ) = k = 0 n b k r B e l B k r x ; y P n ,
where
b k r = 1 k ! m = 0 l = 0 m + r y m m + r l 1 m + r l q k r l .
Proof. 
Let us assume that
q ( x ) = k = 0 n b k r B e l B k r x ; y P n .
We use a similar method in order to find the coefficient b k r as same as Theorem 23. So we omit the details and give the following equality:
e t 1 r t r e y e t 1 t k | q x = l = 0 n b l r e t 1 r t r e y e t 1 t k B e l B n r x ; y = l = 0 n b l r l ! δ l , k = k ! b k r
which gives for k r ,
b k r = 1 k ! e t 1 r t r e y e t 1 t k | q x = 1 k ! m = 0 y m e t 1 m + r t k r | q x = 1 k ! m = 0 l = 0 m + r y m m + r l 1 m + r l e t l | q k r x = 1 k ! m = 0 l = 0 m + r y m m + r l 1 m + r l q k r l .
Henceforth, by (68) and coefficient b k r , the proof is done.    □
Finally, we state the following Corollary:
Corollary 5.
The following equality
B e l B n x ; y = k = 0 n m = 0 l = 0 m + r m + r l y m 1 m + r l n k r k ! B e l B n k + r l ; y B e l B k r x ; y
holds for n , r N 0 ,
Proof. 
Let us consider q ( x ) = B e l B n x ; y P n . Then, by Theorem 25, we have
B e l B n x ; y = k = 0 n b k r B e l B k r x ; y .
From Theorem 25 and (69), after some basic computations, we arrive at the claimed result.    □

6. 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 Bell-based 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 [1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23]. 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.

Acknowledgments

We would like to thank the reviewers for their careful reading our manuscript, which have improved the paper substantially.

Conflicts of Interest

The authors declare no conflict of interest.

References

  1. Acikgoz, M.; Ates, R.; Duran, U.; Araci, S. Applications of q-Umbral Calculus to Modified Apostol Type q-Bernoulli Polynomials. J. Math. Stat. 2018, 14, 7–15. [Google Scholar] [CrossRef] [Green Version]
  2. Benbernou, S.; Gala, S.; Ragusa, M.A. On the regularity criteria for the 3D magnetohydrodynamic equations via two components in terms of BMO space. Math. Methods Appl. Sci. 2014, 37, 2320–2325. [Google Scholar] [CrossRef]
  3. Boas, R.P.; Buck, R.C. Polynomial Expansions of Analytic Functions; Springer: Berlin/Gottingen/Heidelberg, Germany, 1958. [Google Scholar]
  4. Carlitz, L. Some remarks on the Bell numbers. Fibonacci Quart. 1980, 18, 66–73. [Google Scholar]
  5. Dere, R.; Simsek, Y.; Srivastava, H.M. A unified presentation of three families of generalized Apostol type polynomials based upon the theory of the umbral calculus and the umbral algebra. J. Number Theory 2013, 133, 3245–3263. [Google Scholar] [CrossRef]
  6. Dere, R.; Simsek, Y. Applications of umbral algebra to some special polynomials. Adv. Stud. Contemp. Math. 2012, 22, 433–438. [Google Scholar]
  7. Dere, R.; Simsek, Y. Hermite base Bernoulli type polynomials on the umbral algebra. Russ. J. Math. Phys. 2015, 22, 1–5. [Google Scholar] [CrossRef] [Green Version]
  8. Khan, S.; Pathan, M.A.; Hassan, N.A.M.; Yasmin, G. Implicit summation formulae for Hermite and related polynomials. J. Math. Anal. Appl. 2008, 344, 408–416. [Google Scholar] [CrossRef] [Green Version]
  9. Kim, D.S.; Kim, T. Some identities of Bell polynomials. Sci. China Math. 2015, 58, 2095–2104. [Google Scholar] [CrossRef]
  10. Kim, T.; Kim, D.S.; Jang, G.-W.; Jang, L.C. A generalizations of some results for Appell polynomials to Sheffer polynomials. J. Comput. Anal. Appl. 2019, 26, 889–898. [Google Scholar]
  11. Kim, D.S.; Kim, T. Umbral calculus associated with Bernoulli polynomials. J. Number Theory 2015, 147, 871–882. [Google Scholar] [CrossRef] [Green Version]
  12. Kim, D.S.; Kim, T.; Lee, S.-H.; Rim, S.-H. Some identities of Bernoulli, Euler and Abel polynomials arising from umbral calculus. Adv. Differ. Equ. 2013, 2013, 15. [Google Scholar] [CrossRef] [Green Version]
  13. Kim, T.; Kim, D.S.; Jang, L.-C.; Lee, H.; Kim, H.-Y. Complete and incomplete Bell polynomials associated with Lah-Bell numbers and polynomials. Adv. Differ. Equ. 2021, 2021, 101. [Google Scholar] [CrossRef]
  14. Kim, T.; Kim, D.S.; Kwon, H.-I.; Rim, S.-H. Some identities for umbral calculus associated with partially degenerate Bell numbers and polynomials. J. Nonlinear Sci. Appl. 2017, 10, 2966–2975. [Google Scholar] [CrossRef] [Green Version]
  15. Kim, T.; Kim, D.S.; Jang, G.-W.; Kwon, J. Fourier series of higher-order ordered Bell functions. J. Nonlinear Sci. And Applications 2017, 10, 3851–3855. [Google Scholar] [CrossRef] [Green Version]
  16. Kim, T.; Kim, D.S.; Jang, G.-W.; Jang, L.-C. Degenerate ordered Bell numbers and polynomials associated with umbral calculus. J. Nonlinear Sci. Appl. 2017, 10, 5142–5155. [Google Scholar] [CrossRef] [Green Version]
  17. Kim, T.; Kim, D.S.; Dolgy, D.-V.; Kwon, J. Fourier series of finite product of Bernoulli and ordered Bell functions. J. Nonlinear Sci. Appl. 2018, 11, 500–515. [Google Scholar] [CrossRef] [Green Version]
  18. Kim, T.; Kim, D.S.; Kim, H.Y.; Kwon, J. Some identities of degenerate Bell polynomials. Mathematics 2020, 8, 40. [Google Scholar] [CrossRef] [Green Version]
  19. Kucukoglu, I.; Simsek, B.; Simsek, Y. Generating functions for new families of combinatorial numbers and polynomials: Approach to Poisson-Charlier polynomials and probability distribution function. Axioms 2019, 8, 112. [Google Scholar] [CrossRef] [Green Version]
  20. Pathan, M.A.; Khan, W.A. Some implicit summation formulas and symmetric identities for the generalized Hermite-Bernoulli polynomials. Mediterr. J. Math. 2015, 12, 679–695. [Google Scholar] [CrossRef]
  21. Roman, S. The Umbral Calculus; Academic Press, Inc.: New York, NY, USA, 1984. [Google Scholar]
  22. Srivastava, H.M.; Choi, J. Zeta and q-Zeta Functions and Associated Series and Integrals; Elsevier Science Publishers: Amsterdam, The Netherlands, 2012; 674 p. [Google Scholar]
  23. Srivastava, H.M.; Pinter, A. Remarks on some relationships between the Bernoulli and Euler polynomials. Appl. Math. Lett. 2004, 17, 375–380. [Google Scholar] [CrossRef] [Green Version]
  24. Srivastava, H.M.; Manocha, H.L. A Treatise on Generating Functions; Ellis Horwood Limited. Co.: New York, NY, USA, 1984. [Google Scholar]
  25. Wang, W.; Wang, T. Identities on Bell polynomials and Sheffer sequences. Discret. Math. 2009, 309, 1637–1648. [Google Scholar] [CrossRef]
  26. Bell, E.T. Exponential polynomials. Ann. Math. 1934, 35, 258–277. [Google Scholar] [CrossRef]
Publisher’s Note: MDPI stays neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Share and Cite

MDPI and ACS Style

Duran, U.; Araci, S.; Acikgoz, M. Bell-Based Bernoulli Polynomials with Applications. Axioms 2021, 10, 29. https://0-doi-org.brum.beds.ac.uk/10.3390/axioms10010029

AMA Style

Duran U, Araci S, Acikgoz M. Bell-Based Bernoulli Polynomials with Applications. Axioms. 2021; 10(1):29. https://0-doi-org.brum.beds.ac.uk/10.3390/axioms10010029

Chicago/Turabian Style

Duran, Ugur, Serkan Araci, and Mehmet Acikgoz. 2021. "Bell-Based Bernoulli Polynomials with Applications" Axioms 10, no. 1: 29. https://0-doi-org.brum.beds.ac.uk/10.3390/axioms10010029

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