Poly-central factorial sequences and poly-central-Bell polynomials

In this paper, we introduce poly-central factorial sequences and poly-central Bell polynomials arising from the polyexponential functions, reducing them to central factorials and central Bell polynomials of the second kind respectively when k=1\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$k = 1$\end{document}. We also show some relations: between poly-central factorial sequences and power of x; between poly-central Bell polynomials and power of x; between poly-central Bell polynomials and the poly-Bell polynomials; between poly-central Bell polynomials and higher order type 2 Bernoulli polynomials of second kind; recurrence formula of poly-central Bell polynomials.


Introduction
The central factorial numbers of the first and second kinds consist of the same kind of reciprocity as the corresponding polynomials for the Stirling numbers of the first and second kinds [20]. They have appeared in many different contexts as follows: the approximation theory [2], algebraic geometry [6,20], and spectral theory of differential operators [7,18]. The poly-exponential functions were reconsidered by Kim [9] in view of an inverse to the polylogarithm functions which were first studied by Hardy [8]. Kim et al. showed that the degenerate Daehee numbers of order k expressed the degenerate polyexponential functions in [13]. Furthermore, recently, Kim and Kim introduced the poly-Bell polynomials and the poly-Lah-Bell polynomials arising from polyexponential functions respectively in [16,17]. With this in mind, we introduce poly-central factorial sequences and poly-central Bell polynomials arising from the polyexponential functions, reducing them to central factorials and central Bell polynomials of the second kind respectively when k = 1. We also show some relations: between poly-central factorial sequences and power of x; between poly-central Bell polynomials and power of x; between poly-central Bell polynomials and the poly-Bell polynomials; between poly-central Bell polynomials and higher order type 2 Bernoulli polynomials of second kind; recurrence formula of poly-central Bell polynomials.
Riordan showed that 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 given by T(n, l)x [l] (n ≥ l ≥ 0), (see [19]).
Kim and Kim introduced the central Bell polynomials B (c) n (x) defined by x k T(n, k), (n ≥ 0), (see [11]), From (6) and (8), we note that the generating function for the central Bell polynomials is t n n! (see [11]), where B (c) n (x) = n k=0 T(n, k)x k are the central polynomials Bell polynomials and B (c) n = B (c) n (1) are the central Bell numbers. For n ≥ 0, the Stirling numbers of the first kind S 1 (n, l) are the coefficients of x l in (x) n = n l=0 S 1 (n, l)x l (see [3,5,15]).
From (10), it is easy to see that In the inverse expression to (10), for n ≥ 0, the nth power of x can be expressed in terms of the Stirling numbers of the second kind S 2 (n, l) as follows: x n = n l=0 S 2 (n, l)(x) l (see [3,5,15]).
From (12), it is easy to see that The nth Bell number B n (n ≥ 0) is the number of ways to partition a set with n elements into nonempty subsets. The Bell polynomials are natural extensions of the Bell numbers as follows: It is well known that the generating function of the Bell polynomials is given by bel n (x) t n n! (see [3,5,16]).
Now, as well established within academia, the ordinary Bernoulli polynomials b n (x) and the Euler polynomials E n (x), (n ∈ N ∪ {0}) are respectively defined by their generating functions as follows (see [3,5]): When x = 0, b n = b n (0) and E n = E n (0) are respectively called the Bernoulli numbers and the Euler numbers.
For r ∈ R, the type 2 Bernoulli polynomials of the second kind with order r are defined by the generating function t n n! (see [12]).
When x = 0, b * (r) n (0) are called the type 2 Bernoulli numbers of the second kind order r. Kim and Kim introduced the modified polyexponential function as , (see [9,14]).

Poly-central factorial sequences and poly-central-Bell polynomials
In this section, we define poly-central factorial sequences and poly-central-Bell polynomials respectively by using the degenerate polylogarithm functions and give explicit expressions and recurrence formula of poly-central Bell polynomials. First, we consider the poly-central factorial sequences x [n](k) , which are derived from the polyexponential function to be x [n](k) t n n! and x [0](k) = 1.
In Theorem 1, when k = 1, we note that Proof By replacing t with e t 2e -t 2 in (21), from (18), the left-hand side of (21) is On the other hand, from (6), the right-hand side of (21) is Comparing with the coefficients of (26) and (27), we have the desired result.
In Theorem 4, when k = 1, we note that Proof From (19) and (23), we get  Proof By replacing t with 2 log(1 + t) in (23), from (11) and (17), the left-hand side of (23) On the other hand, by (11), the right-hand side of (23) is Proof Differentiating with respect to t in (23), the left-hand side of (23) is On the other hand, the right-hand side of (23) is Combining (33) with (34), we get From (16) and (35), we have By comparing with the coefficients of both sides of (37), we have the desired result.

Further remark
Let r ∈ N ∪ {0}, the r-Stirling numbers S 2,r (n, j) of the second kind are given by 1 j! e rt e t -1 j = ∞ n=j S 2,r (n + r, j + r) t n n! (see [15]).

Conclusion
To summarize, we introduced poly-central factorial sequences and poly-central Bell polynomials in terms of the polyexponential functions, reducing them to central factorials and central Bell polynomials of the second kind respectively when k = 1. We derived relations between poly-central factorial sequences and power of x in Theorems 1, 2. We also obtained relations between poly-central Bell polynomials and power of x in Theorems 3, 4.
In addition, we showed several identities between poly-central Bell polynomials and poly-Bell polynomials; between poly-central Bell polynomials and higher order type 2 Bernoulli polynomials of second kind; recurrence formula of poly-central Bell polynomials in Theorems 5, 6, 7.
To conclude, there are various methods for studying special polynomials and numbers, including: generating functions, combinatorial methods, umbral calculus, differential equations, and probability theory [2,[4][5][6][7][18][19][20]. We are now interested in continuing our research into the application of 'poly' versions of certain special polynomials and numbers in the fields of physics, science, and engineering as well as mathematics.