Next Article in Journal
LPI Radar Waveform Recognition Based on CNN and TPOT
Next Article in Special Issue
Some Convolution Formulae Related to the Second-Order Linear Recurrence Sequence
Previous Article in Journal
Infrared Dim Target Detection Using Shearlet’s Kurtosis Maximization under Non-Uniform Background
Previous Article in Special Issue
Some Identities of Fully Degenerate Bernoulli Polynomials Associated with Degenerate Bernstein Polynomials
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

On r-Central Incomplete and Complete Bell Polynomials

1
Department of Mathematics, Sogang University, Seoul 04107, Korea
2
Department of Mathematics, Kwangwoon University, Seoul 01897, Korea
3
Department of Mathematics, Pusan National University, Busan 46241, Korea
*
Author to whom correspondence should be addressed.
Symmetry 2019, 11(5), 724; https://doi.org/10.3390/sym11050724
Submission received: 16 April 2019 / Revised: 22 May 2019 / Accepted: 23 May 2019 / Published: 27 May 2019
(This article belongs to the Special Issue Current Trends in Symmetric Polynomials with Their Applications Ⅱ)

Abstract

:
Here we would like to introduce the extended r-central incomplete and complete Bell polynomials, as multivariate versions of the recently studied extended r-central factorial numbers of the second kind and the extended r-central Bell polynomials, and also as multivariate versions of the r- Stirling numbers of the second kind and the extended r-Bell polynomials. In this paper, we study several properties, some identities and various explicit formulas about these polynomials and their connections as well.

1. Introduction

We begin this section by briefly recalling several definitions related to the central factorial numbers of the second kind and the central Bell polynomials and also to their generalizations of the extended r-central factorial numbers of the second kind and the extended r-central Bell polynomials (see [1]). The central factorial x [ n ] is given by the generating function
t 2 + 1 + t 2 4 2 x = n = 0 x [ n ] t n n ! .
A proof of (1) can be found in [2], p. 215, Equations (27), (28) and (27a), (see also [1,3,4,5]).
It is well known that Formula (1) shows that
x [ 0 ] = 1 , x [ n ] = x ( x + n 2 1 ) ( x n 2 + 1 ) , ( n 1 ) ,
where x [ n ] is of degree n in x.
The central factorial numbers of the second kind T ( n , k ) are the coefficients in the expansion of x n in terms of central factorials as follows:
x n = k = 0 n T ( n , k ) x [ k ] ,
(see [6,7,8,9,10,11]) and it is known that T ( 2 n , 2 n 2 k ) enumerates the number of ways to place k rooks on a 3D-triangle board of size ( n 1 ) (see [12,13]). The generating function of T ( n , k ) is given by
1 k ! e t 2 e t 2 k = n = k T ( n , k ) t n n ! ,
which follows, for example, from (1) and (3).
Indeed, on the one hand by making use of (3) we have
e x t = n = 0 x n t n n ! = k = 0 n = k T ( n , k ) t n n ! x [ k ] .
On the other hand, by virtue of (1) we also have
e x t = e t 2 e t 2 2 + 1 + ( e t 2 e t 2 ) 4 2 x = k = 0 1 k ! ( e t 2 e t 2 ) k x [ k ] .
Now, it can be easily seen that Equation (4) follows from (5) and (6).
Kim-Kim in [11] introduced the central Bell polynomials by means of generating function as
e x e t 2 e t 2 = n = 0 B n ( c ) ( x ) t n n ! .
We note by making use of (4) that identity (7) implies (see [1,11])
B n ( c ) ( x ) = k = 0 n T ( n , k ) x k , ( n 0 ) .
For a nonnegative integer r, Kim-Dolgy-Kim-Kim in a recent work [1] introduced the extended r-central factorial numbers of the second kind given by the generating function:
1 k ! e t 2 e t 2 k e r t = n = k T ( r ) ( n + r , k + r ) t n n ! .
From (8), it is noted that (see [1])
( x + r ) n = k = 0 n T ( r ) ( n + r , k + r ) x [ k ] .
The extended r-central Bell polynomials [1] are defined by
e x e t 2 e t 2 e r t = n = 0 B n ( c , r ) ( x ) t n n ! , .
By definition (10), it is also known that (see [1])
B n ( c , r ) ( x ) = k = 0 n x k T ( r ) ( n + r , k + r ) , ( n 0 ) .
The purpose of this paper is to introduce and study the extended r-central incomplete and complete Bell polynomials, as multivariate versions of the recently studied the extended r-central factorial numbers of the second and the extended r-central Bell polynomials (see [1]), and also as multivariate versions of the r- Stirling numbers of the second kind and the extended r-Bell polynomials (see Section 2). Then we investigate their properties, some identities and various explicit formulas related to these polynomials and also their connections.
This paper is organized as follows. In Section 2, we introduce the incomplete and complete r-Bell polynomials and give some of their simple properties. We observe that these polynomials are multivariate versions of the r- Stirling numbers of the second kind and the extended r-Bell polynomials. In Section 3, we introduce our object of study, namely the extended r-central incomplete and complete Bell polynomials, and provide several properties, some identities and various explicit formulas for them. Finally, in Section 4, brief summaries for the obtained results about newly defined polynomials are provided.

2. Preliminaries

The r-Stirling numbers S 2 ( r ) ( n , k ) of the second kind are defined by the generating function (see [14,15,16,17,18,19])
1 k ! e t 1 k e r t = n = k S 2 ( r ) ( n + r , k + r ) t n n !
and they enumerate the number of partitions of the set 1 , 2 , , n into k nonempty disjoint subsets in such a way that 1 , 2 , , r are in distinct subsets.
The extended r-Bell polynomials are given by (see [15])
e r t e x ( e t 1 ) = n = 0 B n ( r ) ( x ) t n n ! .
One can show that Equations (12) and (13) imply
B n ( r ) ( x ) = e x k = 0 ( k + r ) n k ! x k = k = 0 n x k S 2 ( r ) ( n + r , k + r ) , ( n 0 ) .
In particular x = 1 , B n ( c , r ) = B n ( c , r ) ( 1 ) are called the extended r-Bell numbers.
The incomplete r-Bell polynomials are given by the generating function
1 k ! j = 1 x j t j j ! k j = 0 y j + 1 t j j ! r = n k B n + r , k + r ( r ) ( x 1 , x 2 , ; y 1 , y 2 ) t n n ! .
Thus, we have
B n + r , k + r ( r ) ( x 1 , x 2 , ; y 1 , y 2 ) = n ! k 1 ! k 2 ! x 1 1 ! k 1 x 2 2 ! k 2 r ! r 0 ! r 1 ! r 2 ! y 1 0 ! r 0 y 2 1 ! r 1 y 3 2 ! r 2 ,
where the summation is over all integers k 1 , k 2 , 0 and r 0 , r 1 , r 2 0 , such that
i 1 k i = k , j 0 r j = r , and ( k 1 + r 1 ) + 2 ( k 2 + r 2 ) + 3 ( k 3 + r 3 ) + = n .
Let a 1 , a 2 , , and b 1 , b 2 , be any sequences of nonnegative integers. Then, as was noted in [20], B n + r , k + r ( r ) ( a 1 , a 2 , ; b 1 , b 2 ) enumerates the number of partitions of a set with ( n + r ) elements into ( k + r ) blocks satisfying:
  • The first r elements are in different blocks,
  • Any block of size i with no elements of the first r elements, can be colored with a i colors,
  • Any block of size i with one element of the first r elements, can be colored with b i colors.
From (12) and (16), we note that
B n + r , k + r ( r ) ( 1 , 1 , ; 1 , 1 , ) = S 2 ( r ) ( n + k , k + r ) ,
B n + r , k + r ( r ) ( α x 1 , α x 2 , ; α y 1 , α y 2 ) = α k + r B n + k , k + r ( r ) ( x 1 , x 2 , ; y 1 , y 2 ) ,
and
B n + r , k + r ( r ) ( α x 1 , α 2 x 2 , ; y 1 , α y 2 , α 2 y 3 , ) = α n B n + k , k + r ( r ) ( x 1 , x 2 , ; y 1 , y 2 ) ,
where α is a real number.
By using (15), we get
n = k B n + r , k + r ( r ) ( x , 1 , 0 , 0 , ; 1 , 0 , 0 , ) t n n ! = 1 k ! x t + t 2 2 k = t k 1 k ! n = 0 k k n t 2 n x k n = n = 0 k ( n + k ) ! k ! k n 1 2 n x k n t n + k ( n + k ) ! .
Also, it can be seen that
n = k B n + r , k + r ( r ) ( x , 1 , 0 , 0 , ; 1 , 0 , 0 , ) t n n ! = n = 0 B n + k + r , k + r ( r ) ( x , 1 , 0 , 0 , ; 1 , 0 , 0 , ) t n + k ( n + k ) ! .
Thus, by (20) and (21), we have the following equation given by
B n + k + r , k + r ( r ) ( x , 1 , 0 , 0 , ; 1 , 0 , 0 , ) = ( n + k ) ! k ! k n 1 2 n x k n , if 0 n k , 0 , if n > k .
By replacing n by n k in (22), we get
B n + r , k + r ( r ) ( x , 1 , 0 , 0 , ; 1 , 0 , 0 , ) = n ! k ! k n k x 2 k n 1 2 n k , ( k n 2 k ) .
Now, we define the complete r-Bell polynomials by virtue of generating function as
exp i = 1 x i t i i ! j = 0 y j + 1 t j j ! r = n = 0 B n ( r ) ( x 1 , x 2 , ; y 1 , y 2 , ) t n n ! .
From (15) and (24), we have
n = 0 B n ( r ) ( x 1 , x 2 , ; y 1 , y 2 , ) t n n ! = k = 0 1 k ! i = 1 x i t i i ! k j = 0 y j + 1 t j j ! r = k = 0 n = k B n + r , k + r ( r ) ( x 1 , x 2 , ; y 1 , y 2 , ) t n n ! = n = 0 k = 0 n B n + r , k + r ( r ) ( x 1 , x 2 , ; y 1 , y 2 , ) t n n ! .
Comparing both sides of (25) gives us the identity
B n ( r ) ( x 1 , x 2 , ; y 1 , y 2 , ) = k = 0 n B n + r , k + r ( r ) ( x 1 , x 2 , ; y 1 , y 2 , ) .
Now, we observe that
B n ( r ) ( x , x , ; 1 , 1 , ) = k = 0 n B n + r , k + r ( r ) ( x , x , ; 1 , 1 , ) = k = 0 n x k B n + r , k + r ( r ) ( 1 , 1 , ; 1 , 1 , ) = k = 0 n x k S 2 ( r ) ( n + r , k + r ) = B n ( r ) ( x ) , ( n 0 ) .

3. An Extended r-Central Complete and Incomplete Bell Polynomials

Recently, in [21], we initiated the study of central incomplete Bell polynomials T n , k ( x 1 , x 2 , , x n k + 1 ) and the central complete Bell polynomials B n ( c ) ( x | x 1 , x 2 , , x n ) , respectively given by
1 k ! m = 1 1 2 m ( x m ( 1 ) m x m ) t m m ! k = n = k T n , k ( x 1 , x 2 , , x n k + 1 ) t n n ! ,
and
exp x i = 1 1 2 i ( x i ( 1 ) i x i ) t i i ! = n = 0 B n ( c ) ( x | x 1 , x 2 , , x n ) t n n ! ,
and studied some properties and identities concerning these polynomials. It was observed, in particular, that the number of partitioning a set with n elements into k blocks with odd sizes is given by the number of monomials appearing in T n , k ( x 1 , 2 x 2 , , 2 n k x n k + 1 ) , and that the number of partitioning a set with n elements into a certain k blocks with odd sizes is the coefficient of the corresponding monomial appearing in T n , k ( x 1 , 2 x 2 , , 2 n k x n k + 1 ) .
Here we will consider ’r-extensions’ of the central incomplete and complete Bell polynomials. In light of (15), we may define the extended r-central incomplete Bell polynomials by
1 k ! m = 1 1 2 m x m ( 1 ) m x m t m m ! k j = 0 y j + 1 t j j ! r = n = k T n + r , k + r ( r ) ( x 1 , x 2 , ; y 1 , y 2 , ) t n n !
for any k N { 0 } . Then, for n , k 0 with n k , by (28), one can check that
T n + r , k + r ( r ) ( x 1 , x 2 , ; y 1 , y 2 , ) = n ! k 1 ! k 3 ! k 5 ! x 1 1 ! k 1 x 3 2 2 3 ! k 3 x 5 2 4 5 ! k 5 × r ! r 0 ! r 1 ! r 2 ! y 1 0 ! r 0 y 2 1 ! r 1 y 3 2 ! r 2 ,
where the summation is over all integers k 1 , k 3 , k 5 0 and r 0 , r 1 , r 2 0 , such that
i 1 k 2 i 1 = k , i 0 r i = r , and i 1 ( 2 i 1 ) k 2 i 1 + i 1 i r i = n .
The extended r-central incomplete Bell polynomials have the following combinatorial interpretation. This can be seen from (29). Let a 1 , a 2 , , and b 1 , b 2 , be any sequences of nonnegative integers. Then T n + r , k + r ( r ) ( a 1 , 2 a 2 , 2 2 a 3 , ; b 1 , b 2 , b 3 , ) enumerates the number of partitions of a set with ( n + r ) elements into k blocks of odd sizes and r blocks of any sizes satisfying:
  • The first r elements are in different blocks,
  • Any block of (odd) size i with no elements of the first r elements, can be colored with a i colors,
  • Any block of size i with one element of the first r elements, can be colored with b i colors.
From (15), (16) and (29), we note that
T n + r , k + r ( r ) ( x 1 , x 2 , ; y 1 , y 2 , ) = B n + r , k + r ( r ) ( x 1 , 0 , x 3 2 2 , 0 , ; y 1 , y 2 , y 3 ) .
Therefore, we obtain the following theorem.
Theorem 1.
For n , k 0 , with n k , we have
T n + r , k + r ( r ) ( x 1 , x 2 , ; y 1 , y 2 , ) = B n + r , k + r ( r ) ( x 1 , 0 , x 3 2 2 , 0 , ; y 1 , y 2 , y 3 ) .
From (28), we have
n = k T n + r , k + r ( r ) ( 1 , 1 , ; 1 , 1 , ) t n n ! = 1 k ! m = 1 1 2 m 1 ( 1 ) m t m m ! k j = 0 t j j ! r = 1 k ! e t 2 e t 2 k e r t = n = k T ( r ) ( n + r , k + r ) t n n ! .
Therefore, by (32), we obtain the following corollary.
Corollary 1.
For n , k 0 , with n k , we have
T n + r , k + r ( r ) ( 1 , 1 , ; 1 , 1 , ) = T ( r ) ( n + r , k + r ) , ( r N { 0 } ) .
Let n , k be nonnegative integers. Then, from (28), we get
n = k T n + r , k + r ( r ) ( x , x 2 , x 3 , ; 1 , x , x 2 , ) t n n ! = 1 k ! x t + x 3 2 2 t 3 3 ! + x 5 2 4 t 5 5 ! + k 1 + x t + x 2 2 t 2 + r = 1 k ! e x t 2 e x t 2 k e r x t = 1 k ! l 0 k k l ( 1 ) k l e ( l + r k 2 ) x t = n = 0 x n k ! l = 0 k k l ( 1 ) k l l + r k 2 n t n n ! .
Therefore, comparing both sides of (33) yields the following theorem.
Theorem 2.
For n , k 0 , we have
x n k ! l = 0 k k l ( 1 ) k l l + r k 2 n = T n + r , k + r ( r ) ( x , x 2 , x 3 , ; 1 , x , x 2 , ) , if n k , 0 , otherwise .
In [10], Kim-Dolgy-Kim-Kim proved the following equation (34) given by
1 k ! l = 0 k k l ( 1 ) k l l + r k 2 n = T ( r ) ( n + r , k + r ) , if n k , 0 , otherwise ,
where n , k Z with n , k 0 . Therefore, by (34), the following corollary is established.
Corollary 2.
For n , k N { 0 } , with n k , we have
T n + r , k + r ( r ) ( x , x 2 , x 3 , ; 1 , x , x 2 , ) = x n T ( r ) ( n + r , k + r ) .
From (29) and Corollary 2, one can also have the following identity.
Corollary 3.
For n , k 0 , with n k , we have
T n + r , k + r ( r ) ( x , x 2 , x 3 , ; 1 , x , x 2 , ) = x n T n + r , k + r ( r ) ( 1 , 1 , ; 1 , 1 , )
and
T n + r , k + r ( r ) ( 1 , 1 , ; 1 , 1 , ) = T ( r ) ( n + r , k + r ) = B n + r , r ( r ) ( 1 , 0 , 1 2 2 , 0 , 1 2 4 , 0 , ; 1 , 1 , 1 , ) = n ! k 1 ! k 3 ! k 5 ! 1 1 ! k 1 1 2 2 3 ! k 3 1 2 4 5 ! k 5 × r ! r 0 ! r 1 ! r 2 ! 1 0 ! r 0 1 1 ! r 1 1 2 ! r 2 ,
where the summation is over all integers k 1 , k 3 , k 5 0 and r 0 , r 1 , r 2 0 , satisfying the conditions in (30).
For n , k 0 , we have
n = k T n + r , k + r ( r ) ( x , 1 , 0 , 0 , ; 1 , 0 , 0 , ) t n n ! = 1 k ! ( x t ) k .
By comparing the coefficients on both sides of (35), we have
T n + r , k + r ( r ) ( x , 1 , 0 , 0 , ; 1 , 0 , 0 , ) = x k 0 n k .
Also, by (29), one can obtain that
T n + r , k + r ( r ) ( x , x , ; y , y , ) = x k y r T n + r , k + r ( r ) ( 1 , 1 , ; 1 , 1 , ) = x k y r T ( r ) ( n + r , k + r ) ,
and
T n + r , k + r ( r ) ( α x 1 , α x 2 , ; α y 1 , α y 2 , ) = α k + r T n + r , k + r ( r ) ( x 1 , x 2 , ; y 1 , y 2 , ) ,
where n , k are nonnegative integers with n k .
Now, we observe that
exp x i = 1 1 2 i x i ( 1 ) i x i t i i ! j = 0 y j + 1 t j j ! r = k = 0 x k 1 k ! i = 1 1 2 i x i ( 1 ) i x i t i i ! k j = 0 y j + 1 t j j ! r = k = 0 x k n = k T n + r , k + r ( r ) ( x 1 , x 2 , ; y 1 , y 2 , ) t n n ! = k = 0 k = 0 n x k T n + r , k + r ( r ) ( x 1 , x 2 , ; y 1 , y 2 , ) t n n ! .
Taking (24) into account, we may define the extended r-central complete Bell polynomials by
exp x i = 1 1 2 i x i ( 1 ) i x i t i i ! j = 0 y j + 1 t j j ! r = k = 0 B n ( c , r ) ( x | x 1 , x 2 , ; y 1 , y 2 , ) t n n ! .
In particular, when x = 1 , B n ( c , r ) ( 1 | x 1 , x 2 , ; y 1 , y 2 , ) = B n ( c , r ) ( x 1 , x 2 , ; y 1 , y 2 , ) are called the extended r-central complete Bell numbers.
For n 0 , by (39) and (40), we get
B n ( c , r ) ( x 1 , x 2 , ; y 1 , y 2 , ) = k = 0 n T n + r , k + r ( r ) ( x 1 , x 2 , ; y 1 , y 2 , )
and
B n ( c , r ) ( x | x 1 , x 2 , ; y 1 , y 2 , ) = k = 0 n x k T n + r , k + r ( r ) ( x 1 , x 2 , ; y 1 , y 2 , ) .
It is easily noted that B 0 ( c , r ) ( x 1 , x 2 , ; y 1 , y 2 , ) = y 1 r .
Hence, one can have the following theorem.
Theorem 3.
For n 0 , we have
B n ( c , r ) ( x | x 1 , x 2 , ; y 1 , y 2 , ) = k = 0 n x k T n + r , k + r ( r ) ( x 1 , x 2 , ; y 1 , y 2 , )
and
B n ( c , r ) ( x 1 , x 2 , ; y 1 , y 2 , ) = k = 0 n T n + r , k + r ( r ) ( x 1 , x 2 , ; y 1 , y 2 , ) .
Please note that
B n ( c , r ) ( 1 , 1 , , ; 1 , 1 , ) = k = 0 n T n + r , k + r ( r ) ( 1 , 1 , ; 1 , 1 , ) = k = 0 n T ( r ) ( n + r , k + r ) = B n ( c , r ) ,
and
B n ( c , r ) ( x | 1 , 1 , , ; 1 , 1 , ) = k = 0 n x k T ( r ) ( n + r , k + r ) = B n ( c , r ) ( x ) , ( n 0 ) .
By (39), we get
exp i = 1 1 2 i x i ( 1 ) i x i t i i ! j = 0 y j + 1 t j j ! r = n = 0 n ! k 1 ! k 3 ! k 5 ! x 1 1 ! k 1 x 3 2 2 3 ! k 3 x 5 2 4 5 ! k 5 × r ! r 0 ! r 1 ! r 2 ! y 1 0 ! r 0 y 2 1 ! r 1 y 3 2 ! r 2 t n n ! ,
where the inner sum runs over all integers k 1 , k 3 , k 5 0 and r 0 , r 1 , r 2 0 , such that
i 0 r i = r , and i 1 ( 2 i 1 ) k 2 i 1 + i 1 i r i = n .
For n 0 , we have
B n ( c , r ) ( x 1 , x 2 , ; y 1 , y 2 , ) = k = 0 n T n + r , k + r ( r ) ( x 1 , x 2 , ; y 1 , y 2 , ) = n ! k 1 ! k 3 ! k 5 ! x 1 1 ! k 1 x 3 2 2 3 ! k 3 x 5 2 4 5 ! k 5 × r ! r 0 ! r 1 ! r 2 ! y 1 0 ! r 0 y 2 1 ! r 1 y 3 2 ! r 2 ,
where the sum is over all integers k 1 , k 3 , k 5 0 and r 0 , r 1 , r 2 0 , satisfying the conditions in (43).
Thus, the following theorem is established.
Theorem 4.
For n 0 , we have
B n ( c , r ) ( x 1 , x 2 , ; y 1 , y 2 , ) = n ! k 1 ! k 3 ! k 5 ! x 1 1 ! k 1 x 3 2 2 3 ! k 3 x 5 2 4 5 ! k 5 × r ! r 0 ! r 1 ! r 2 ! y 1 0 ! r 0 y 2 1 ! r 1 y 3 2 ! r 2 ,
where the sum is over all integers k 1 , k 3 , k 5 0 and r 0 , r 1 , r 2 0 , satisfying the conditions in (43).
Now, we observe that
exp x i = 1 1 2 i 1 ( 1 ) i t i i ! j = 0 t j j ! r = k = 0 x k 1 k ! i = 1 1 2 i 1 ( 1 ) i t i i ! k j = 0 t j j ! r = k = 0 x k n = k T n + r , k + r ( r ) ( 1 , 1 , ; 1 , 1 , ) t n n ! = n = 0 k = 0 n x k T n + r , k + r ( r ) ( 1 , 1 , ; 1 , 1 , ) t n n ! .
Alternatively, the left hand side of (45) can be simplified in the following way:
exp x i = 1 1 2 i 1 ( 1 ) i t i i ! j = 0 t j j ! r = e x e t 2 e t 2 e r t = n = 0 B n ( c , r ) ( x ) t n n ! .
Comparing the coefficients in (45) and (46) gives the following identity.
Theorem 5.
For n 0 , we have
k = 0 n x k T n + r , k + r ( r ) ( 1 , 1 , ; 1 , 1 , ) = B n ( c , r ) ( x ) .
From (29), it is noted that
k = 0 n x k + r T n + r , k + r ( r ) ( 1 , 1 , ; 1 , 1 , ) = k = 0 n T n + r , k + r ( r ) ( x , x , ; x , x , ) = B n ( c , r ) ( x , x , ; x , x , ) ,
which yields the next corollary.
Corollary 4.
For n 0 , we have
B n ( c , r ) ( x , x , ; x , x , ) = x r B n ( c , r ) ( x ) .

4. Conclusions

In recent years, studies on various old and new special numbers and polynomials have received attention from many mathematicians. They have been carried out by several means, including generating functions, combinatorial methods, umbral calculus, p-adic analysis, differential equations, probability and so on.
In this paper, by making use of generating functions we introduced and studied the extended r-central incomplete and complete Bell polynomials, as multivariate versions of the recently studied the extended r-central factorial numbers of the second and the extended r-central Bell polynomials (see [1]), and also as multivariate versions of the r- Stirling numbers of the second kind and the extended r-Bell polynomials (see Section 2). Then we studied several properties, some identities and various explicit formulas related to these polynomials and also their connections.
In Section 1 we briefly recalled, in more detail, definitions and basic properties about the central factorial numbers of the second kind, the central Bell polynomials, the extended r-central factorial numbers of the second kind and the extended r-central Bell polynomials. In Section 2 we introduced the incomplete and complete r-Bell polynomials as multivariate versions of the r- Stirling numbers of the second kind and the extended r-Bell polynomials and give some of their simple properties. In Section 3, we introduced the extended r-central incomplete and complete Bell polynomials, and provided several properties, some identities and various explicit formulas for them.
As our immediate next project, we would like to find some further results about the extended r-central incomplete and complete Bell polynomials by virtue of umbral calculus and also some of their applications associated with partition polynomials.

Author Contributions

Conceptualization, D.S.K. and T.K.; Formal analysis, D.S.K., D.K. and T.K.; Funding acquisition, D.K.; Investigation, D.S.K., H.Y.K. and T.K.; Methodology, D.S.K. and T.K.; Project administration, T.K.; Software, D.K.; Supervision, D.S.K. and T.K.; Validation, D.S.K., H.Y.K., D.K. and T.K.; Visualization, H.Y.K. and D.K.; Writing—original draft, T.K.; Writing— review & editing, D.S.K., H.Y.K. and D.K.

Funding

This work was supported by the National Research Foundation of Korea (NRF) grant funded by the Korea government (MSIT) (No. 2019R1C1C1003869).

Acknowledgments

We would like to thank the referees for their comments and suggestions which improved the original manuscript greatly.

Conflicts of Interest

The authors declare no conflict of interest.

References

  1. Kim, D.S.; Dolgy, D.V.; Kim, D.; Kim, T. Some identities on r-central factorial numbers and r-central Bell polynomials. arXiv 2019, arXiv:1903.11689v1. [Google Scholar]
  2. Riordan, J. Combinatorial Identities; John Wiley & Sons, Inc.: New York, NY, USA, 1968. [Google Scholar]
  3. Kim, T.; Kim, D.S.; Jang, G.-W.; Kwon, J. Extended central factorial polynomials of the second kind. Adv. Differ. Equ. 2019, 24. [Google Scholar] [CrossRef]
  4. Kim, T.; Kim, D.S. Degenerate central Bell numbers and polynomials. Rev. Real Acad. Clenc. Exactas Fis. Nat. Ser. A Mat. 2019, 1–7. [Google Scholar] [CrossRef]
  5. Zhang, W. Some identities involving the Euler and the central factorinal numbers. Fibonacci Quart. 1998, 36, 154–157. [Google Scholar]
  6. Butzer, P.L.; Schmidt, M.; Stark, E.L.; Vogt, L. Central factorial numbers; their main properties and some applications. Numer. Funct. Anal. Optim. 1989, 10, 419–488. [Google Scholar] [CrossRef]
  7. Carlitz, L.; Riordan, J. The divided central differences of zero. Canad. J. Math. 1963, 15, 94–100. [Google Scholar] [CrossRef]
  8. Carlitz, L. Some remarks on the Bell numbers. Fibonacci Quart. 1980, 18, 66–73. [Google Scholar]
  9. Charalambides, C.A. Central factorial numbers and related expansions. Fibonacci Quart. 1981, 19, 451–456. [Google Scholar]
  10. Kim, T. A note on central factorial numbers. Proc. Jangjeon Math. Soc. 2018, 21, 575–588. [Google Scholar]
  11. Kim, T.; Kim, D.S. A note on central Bell numbers and polynomials. Adv. Stud. Contemp. Math. (Kyungshang) 2019, 27, 289–298. [Google Scholar]
  12. Belbachir, H.; Djemmada, Y. On central Fubini-like numbers and polynomials. arXiv 2018, arXiv:1811.06734v1. [Google Scholar]
  13. Krzywonos, N.; Alayont, F. Rook polynomials in higher dimensions. Stud. Summer Sch. 2009, 29. Available online: https://scholarworks.gvsu.edu/sss/29/ (accessed on 2 March 2019).
  14. Duran, U.; Acikgoz, M.; Araci, S. On (q,r,w)-Stirling numbers of the second kind. J. Inequal. Spec. Funct. 2018, 9, 9–16. [Google Scholar]
  15. Kim, T.; Yao, Y.; Kim, D.S.; Jang, G.-W. Degenerate r-Stirling numbers and r-Bell polynomials. Russ. J. Math. Phys. 2018, 25, 44–58. [Google Scholar] [CrossRef]
  16. Pyo, S.-S. Degenerate Cauchy numbers and polynomials of the fourth kind. Adv. Stud. Contemp. Math. (Kyungshang) 2018, 28, 127–138. [Google Scholar]
  17. Roman, S. The umbral calculus. In Pure and Applied Mathematics; Harcourt Brace Jovanovich: New York, NY, USA, 1984. [Google Scholar]
  18. Simsek, Y. Identities and relations related to combinatorial numbers and polynomials. Proc. Jangjeon Math. Soc. 2017, 20, 127–135. [Google Scholar]
  19. Simsek, Y. Identities on the Changhee numbers and Apostol-type Daehee polynomials. Adv. Stud. Contemp. Math. (Kyungshang) 2017, 27, 199–212. [Google Scholar]
  20. Mihoubi, M.; Rahmani, M. The partial r-Bell polynomials. Afr. Mat. 2017, 28, 1167–1183. [Google Scholar] [CrossRef] [Green Version]
  21. Kim, T.; Kim, D.S.; Jang, G.-W. On central complete and incomplete Bell polynomials I. Symmetry 2019, 11, 288. [Google Scholar] [CrossRef]

Share and Cite

MDPI and ACS Style

Kim, D.S.; Kim, H.Y.; Kim, D.; Kim, T. On r-Central Incomplete and Complete Bell Polynomials. Symmetry 2019, 11, 724. https://doi.org/10.3390/sym11050724

AMA Style

Kim DS, Kim HY, Kim D, Kim T. On r-Central Incomplete and Complete Bell Polynomials. Symmetry. 2019; 11(5):724. https://doi.org/10.3390/sym11050724

Chicago/Turabian Style

Kim, Dae San, Han Young Kim, Dojin Kim, and Taekyun Kim. 2019. "On r-Central Incomplete and Complete Bell Polynomials" Symmetry 11, no. 5: 724. https://doi.org/10.3390/sym11050724

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