Explicit, Determinantal, and Recurrent Formulas of Generalized Eulerian Polynomials

In the paper, by virtue of the Faà di Bruno formula, with the aid of some properties of the Bell polynomials of the second kind, and by means of a general formula for derivatives of the ratio between two differentiable functions, the authors establish explicit, determinantal, and recurrent formulas for generalized Eulerian polynomials.


Introduction
Eulerian polynomials A n (t) for n ≥ 0 can be generated ( [1], p. 2) by A n (t) u n n! , t = 1 and higher-order Eulerian polynomials A (α) n (t) can be generated ( [2], p. 206) by where α > 0. In [3], among other things, Eulerian polynomials A n (t) and higher-order Eulerian polynomials A and A (α) where S(n, k) for n ≥ k ≥ 0 denotes the Stirling numbers of the second kind S(n, k) = 1 k! k ∑ =1 (−1) k− k n and can be generated by (e x − 1) k k! = ∞ ∑ n=k S(n, k) x n n! .
In [5], among other things, it was proven that Eulerian polynomials A n (t) and higherorder Eulerian polynomials A (α) and n ∑ k=0 s(n, k) where s(n, k), which can be generated (see [6,7]) by stands for the Stirling numbers of the first kind. Formulas (1) and (4) are inversions of each other, while Formulas (2) and (5) are also inversions of each other.

Lemmas
To prove our main results, we need the following lemmas. Lemma 1 ([2] (pp. 134 and 139) and [13]). The Bell polynomials of the second kind, or say, partial Bell polynomials, denoted by B n,k (x 1 , x 2 , . . . , x n−k+1 ) for n ≥ k ≥ 0, are defined by The Faà di Bruno formula can be described in terms of the Bell polynomials of the second kind B n,k by Lemma 2 ([2] (p. 135) and [13]). For n ≥ k ≥ 0, we have where a and b are complex numbers.

Explicit, Determinantal, and Recurrent Formulas
In this section, we establish explicit, determinantal, and recurrent formulas for generalized Eulerian polynomials T n (t, a, d).
Theorem 1. For n ≥ 0, the generalized Eulerian polynomials T n (t, a, d) can be explicitly computed by Proof. This is the first proof.
Applying the functions f (v) = 1 v and v = g(u) = t − e du(t−1) to the Faà di Bruno Formula (7) and using the identities (8) and (9) Hence, we obtain that On the other hand, it is easy to see that lim u→0 e au(t−1) (k) = lim u→0 a k (t − 1) k e au(t−1) = a k (t − 1) k .
Using Leibnitz's formula for the nth derivative of the product of two functions gives t − e du(t−1) i+1 e idu(t−1) S(k, i) a n−k e au(t−1) .
Accordingly, it follows that Considering the generating function (6) leads to (11). The proof of Theorem 1 is complete.
Proof. This is the second proof. Lemma 11 in [9] reads that Substituting Formula (1) in ( [3],Theorem 1) into the above formula results in the explicit Formula (11).
Proof. This is the third proof. By virtue of the generating function (3), it is easy to see that Then, it is not difficult to see that Equating coefficients of u n n! leads to the explicit Formula (11).

Remark 1.
The second and third proofs of Theorem 1 are observed by two anonymous referees for avoiding direct and explicit differentiations.
Theorem 3. For n ≥ 0, the generalized Eulerian polynomials T n (t, a, d) possess the recurrence formula T n (t, a, d) = a n (t − 1) n + Therefore, we obtain Equating the coefficients of u n n! arrives at (t − 1)T 0 (t, a, d) = t − 1 and The recursive Formula (13) is thus proven.

Remark 2.
The second proof of Theorem 3 is observed by an anonymous referee for avoiding direct and explicit differentiations.

Conclusions
The theory of polynomials is important in mathematics and mathematical sciences. Series expansions can be regarded as polynomials of infinite terms. Special polynomials such as the Bernoulli polynomials, the Euler polynomials, and the Stirling polynomials are particularly important and interesting. For studying a special sequence of polynomials, one aspect should be to discover its closed-form expressions or recurrent relations. Explicit and determinantal expressions are possibly two forms of closed-form expressions. Especially, finding determinantal expressions of special polynomials are generally difficult and interesting in mathematics. In recent years, the fourth author of this paper gave and applied a general, comparatively effective, comparatively easy, comparatively simple method to set up determinantal expressions and recursive relations of some special polynomials, including the above-mentioned famous Bernoulli numbers and polynomials [15], Euler numbers and polynomials [16,17], and Stirling numbers and polynomials [18], by considering their generating functions. In this paper, after the papers [1,3,7,8] in which Eulerian polynomials A n (x) and higher order Eulerian polynomials A (α) n (t) were investigated, the authors of this paper further considered the generalization T n (t, a, d) in [9] of the sequence of Eulerian polynomials A n (x) and established explicit, determinantal, and recursive formulas of the generalized Eulerian polynomials T n (t, a, d). Concretely speaking, in this paper, by virtue of the Faà di Bruno formula (7), with the aid of the identities (8) and (9), and by means of a general formula (10) for derivatives of the ratio between two differentiable functions, we established an explicit formula (11), a determinantal formula (12), and a recurrent formula (13) for generalized Eulerian polynomials T n (t, a, d) generated in (6).  Data Availability Statement: Data sharing is not applicable to this article as no new data were created or analyzed in this study.