DOCSLIB.ORG

Some Identities for Umbral Calculus Associated with Partially Degenerate Bell Numbers and Polynomials

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Some Identities for Umbral Calculus Associated with Partially Degenerate Bell Numbers and Polynomials 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 λ .
Load more

Recommended publications
  • Poly-Bernoulli Polynomials Arising from Umbral Calculus
    Poly-Bernoulli polynomials arising from umbral calculus by Dae San Kim, Taekyun Kim and Sang-Hun Lee Abstract In this paper, we give some recurrence formula and new and interesting identities for the poly-Bernoulli numbers and polynomials which are derived from umbral calculus. 1 Introduction The classical polylogarithmic function Lis(x) are ∞ xk Li (x)= , s ∈ Z, (see [3, 5]). (1) s ks k X=1 In [5], poly-Bernoulli polynomials are defined by the generating function to be −t ∞ n Li (1 − e ) (k) t k ext = eB (x)t = B(k)(x) , (see [3, 5]), (2) 1 − e−t n n! n=0 X (k) n (k) with the usual convention about replacing B (x) by Bn (x). As is well known, the Bernoulli polynomials of order r are defined by the arXiv:1306.6697v1 [math.NT] 28 Jun 2013 generating function to be t r ∞ tn ext = B(r)(x) , (see [7, 9]). (3) et − 1 n n! n=0 X (r) In the special case, r = 1, Bn (x)= Bn(x) is called the n-th ordinary Bernoulli (r) polynomial. Here we denote higher-order Bernoulli polynomials as Bn to avoid 1 conflict of notations. (k) (k) If x = 0, then Bn (0) = Bn is called the n-th poly-Bernoulli number. From (2), we note that n n n n B(k)(x)= B(k) xl = B(k)xn−l. (4) n l n−l l l l l X=0 X=0 Let F be the set of all formal power series in the variable t over C as follows: ∞ tk F = f(t)= ak ak ∈ C , (5) ( k! ) k=0 X P P∗ and let = C[x] and denote the vector space of all linear functionals on P.
    [Show full text]
  • Multivariate Expansions Associated with Sheffer-Type Polynomials and Operators
    Bulletin of the Institute of Mathematics Academia Sinica (New Series) Vol. 1 (2006), No. 4, pp. 451-473 MULTIVARIATE EXPANSIONS ASSOCIATED WITH SHEFFER-TYPE POLYNOMIALS AND OPERATORS BY TIAN XIAO HE, LEETSCH C. HSU, AND PETER J.-S. SHIUE Abstract With the aid of multivariate Sheffer-type polynomials and differential operators, this paper provides two kinds of general ex- pansion formulas, called respectively the first expansion formula and the second expansion formula, that yield a constructive solu- [ tion to the problem of the expansion of A(tˆ)f(g(t)) (a composi- tion of any given formal power series) and the expansion of the multivariate entire functions in terms of multivariate Sheffer-type polynomials, which may be considered an application of the first expansion formula and the Sheffer-type operators. The results are applicable to combinatorics and special function theory. 1. Introduction The purpose of this paper is to study the following expansion problem. Problem 1. Let tˆ = (t1,t2,...,tr), A(tˆ), g(t) = (g1(t1), g2(t2),..., gr(tr)) and f(tˆ) be any given formal power series over the complex number Cr ˆ ′ d field with A(0) = 1, gi(0) = 0 and gi(0) 6= 0 (i = 1, 2, . , r). We wish to find the power series expansion in tˆ of the composite function A(tˆ)f(g(t)). Received October 18, 2005 and in revised form July 5, 2006. d Communicated by Xuding Zhu. AMS Subject Classification: 05A15, 11B73, 11B83, 13F25, 41A58. Key words and phrases: Multivariate formal power series, multivariate Sheffer-type polynomials, multivariate Sheffer-type differential operators, multivariate weighted Stirling numbers, multivariate Riordan array pair, multivariate exponential polynomials.
    [Show full text]
  • On Multivariable Cumulant Polynomial Sequences with Applications E
    JOURNAL OF ALGEBRAIC STATISTICS Vol. 7, No. 1, 2016, 72-89 ISSN 1309-3452 { www.jalgstat.com On multivariable cumulant polynomial sequences with applications E. Di Nardo1,∗ 1 Department of Mathematics \G. Peano", Via Carlo Alberto 10, University of Turin, 10123, I-Turin, ITALY Abstract. A new family of polynomials, called cumulant polynomial sequence, and its extension to the multivariate case is introduced relying on a purely symbolic combinatorial method. The coefficients are cumulants, but depending on what is plugged in the indeterminates, moment se- quences can be recovered as well. The main tool is a formal generalization of random sums, when a not necessarily integer-valued multivariate random index is considered. Applications are given within parameter estimations, L´evyprocesses and random matrices and, more generally, problems involving multivariate functions. The connection between exponential models and multivariable Sheffer polynomial sequences offers a different viewpoint in employing the method. Some open problems end the paper. 2000 Mathematics Subject Classifications: 62H05; 60C05; 11B83, 05E40 Key Words and Phrases: multi-index partition, cumulant, generating function, formal power series, L´evyprocess, exponential model 1. Introduction The so-called symbolic moment method has its roots in the classical umbral calculus developed by Rota and his collaborators since 1964; [15]. Rewritten in 1994 (see [17]), what we have called moment symbolic method consists in a calculus on unital number sequences. Its basic device is to represent a sequence f1; a1; a2;:::g with the sequence 2 f1; α; α ;:::g of powers of a symbol α; named umbra. The sequence f1; a1; a2;:::g is said to be umbrally represented by the umbra α: The main tools of the symbolic moment method are [7]: a) a polynomial ring C[A] with A = fα; β; γ; : : :g a set of symbols called umbrae; b) a unital operator E : C[A] ! C; called evaluation, such that i i) E[α ] = ai for non-negative integers i; ∗Corresponding author.
    [Show full text]
  • Degenerate Poly-Bernoulli Polynomials with Umbral Calculus Viewpoint Dae San Kim1,Taekyunkim2*, Hyuck in Kwon2 and Toufik Mansour3
    Kim et al. Journal of Inequalities and Applications (2015)2015:228 DOI 10.1186/s13660-015-0748-7 R E S E A R C H Open Access Degenerate poly-Bernoulli polynomials with umbral calculus viewpoint Dae San Kim1,TaekyunKim2*, Hyuck In Kwon2 and Toufik Mansour3 *Correspondence: [email protected] 2Department of Mathematics, Abstract Kwangwoon University, Seoul, 139-701, S. Korea In this paper, we consider the degenerate poly-Bernoulli polynomials. We present Full list of author information is several explicit formulas and recurrence relations for these polynomials. Also, we available at the end of the article establish a connection between our polynomials and several known families of polynomials. MSC: 05A19; 05A40; 11B83 Keywords: degenerate poly-Bernoulli polynomials; umbral calculus 1 Introduction The degenerate Bernoulli polynomials βn(λ, x)(λ =)wereintroducedbyCarlitz[ ]and rediscovered by Ustinov []underthenameKorobov polynomials of the second kind.They are given by the generating function t tn ( + λt)x/λ = β (λ, x) . ( + λt)/λ – n n! n≥ When x =,βn(λ)=βn(λ, ) are called the degenerate Bernoulli numbers (see []). We observe that limλ→ βn(λ, x)=Bn(x), where Bn(x)isthenth ordinary Bernoulli polynomial (see the references). (k) The poly-Bernoulli polynomials PBn (x)aredefinedby Li ( – e–t) tn k ext = PB(k)(x) , et – n n! n≥ n where Li (x)(k ∈ Z)istheclassicalpolylogarithm function given by Li (x)= x (see k k n≥ nk [–]). (k) For = λ ∈ C and k ∈ Z,thedegenerate poly-Bernoulli polynomials Pβn (λ, x)arede- fined by Kim and Kim to be Li ( – e–t) tn k ( + λt)x/λ = Pβ(k)(λ, x) (see []).
    [Show full text]
  • A Note on Some Identities of New Type Degenerate Bell Polynomials
    mathematics Article A Note on Some Identities of New Type Degenerate Bell Polynomials Taekyun Kim 1,2,*, Dae San Kim 3,*, Hyunseok Lee 2 and Jongkyum Kwon 4,* 1 School of Science, Xi’an Technological University, Xi’an 710021, China 2 Department of Mathematics, Kwangwoon University, Seoul 01897, Korea; [email protected] 3 Department of Mathematics, Sogang University, Seoul 04107, Korea 4 Department of Mathematics Education and ERI, Gyeongsang National University, Gyeongsangnamdo 52828, Korea * Correspondence: [email protected] (T.K.); [email protected] (D.S.K.); [email protected] (J.K.) Received: 24 October 2019; Accepted: 7 November 2019; Published: 11 November 2019 Abstract: Recently, the partially degenerate Bell polynomials and numbers, which are a degenerate version of Bell polynomials and numbers, were introduced. In this paper, we consider the new type degenerate Bell polynomials and numbers, and obtain several expressions and identities on those polynomials and numbers. In more detail, we obtain an expression involving the Stirling numbers of the second kind and the generalized falling factorial sequences, Dobinski type formulas, an expression connected with the Stirling numbers of the first and second kinds, and an expression involving the Stirling polynomials of the second kind. Keywords: Bell polynomials; partially degenerate Bell polynomials; new type degenerate Bell polynomials MSC: 05A19; 11B73; 11B83 1. Introduction Studies on degenerate versions of some special polynomials can be traced back at least as early as the paper by Carlitz [1] on degenerate Bernoulli and degenerate Euler polynomials and numbers. In recent years, many mathematicians have drawn their attention in investigating various degenerate versions of quite a few special polynomials and numbers and discovered some interesting results on them [2–9].
    [Show full text]
  • Recurrence Relation Lower and Upper Bounds Maximum Parity Simple
    From Wikipedia, the free encyclopedia In mathematics, particularly in combinatorics, a Stirling number of the second kind (or Stirling partition number) is the number of ways to partition a set of n objects into k non-empty subsets and is denoted by or .[1] Stirling numbers of the second kind occur in the field of mathematics called combinatorics and the study of partitions. Stirling numbers of the second kind are one of two kinds of Stirling numbers, the other kind being called Stirling numbers of the first kind (or Stirling cycle numbers). Mutually inverse (finite or infinite) triangular matrices can be formed from the Stirling numbers of each kind according to the parameters n, k. 1 Definition The 15 partitions of a 4-element set 2 Notation ordered in a Hasse diagram 3 Bell numbers 4 Table of values There are S(4,1),...,S(4,4) = 1,7,6,1 partitions 5 Properties containing 1,2,3,4 sets. 5.1 Recurrence relation 5.2 Lower and upper bounds 5.3 Maximum 5.4 Parity 5.5 Simple identities 5.6 Explicit formula 5.7 Generating functions 5.8 Asymptotic approximation 6 Applications 6.1 Moments of the Poisson distribution 6.2 Moments of fixed points of random permutations 6.3 Rhyming schemes 7 Variants 7.1 Associated Stirling numbers of the second kind 7.2 Reduced Stirling numbers of the second kind 8 See also 9 References The Stirling numbers of the second kind, written or or with other notations, count the number of ways to partition a set of labelled objects into nonempty unlabelled subsets.
    [Show full text]
  • L-Series and Hurwitz Zeta Functions Associated with the Universal Formal Group
    Ann. Scuola Norm. Sup. Pisa Cl. Sci. (5) Vol. IX (2010), 133-144 L-series and Hurwitz zeta functions associated with the universal formal group PIERGIULIO TEMPESTA Abstract. The properties of the universal Bernoulli polynomials are illustrated and a new class of related L-functions is constructed. A generalization of the Riemann-Hurwitz zeta function is also proposed. Mathematics Subject Classification (2010): 11M41 (primary); 55N22 (sec- ondary). 1. Introduction The aim of this article is to establish a connection between the theory of formal groups on one side and a class of generalized Bernoulli polynomials and Dirichlet series on the other side. Some of the results of this paper were announced in the communication [26]. We will prove that the correspondence between the Bernoulli polynomials and the Riemann zeta function can be extended to a larger class of polynomials, by introducing the universal Bernoulli polynomials and the associated Dirichlet series. Also, in the same spirit, generalized Hurwitz zeta functions are defined. Let R be a commutative ring with identity, and R {x1, x2,...} be the ring of formal power series in x1, x2,...with coefficients in R.Werecall that a commuta- tive one-dimensional formal group law over R is a formal power series (x, y) ∈ R {x, y} such that 1) (x, 0) = (0, x) = x 2) ( (x, y) , z) = (x,(y, z)) . When (x, y) = (y, x), the formal group law is said to be commutative. The existence of an inverse formal series ϕ (x) ∈ R {x} such that (x,ϕ(x)) = 0 follows from the previous definition.
    [Show full text]
  • Arxiv:2103.13478V2 [Math.NT] 11 May 2021 Solution of the Differential Equation Y = E , Special Values of Bell Polynomials
    Solution of the Differential Equation y(k) = eay, Special Values of Bell Polynomials and (k,a)-Autonomous Coefficients Ronald Orozco L´opez Departamento de Matem´aticas Universidad de los Andes Bogot´a, 111711 Colombia [email protected] Abstract In this paper special values of Bell polynomials are given by using the power series solution of the equation y(k) = eay. In addition, complete and partial exponential autonomous functions, exponential autonomous polyno- mials, autonomous polynomials and (k, a)-autonomous coefficients are de- fined. Finally, we show the relationship between various numbers counting combinatorial objects and binomial coefficients, Stirling numbers of second kind and autonomous coefficients. 1 Introduction It is a known fact that Bell polynomials are closely related to derivatives of composi- tion of functions. For example, Faa di Bruno [5], Foissy [6], and Riordan [10] showed that Bell polynomials are a very useful tool in mathematics to represent the n-th derivative of the composition of functions. Also, Bernardini and Ricci [2], Yildiz et arXiv:2103.13478v2 [math.NT] 11 May 2021 al. [12], Caley [3], and Wang [13] showed the relationship between Bell polynomials and differential equations. On the other hand, Orozco [9] studied the convergence of the analytic solution of the autonomous differential equation y(k) = f(y) by using Faa di Bruno’s formula. We can then look at differential equations as a source for investigating special values of Bell polynomials. In this paper we will focus on finding special values of Bell polynomials when the vector field f(x) of the autonomous differential equation y(k) = f(y) is the exponential function.
    [Show full text]
  • A Note on Poly-Bernoulli Polynomials Arising from Umbral Calculus
    Adv. Studies Theor. Phys., Vol. 7, 2013, no. 15, 731 - 744 HIKARI Ltd, www.m-hikari.com http://dx.doi.org/10.12988/astp.2013.3667 A Note on Poly-Bernoulli Polynomials Arising from Umbral Calculus Dae San Kim Department of Mathematics, Sogang University Seoul 121-742, Republic of Korea [email protected] Taekyun Kim Department of Mathematics, Kwangwoon University Seoul 139-701, Republic of Korea [email protected] Sang-Hun Lee Division of General Education Kwangwoon University Seoul 139-701, Republic of Korea [email protected] Copyright c 2013 Dae San Kim et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. Abstract In this paper, we give some recurrence formula and new and interesting 732 Dae San Kim, Taekyun Kim and Sang-Hun Lee identities for the poly-Bernoulli numbers and polynomials which are derived from umbral calculus. 1 Introduction The classical polylogarithmic function Lis(x) are ∞ k x ∈ Lis(x)= s ,s Z, (see [3, 5]). (1) k=1 k In [5], poly-Bernoulli polynomials are defined by the generating function to be −t ∞ n Lik (1 − e ) (k) t ext = eB (x)t = B(k)(x) , (see [3, 5]), (2) − −t n 1 e n=0 n! (k) n (k) with the usual convention about replacing B (x) by Bn (x). As is well known, the Bernoulli polynomials of order r are defined by the generating function to be r ∞ t tn ext = B(r)(x) , (see [7, 9]).
    [Show full text]
  • Generalized Bell Polynomials and the Combinatorics of Poisson Central Moments
    Generalized Bell polynomials and the combinatorics of Poisson central moments Nicolas Privault∗ Division of Mathematical Sciences School of Physical and Mathematical Sciences Nanyang Technological University SPMS-MAS-05-43, 21 Nanyang Link Singapore 637371 February 25, 2011 Abstract We introduce a family of polynomials that generalizes the Bell polynomials, in connection with the combinatorics of the central moments of the Poisson dis- tribution. We show that these polynomials are dual of the Charlier polynomials by the Stirling transform, and we study the resulting combinatorial identities for the number of partitions of a set into subsets of size at least 2. Key words: Bell polynomials, Poisson distribution, central moments, Stirling num- bers. Mathematics Subject Classification: 11B73, 60E07. 1 Introduction The moments of the Poisson distribution are well-known to be connected to the com- binatorics of the Stirling and Bell numbers. In particular the Bell polynomials Bn(λ) satisfy the relation n Bn(λ) = Eλ[Z ]; n 2 IN; (1.1) where Z is a Poisson random variable with parameter λ > 0, and n X Bn(1) = S(n; c) (1.2) c=0 ∗[email protected] 1 is the Bell number of order n, i.e. the number of partitions of a set of n elements. In this paper we study the central moments of the Poisson distribution, and we show that they can be expressed using the number of partitions of a set into subsets of size at least 2, in connection with an extension of the Bell polynomials. Consider the above mentioned Bell (or Touchard) polynomials Bn(λ) defined by the exponential generating function 1 n t X t eλ(e −1) = B (λ); (1.3) n! n n=0 λ, t 2 IR, cf.
    [Show full text]
  • The Umbral Calculus of Symmetric Functions
    Advances in Mathematics AI1591 advances in mathematics 124, 207271 (1996) article no. 0083 The Umbral Calculus of Symmetric Functions Miguel A. Mendez IVIC, Departamento de Matematica, Caracas, Venezuela; and UCV, Departamento de Matematica, Facultad de Ciencias, Caracas, Venezuela Received January 1, 1996; accepted July 14, 1996 dedicated to gian-carlo rota on his birthday 26 Contents The umbral algebra. Classification of the algebra, coalgebra, and Hopf algebra maps. Families of binomial type. Substitution of admissible systems, composition of coalgebra maps and plethysm. Umbral maps. Shift-invariant operators. Sheffer families. Hammond derivatives and umbral shifts. Symmetric functions of Schur type. Generalized Schur functions. ShefferSchur functions. Transfer formulas and Lagrange inversion formulas. 1. INTRODUCTION In this article we develop an umbral calculus for the symmetric functions in an infinite number of variables. This umbral calculus is analogous to RomanRota umbral calculus for polynomials in one variable [45]. Though not explicit in the RomanRota treatment of umbral calculus, it is apparent that the underlying notion is the Hopf-algebra structure of the polynomials in one variable, given by the counit =, comultiplication E y, and antipode % (=| p(x))=p(0) E yp(x)=p(x+y) %p(x)=p(&x). 207 0001-8708Â96 18.00 Copyright 1996 by Academic Press All rights of reproduction in any form reserved. File: 607J 159101 . By:CV . Date:26:12:96 . Time:09:58 LOP8M. V8.0. Page 01:01 Codes: 3317 Signs: 1401 . Length: 50 pic 3 pts, 212 mm 208 MIGUEL A. MENDEZ The algebraic dual, endowed with the multiplication (L V M| p(x))=(Lx }My| p(x+y)) and with a suitable topology, becomes a topological algebra.
    [Show full text]
  • Contents What These Numbers Count Triangle Scheme for Calculations
    From Wikipedia, the free encyclopedia In combinatorial mathematics, the Bell numbers count the number of partitions of a set. These numbers have been studied by mathematicians since the 19th century, and their roots go back to medieval Japan, but they are named after Eric Temple Bell, who wrote about them in the 1930s. Starting with B0 = B1 = 1, the first few Bell numbers are: 1, 1, 2, 5, 15, 52, 203, 877, 4140, 21147, 115975, 678570, 4213597, 27644437, 190899322, 1382958545, 10480142147, 82864869804, 682076806159, 5832742205057, ... (sequence A000110 in the OEIS). The nth of these numbers, Bn, counts the number of different ways to partition a set that has exactly n elements, or equivalently, the number of equivalence relations on it. Outside of mathematics, the same number also counts the number of different rhyme schemes for n-line poems.[1] As well as appearing in counting problems, these numbers have a different interpretation, as moments of probability distributions. In particular, Bn is the nth moment of a Poisson distribution with mean 1. Contents 1 What these numbers count 1.1 Set partitions 1.2 Factorizations 1.3 Rhyme schemes 1.4 Permutations 2 Triangle scheme for calculations 3 Properties 3.1 Summation formulas 3.2 Generating function 3.3 Moments of probability distributions 3.4 Modular arithmetic 3.5 Integral representation 3.6 Log-concavity 3.7 Growth rate 4 Bell primes 5History 6 See also 7Notes 8 References 9 External links What these numbers count Set partitions In general, Bn is the number of partitions of a set of size n.
    [Show full text]