Notes on two kinds of special values for the Bell polynomials of the second kind Feng Qi, Dongkyu Lim, Yong-Hong Yao
To cite this version:
Feng Qi, Dongkyu Lim, Yong-Hong Yao. Notes on two kinds of special values for the Bell polynomials of the second kind: Notes on special values of the Bell polynomials. Miskolc Mathematical Notes, Miskolci Egyetemi Kiadó, 2019, 20 (1), pp.465–474. 10.18514/MMN.2019.2635. hal-01757740v2
HAL Id: hal-01757740 https://hal.archives-ouvertes.fr/hal-01757740v2 Submitted on 18 Jan 2020
HAL is a multi-disciplinary open access L’archive ouverte pluridisciplinaire HAL, est archive for the deposit and dissemination of sci- destinée au dépôt et à la diffusion de documents entific research documents, whether they are pub- scientifiques de niveau recherche, publiés ou non, lished or not. The documents may come from émanant des établissements d’enseignement et de teaching and research institutions in France or recherche français ou étrangers, des laboratoires abroad, or from public or private research centers. publics ou privés. NOTES ON TWO KINDS OF SPECIAL VALUES FOR THE BELL POLYNOMIALS OF THE SECOND KIND
FENG QI, DONGKYU LIM, AND YONG-HONG YAO
Abstract. In the paper, by methods and techniques in combinatorial analysis and the theory of special functions, the authors discuss two kinds of special values for the Bell polynomials of the second kind for two special sequences, find a relation between these two kinds of special values for the Bell polynomials of the second kind, and derive an identity involving the combinatorial numbers.
1. Motivation In [1, Definition 11.2] and [2, p. 134, Theorem A], the Bell polynomials of the second kind, denoted by Bn,k(x1, x2, . . . , xn−k+1) for n ≥ k ≥ 0, are defined by
n−k+1 X n! Y xi `i B (x , x , . . . , x ) = . n,k 1 2 n−k+1 Qn−k+1 i! 1≤i≤n−k+1 i=1 `i! i=1 `i∈{0}∪N Pn−k+1 i=1 i`i=n Pn−k+1 i=1 `i=k
For more information on the Bell polynomials of the second kind Bn,k, please refer to the monographs and handbooks [1–3] and closely related references therin. In [1, p. 451], the formulas (2r)!r − 1 B (0, 2!,..., 0, (2r)!) = , 2r,k k! k − 1
B2r−1,k(0, 2!,..., (2r − 2)!, 0) = 0,
2010 Mathematics Subject Classification. Primary 11B83; Secondary 11C08, 12E10, 26C05. Key words and phrases. special value; Bell polynomial of the second kind; factorial; re- lation; Fa`adi Bruno formula; identity; beta function; combinatorial analysis; Vandermonde convolution formula. Please cite this article as “Feng Qi, Dongkyu Lim, and Yong-Hong Yao, Notes on two kinds of special values for the Bell polynomials of the second kind, Miskolc Mathematical Notes 20 (2019), no. 1, 465–474; available online at https://doi.org/10.18514/MMN.2019.2635.” 1 2 F. QI, D. LIM, AND Y.-H. YAO
(2r)!r + s − 1 B (1!, 0,..., (2r − 1)!, 0) = , 2r,2s (2s)! 2s − 1
B2r,2s−1(1!, 0,..., (2r − 1)!, 0) = 0, (2r − 1)!r + s − 2 B (1!, 0,..., (2r − 1)!, 0) = , 2r−1,2s−1 (2s − 1)! 2s − 2
B2r−1,2s(1!, 0,..., 0, (2r − 1)!) = 0 were stated, but no proof was supplied for them there. For simplicity, we denote 1 + (−1)n−k+1 λ(n, k) = B 0, 2!, 0, 4!,..., (n − k + 1)! n,k 2 and 1 − (−1)n−k+1 µ(n, k) = B 1!, 0, 3!, 0,..., (n − k + 1)! . n,k 2 In terms of these notations, the above claims in [1, p. 451] can be restated as (2r)!r − 1 λ(2r, k) = , λ(2r − 1, k) = 0, k! k − 1 (2r)!r + s − 1 µ(2r, 2s) = , µ(2r, 2s − 1) = 0, (2s)! 2s − 1 (2r − 1)!r + s − 2 µ(2r − 1, 2s − 1) = , µ(2r − 1, 2s = 0. (2s − 1)! 2s − 2 In this paper, by methods and techniques in combinatorial analysis and the theory of special functions, we will provide alternative proofs for the above six formulas, find a relation between them, and derive an identity involving combinatorial numbers.
2. Main reults We first derive an identity involving combinatorial numbers, which will be useful in next proofs of our main results. Theorem 1. For k ≥ 1 and n ≥ 0, we have n X (−1)q n 1 = . (2.1) k + q q k+n q=0 k k Proof. Let n X (−1)q n f(x) = xk+q, x ∈ [−1, 1]. k + q q q=0 NOTES ON SPECIAL VALUES OF THE BELL POLYNOMIALS 3
Then f(0) = 0 and n n X n X n f 0(x) = (−1)q xk+q−1 = xk−1 (−1)q xq = xk−1(1 − x)n. q q q=0 q=0 Integrating from 0 to t ∈ (0, 1] on both sides of the above equality yields Z t f(t) = xk−1(1 − x)n d x = B(t; k, n + 1), 0 where B(z; a, b) denotes the incomplete beta function, see [3, p. 183]. There- fore, we obtain f(1) = B(1; k, n + 1) = B(k, n + 1) Γ(k)Γ(n + 1) (k − 1)!n! 1 k!n! 1 = = = = , Γ(k + n + 1) (k + n)! k (k + n)! n+k k k where B(a, b) and Γ(z) denote the beta function and the classical Euler gamma function respectively, see [3, p. 142] and [3, Chapter 5]. The formula (2.1) is thus proved. The proof of Theorem 1 is complete. We are now in a position to state and prove our main results. Theorem 2. For n ≥ k ≥ 0, we have the relation µ(n, k) λ(n + k, k) = (2.2) n! (n + k)! and two explicit formulas 1 + (−1)n n! n − 1 λ(n, k) = 2 (2.3) 2 k! k − 1 and 1 + (−1)n+k n! n+k − 1 µ(n, k) = 2 . (2.4) 2 k! k − 1 Proof. It is known [2, 13] that the quantities n−1 ( Y x(x − 1) ··· (x − n + 1), n ≥ 1 hxin = (x − `) = 1, n = 0 `=0 and n−1 ( Y x(x + 1) ··· (x + n − 1), n ≥ 1 (x)n = (x + `) = 1, n = 0 `=0 are called the falling and rising factorials respectively. In [2, p. 133], it was listed that ∞ !k ∞ 1 X tm X tn x = B (x , x , . . . , x ) (2.5) k! m m! n,k 1 2 n−k+1 n! m=1 n=k 4 F. QI, D. LIM, AND Y.-H. YAO for k ≥ 0. Hence, we have
∞ " ∞ #k k X tn 1 X 1 + (−1)m tm 1 t2 λ(n, k) = m! = n! k! 2 m! k! 1 − t2 n=k m=1 which is equivalent to ∞ k X 1 tn t λ(n + k, k) = . n+k n! 1 − t2 n=0 n t Since the function 1−t2 is odd, we derive λ(2r−1, k) = 0. Further computation yields n + k dn t k λ(n + k, k) = lim n t→0 d tn 1 − t2 n + k 1 1 1 k(n) = lim − n 2k t→0 1 − t 1 + t " k ` k−`#(n) n + k 1 X k 1 1 = lim (−1)k−` n 2k t→0 ` 1 − t 1 + t `=0 k n ` (q) k−` (n−q) n + k 1 X k X n 1 1 = (−1)k−` lim n 2k ` t→0 q 1 − t 1 + t `=0 q=0 k n n + k 1 X k X n = (−1)k−` lim n 2k ` t→0 q `=0 q=0 1 `+q 1 k−`+(n−q) ×h−`i (−1)q h−(k − `)i q 1 − t n−q 1 + t k n (−1)k n + k X k X n = (−1)` (−1)q h−`i h` − ki 2k n ` q q n−q `=0 q=0 k n (−1)n+k n + k X k X n = (−1)` (−1)q (`) (k − `) . 2k n ` q q n−q `=0 q=0 In summary, we obtain
k n−k (−1)k n X k X n − k λ(n, k) = (−1)` (−1)q h−`i h` − ki 2k k ` q q n−k−q `=0 q=0 k n−k (−1)n n X k X n − k = (−1)` (−1)q (`) (k − `) . (2.6) 2k k ` q q n−k−q `=0 q=0 NOTES ON SPECIAL VALUES OF THE BELL POLYNOMIALS 5
By similar argument as above, it follows that
∞ " ∞ #k k X tn 1 X 1 − (−1)m tm (−1)k 1 1 µ(n, k) = m! = + n! k! 2 m! k!2k t − 1 t + 1 n=k m=1 which is equivalent to ∞ k k X 1 tn (−1)k 1 1 1 1 µ(n + k, k) = + = . (2.7) n+k n! 2k tk t − 1 t + 1 1 − t2 n=0 n 1 Since 1−t2 is even, we deduce immediately that µ(2r−1, 2s) = 0 and µ(2r, 2s− 1) = 0. By the L’Hˆospitalrule and the identity (2.1) in Theorem 1, it follows that n + k(−1)k dn 1 1 1 k µ(n + k, k) = lim + n 2k t→0 d tn tk t − 1 t + 1 k n k(n−q) n + k (−1) X n h−kiq 1 1 = lim + n 2k t→0 q tk+q t − 1 t + 1 q=0 k n k(n+k) n + k (−1) X n h−kiq 1 1 = lim + n 2k q (k + q)! t→0 t − 1 t + 1 q=0 n n + k(−1)k X n(−1)q(k + q − 1)! = n 2k q (k − 1)!(k + q)! q=0
" k ` k−`#(n+k) X k 1 1 × lim t→0 ` t − 1 t + 1 `=0 n k n + k (−1)k X (−1)q n X k = n 2k(k − 1)! k + q q ` q=0 `=0 n+k ` (m) k−` (n+k−m) X n + k 1 1 × lim t→0 m t − 1 t + 1 m=0 k n+k (−1)k X k X n + k = lim 2kk! ` t→0 m `=0 m=0 1 `+m 1 (k−`)+(n+k−m) ×h−`i h` − ki m t − 1 n+k−m t + 1 k n+k (−1)k X k X n + k = (−1)` (−1)m h−`i h` − ki . 2kk! ` m m n+k−m `=0 m=0 In short, we obtain 6 F. QI, D. LIM, AND Y.-H. YAO
k n (−1)k X k X n µ(n, k) = (−1)` (−1)m h−`i h` − ki 2kk! ` m m n−m `=0 m=0 k n (−1)n+k X k X n = (−1)` (−1)m (`) (k − `) . (2.8) 2kk! ` m m n−m `=0 m=0 Comparing between (2.6) and (2.8) reveals (−1)n+k 2k 1 µ(n, k) = λ(n + k, k) 2kk! (−1)n+k n+k k which can be rearranged as (2.2). The Fa`adi Bruno formula, see [1, Theorem 11.4] and [2, p. 139, Theorem C], can be described in terms of Bn,k(x1, x2, . . . , xn−k+1) by n dn X f ◦ h(x) = f (k)(h(x)) B h0(x), h00(x), . . . , h(n−k+1)(x). (2.9) d xn n,k k=0 In [1, p. 412] and [2, p. 135], one can find the identity