Available online at www.isr-publications.com/jnsa J. Nonlinear Sci. Appl., 10 (2017), 2966–2975 Research Article Journal Homepage: www.tjnsa.com - www.isr-publications.com/jnsa Some identities for umbral calculus associated with partially degenerate Bell numbers and polynomials Taekyun Kima,b, Dae San Kimc, Hyuck-In Kwonb, Seog-Hoon Rimd,∗ aDepartment of Mathematics, College of Science Tianjin Polytechnic University, Tianjin 300160, China. bDepartment of Mathematics, Kwangwoon University, Seoul 139-701, Republic of Korea. cDepartment of Mathematics, Sogang University, Seoul 121-742, Republic of Korea. dDepartment of Mathematics Education, Kyungpook National University, Taegu 702-701, Republic of Korea. Communicated by Y. J. Cho Abstract In this paper, we study partially degenerate Bell numbers and polynomials by using umbral calculus. We give some new identities for these numbers and polynomials which are associated with special numbers and polynomial. c 2017 All rights reserved. Keywords: Partially degenerate Bell polynomials, umbral calculus. 2010 MSC: 05A19, 05A40, 11B83. 1. Introduction The Bell polynomials (also called the exponential polynomials and denoted by φn(x)) are defined by the generating function (see [4, 10, 16]) n x(et-1) t e = Beln(x) . (1.1) 1 n! n= X0 From (1.1), we note that 2 3 2 Bel0(x) = 1, Bel1(x) = x, Bel2(x) = x + x, Bel3(x) = x + 3x + x, 4 3 2 5 4 3 2 Bel4(x) = x + 6x + 7x + x, Bel5(x) = x + 10x + 25x + 15x + x, ··· . When x = 1, Beln = Beln(1) are called the Bell numbers. As is well-known, the Stirling numbers of the second kind are defined by the generating function (see [12, 14, 16]) n t m t e - 1 = m! S2(n, m) , (m > 0). 1 n n=m ! X ∗Corresponding author Email addresses: [email protected] (Taekyun Kim), [email protected] (Dae San Kim), [email protected] (Hyuck-In Kwon), [email protected] (Seog-Hoon Rim) doi:10.22436/jnsa.010.06.11 Received 2017-03-25 T. Kim, D. S. Kim, H.-I. Kwon, S.-H. Rim, J. Nonlinear Sci. Appl., 10 (2017), 2966–2975 2967 The Stirling numbers of the first kind are defined as (see [1–17]) n l (x)n = S1(n, l)x (n > 0), l= X0 where (x)0 = 1, (x)n = x(x - 1) ··· (x - n + 1), (n > 1). From (1.1), we note that (see [10, 12, 16]) n l Beln(x) = S2(n, l)x , (n > 0). l= X0 The Bernoulli polynomials are given by the generating function as follows (see [1–17]) n t xt t t e = Bn(x) . (1.2) e - 1 1 n! n= X0 When x = 0, Bn = Bn(x) are called Bernoulli numbers. From (1.2), we note that (see [7, 11, 12, 16]) n n B (x) = B xn-l. n l l l= X0 Note that d B (x) = nB (x), (n 1). dx n n-1 > Recently, Kim-Kim considered the partially degenerate Bell polynomials which are given by the generat- ing function (see [13]) 1 n x (1+λt) λ -1 t e = Beln,λ(x) . (1.3) 1 n! n= X0 When x=1, Beln,λ = Beln,λ(1) are called the partially degenerate Bell numbers. Note that limλ!0 Beln,λ(x) = Beln(x), (n > 0). Let C be the complex number field and let F be the set of all formal power series in variable t over C with k t F = f(t) = ak ak 2 C . 1 k! k= X0 Let P = C[x] and let P∗ be the vector space of all linear functionals on P. The action of a linear functional L 2 P∗on a polynomial p(x) is denoted by hL j p(x)i, which is linearly extended by the rule 0 0 0 0 0 tk hcL + c L j p(x)i = chL j p(x)i + c hL j p(x)i, where c, c 2 C. For f(t) = k=0 ak k! 2 F, the action hf(t) j ·i of the linear functional f(t) on P is defined by (see [11, 16]) P1 n hf(t) j x i = an for all n > 0. (1.4) By (1.4), we easily get (see [11, 14, 16]) k n ht j x i = n!δn,k, (n, k > 0), (1.5) k tk where δn,k is the Kronecker symbol. Let fL(t) = k=0hL j x i k! . Then, from (1.5), we have 1 Pn n hfL(t) j x i = hL j x i. T. Kim, D. S. Kim, H.-I. Kwon, S.-H. Rim, J. Nonlinear Sci. Appl., 10 (2017), 2966–2975 2968 ∗ Additionally, the map L 7−! fL(t) is a vector space isomorphism from P onto F. Henceforth, F denotes both the algebra of the formal power series in t and the vector space of all linear functionals on P, and an element f(t) of F will be thought of as both a formal power series and a linear functional. We call F umbral algebra. The umbral calculus is the study of umbral algebra (see [11, 14, 16]). Let f(t)(6= 0) 2 F. Then the order of f(t) is the smallest positive integer k for which the coefficient of tk does not vanish. The order of f(t) is denoted by of(t). Let f(t), g(t) 2 F with of(t) = 1 and o g(t) = 0. Then there exists a unique sequence Sn(x) of polynomials such that D E D E k k g(t)f(t) Sn(x) = g(t) f(t) Sn(x) = n!δn,k, (n, k > 0), (see [16]). The sequence Sn(x) is called the Sheffer sequence for g(t), f(t) , for which we write Sn(x) ∼ g(t), f(t) . tk Let f(t) = k=0 ak k! 2 F and p(x) 2 P. Then, by (1.5), we get P1 k k k t k x f(t) = hf(t) j x i , p(x) = ht j p(x)i . (1.6) 1 k! 1 k! k= k= X0 X0 From (1.6), we have d k p(k)(0) = htk j p(x)i = h1 j p(k)(x)i, p(k)(x) = p(x). (1.7) dx By (1.7), we easily get tkp(x) = p(k)(x), eytp(x) = p(x + y), and heyt j p(x)i = p(y). (1.8) It is well-known that n 1 xf¯(t) t Sn(x) ∼ g(t), f(t) () e = Sn(x) , (see [16]), (1.9) g f¯(t) 1 n! n= X0 where f¯(t) is the compositional inverse of f(t) satisfying f¯ f(t) = f f¯(t) = t. Let f1(t), f2(t), ··· , fm(t) 2 F. Then we have n n i1 im hf1(t) ··· fm(t) j x i = hf1(t) j x i · · · hfm(t) j x i. i , ··· , im i +···+i =n 1 1 Xm Let f(t) be the linear functional such that y hf(t) j p(x)i = p(u)du (1.10) Z0 for all polynomials p(x). Then, from (1.6), we have k k+1 hf(t) j x i k y k 1 yt f(t) = t = t = e - 1 . (1.11) 1 k! 1 (k + 1)! t k= k= X0 X0 Thus, by (1.10) and (1.11), we get Deyt - 1 E y eyt - 1 x+y p(x) = p(u)du, p(x) = p(u)du. (1.12) t t Z0 Zx For Sn(x) ∼ g(t), f(t) and rn(x) ∼ h(t), l(t) , we have (see [11, 14, 16]) n Sn(x) = Cn,krk(x), (1.13) k= X0 T. Kim, D. S. Kim, H.-I. Kwon, S.-H. Rim, J. Nonlinear Sci. Appl., 10 (2017), 2966–2975 2969 where k 1 D h f¯(t) nE Cn,k = l f¯(t) x . (1.14) k! g f¯(t) In this paper, we study partially degenerate Bell numbers and polynomials by using umbral calculus. We give some new identities for these numbers and polynomials which are associated with special numbers and polynomials. 2. Some identities for the partially degenerate Bell numbers and polynomials From (1.3), we recall that 1 n x (1+λt) λ -1 t e = Beln,λ(x) . 1 n! n= X0 Note that n 1 n t x (1+λt) λ -1 x(et-1) t lim Beln,λ(x) = lim e = e = Beln(x) . (2.1) 1 λ!0 n! λ!0 1 n! n= n= X0 X0 By (2.1), we get lim Beln,λ(x) = Beln(x), (n > 0). λ!0 From (1.9), we note that λ 1 n (1 + t) - 1 x (1+λt) λ -1 t Beln,λ(x) ∼ 1, () e = Beln,λ(x) . (2.2) λ 1 n! n= X0 Now, we observe that n 1 m m t x (1+λt) λ -1 x 1 Beln,λ(x) = e = (1 + λt) λ - 1 1 n! 1 m! n= m= X0 X0 m m x 1 ( +λt) = e λ log 1 - 1 1 m! m= X0 k m -k 1 = x S2(k, m)λ log(1 + λt) 1 1 k! m= k=m X0 X k ! (2.3) k m -k 1 = S2(k, m)x λ log(1 + λt) 1 k! k= m= X0 X0 k ! n m -k n t = S2(k, m)x λ S1(n, k)λ 1 1 n! k= m= n=k X0 X0 X n k ! n m n-k t = S2(k, m)S1(n, k)x λ .