On Central Complete and Incomplete Bell Polynomials I

In this paper, we introduce central complete and incomplete Bell polynomials which can be viewed as generalizations of central Bell polynomials and central factorial numbers of the second kind, and also as ’central’ analogues for complete and incomplete Bell polynomials. Further, some properties and identities for these polynomials are investigated. In particular, we provide explicit formulas for the central complete and incomplete Bell polynomials related to central factorial numbers of the second kind.


Introduction
In this paper, we introduce central incomplete Bell polynomials T n,k (x 1 , x 2 , • • • , x n−k+1 ) given by and investigate some properties and identities for these polynomials.They can be viewed as generalizations of central Bell polynomials and central factorial numbers of the second kind, and also as 'central' analogues for complete and incomplete Bell polynomials.
Here, we recall that the central factorial numbers T(n, k) of the second kind and the central Bell polynomials B n (x).The incomplete and complete Bell polynomials have applications in such diverse areas as combinatorics, probability, algebra, modules over a * -algebra (see [1,2]), quasi local algebra and analysis.Here, we recall some applications of them and related works.The incomplete Bell polynomials B n,k (x 1 , x 2 , • • • , x n−k+1 ) (see [3,4]) arise naturally when we want to find higher-order derivatives of Symmetry 2019, 11, 288; doi:10.3390/sym11020288www.mdpi.com/journal/symmetrycomposite functions.Indeed, such higher-order derivatives can be expressed in terms of incomplete Bell polynomials, which is known as Faà di Bruno formula given as in the following (see [3]): For the curious history on this formula, we let the reader refer to [5].
In addition, the number of monomials appearing in ) is the number of partitioning a set with n elements into k blocks and the coefficient of each monomial is the number of partitioning a set with n elements as the corresponding k blocks.For example, shows that there are three ways of partitioning a set with 10 elements into seven blocks, and 3150 partitions with blocks of size 2, 2, 2, 1, 1, 1, 1, 2520 partitions with blocks of size 3, 2, 1, 1, 1, 1, 1, and 210 partitions with blocks of size 4, 1,1, 1, 1, 1, 1.This example is borrowed from [4], which gives a practical way of computing B n,k for any given n, k (see [4], (1.5)).Furthermore, the incomplete Bell polynomials can be used in constructing sequences of binomial type (also called associated sequences).Indeed, for any given scalars and, conversely, any sequence of binomial type arises in this way for some scalar sequence For these, the reader may want to look at the paper [6].
There are certain connections between incomplete Bell polynomials and combinatorial Hopf algebras such as the Hopf algebra of word symmetric functions, the Hopf algebra of symmetric functions, the Faà di Bruno algebra, etc.The details can be found in [7].
The complete Bell polynomials [3,[8][9][10]) have applications to probability theory.Indeed, the nth moment µ n = E[X n ] of the random variable X is the nth complete Bell polynomial in the first n cumulants.Namely, For many applications to probability theory and combinatorics, the reader can refer to the Ph.D. thesis of Port [10].
Many special numbers, like Stirling numbers of both kinds, Lah numbers and idempotent numbers, appear in many combinatorial and number theoretic identities involving complete and incomplete Bell polynomials.For these, the reader refers to [3,8].
The central factorial numbers have received less attention than Stirling numbers.However, according to [11], they are at least as important as Stirling numbers, said to be "as important as Bernoulli numbers, or even more so".A systematic treatment of these important numbers was given in [11], including their properties and applications to difference calculus, spline theory, and to approximation theory, etc.For some other related references on central factorial numbers, we let the reader refer to [1,2,[12][13][14].Here, we note that central Bell polynomials and central factorial numbers of the second kind are respectively 'central' analogues for Bell polynomials and Stirling numbers of the second kind.They have been studied recently in [13,15].
The complete Bell polynomials and the incomplete Bell polynomials are respectively mutivariate versions for Bell polynomials and Stirling numbers of the second kind.This paper deals with central complete and incomplete Bell polynomials which are 'central' analogues for the complete and incomplete Bell polynomials.In addition, they can be viewed as generalizations of central Bell polynomials and central factorial numbers of the second kind (see [15]).The outline of the paper is as follows.After giving an introduction to the present paper in Section 1, we review some known properties and results about Bell polynomials, and incomplete and complete Bell polynomials in Section 2. We state the new and main results of this paper in Section 3, where we introduce central incomplete and complete Bell polynomials and investigate some properties and identities for them.In particular, Theorems 1 and 3 give basic formulas for computing central incomplete Bell polynomials and central complete Bell polynomials, respectively.We remark that the number of monomials appearing in ) is the number of partitioning a set with n elements into k blocks with odd sizes and the coefficient of each monomial is the number of partitioning a set with n elements as the corresponding k blocks with odd sizes.This is illustrated by an example.Furthermore, we give expressions for the central incomplete and complete Bell polynomials with some various special arguments and also for the connection between the two Bell polynomials.We defer more detailed study of the central incomplete and complete Bell polynomials to a later paper.

Preliminaries
The Stirling numbers of the second kind are given in terms of generating function by (see [3,16]) The Bell polynomials are also called Tochard polynomials or exponential polynomials and defined by (see [9,13,15,17]) From Equations ( 1) and ( 2), we immediately see that (see [3,18]) The (exponential) incomplete Bell polynomials are also called (exponential) partial Bell polynomials and defined by the generating function (see [9,15]) Thus, by Equation ( 4), we get where the summation runs over all integers i 1 , From ( 1) and ( 4), we easily see that We easily deduce from (5) the next two identities: and where α ∈ R (see [15]).
Combining ( 9) with (10), we have Replacing n by n − k in (11) yields the following identity We recall here that the (exponential) complete Bell polynomials are defined by exp Then, by ( 4) and ( 13), we get From ( 3), ( 6), ( 7) and ( 14), we have We recall that the central factorial numbers of the second kind are given by (see [19,20]) where k ≥ 0. From (16), it is not difficult to derive the following expression where n, k ∈ Z with n ≥ k ≥ 0, (see [16,20]).
In [20], the central Bell polynomials n (1) are called the central Bell numbers.It is not hard to derive the generating function for the central Bell polynomials from (18) as follows (see [15]): By making use of ( 19), the following Dobinski-like formula was obtained earlier in [15]: where n ≥ 0.
Motivated by ( 4) and ( 13), we will introduce central complete and incomplete Bell polynomials and investigate some properties and identities for these polynomials.Also, we present explicit formulas for the central complete and incomplete Bell polynomials related to central factorial numbers of the second kind.

On Central Complete and Incomplete Bell Polynomials
In view of (13), we may consider the central incomplete Bell polynomials which are given by where k = 0, 1, 2, 3, • • • .
Theorem 1.For n, k ≥ 0 with n ≥ k and n − k ≡ 0 (mod 2), we have where the summation is over all integers i Remark 1. Theorem 1 shows in particular that we have From this, we note that the number of monomials appearing in T n,k (x 1 , 2x 2 , • • • , 2 n−k x n−k+1 ) is the number of partitioning a set with n elements into k blocks with odd sizes and the coefficient of each monomial is the number of partitioning a set with n elements as the corresponding k blocks with odd sizes.For example, from the example in Section 3 of [4], we have T 13,7 (x 1 , 2x 2 , 2 2 x 3 , 2 3 x 4 , 2 4 x 5 , 2 5 x 6 , 2 6 x 7 ) = 200, 200x 3  3 x 4 1 + 72, 072x 5 x 3 x 5 1 + 1716x 7 x 6 1 .
For n, k ≥ 0 with n ≥ k and n − k ≡ 0 (mod 2), by (21), we get Now, the next theorem follows by comparing the coefficients on both sides of (25).
Theorem 2. For n, k ≥ 0 with n − k ≡ 0 (mod 2), we have In particular, For n, k ≥ 0 with n − k ≡ 0 (mod 2) and n ≥ k, by ( 17) and ( 27), we get Therefore, by ( 26)-( 28) and Theorem 1, we obtain the following corollary and For n, k ≥ 0 with n ≥ k and n − k ≡ 0 (mod 2), we observe that Thus, we have The next two identities follow easily from (24): and where n, k ≥ 0 with n − k ≡ 0 (mod 2) and n ≥ k.
On the one hand, we have On the other hand, from ( 19), we have Therefore, by ( 39) and (40), we obtain the following theorem.
We note from Theorem 4 the next identities: Thus, Theorem 4 and (41) together give us the following corollary.
Corollary 2. For n ≥ 0, we have The Stirling numbers of the first kind are given in terms of the generating function by (see [3,21]) In order to get the following result and using (42), we first observe that The following equation can be derived from ( 21) and (43): Now, we obtain the following theorem by comparing the coefficients on both sides of (44).
Theorem 5.For n, k ≥ 0 with n ≥ k, we have

Conclusions
In this paper, we introduced central complete and incomplete Bell polynomials which can be viewed as generalizations of central Bell polynomials and central factorial numbers of the second kind, and also as 'central' analogues for complete and incomplete Bell polynomials.As examples and recalling some relevant works, we reminded the reader that the incomplete and complete Bell polynomials appearing in a Faà di Bruno formula, which encode integer partition information, can be used in constructing sequences of binomial type, have connections with combinatorial Hopf algebras, have applications in probability theory and arise in many combinatorial and number theoretic identities.One additional thing we want to mention here is that the Faà di Bruno formula has been proved to be very useful in finding explicit expressions for many special numbers arising from many different families of linear and nonlinear differential equations having generating functions of some special numbers and polynomials as solutions (see [22]).
The main results of the present paper are stated in Section 3, in which we introduced central incomplete and complete Bell polynomials and investigated some properties and identities.In particular, in Theorems 1 and 3, we gave basic formulas for computing central incomplete Bell polynomials and central complete Bell polynomials, respectively.We remarked that the number of monomials appearing in T n,k (x 1 , 2x 2 , • • • , 2 n−k x n−k+1 ) is the number of partitioning n into k odd parts and the coefficient of each monomial is the number of partitioning n as the corresponding k odd parts.This was illustrated by an example.Furthermore, we gave expressions for the central incomplete and complete Bell polynomials with some various special arguments and also for the connection between the two Bell polynomials.In the near future, we hope to find some further properties, identities and various applications for central complete and incomplete Bell polynomials.