DOCSLIB.ORG

A Note on Some Identities of New Type Degenerate Bell Polynomials

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read 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]. This idea of introducing various degenerate versions of some special polynomials and numbers has been not only applied to polynomials but also extended to transcendental functions, so that for example, the degenerate gamma functions were introduced in [10,11]. 1 Indeed, for each real number l > 0, and any complex number s satisfying 0 < Re(s) < l , the degenerate gamma function Gl(s) is defined by Z ¥ − 1 s−1 Gl(s) = (1 + lt) l t dt. 0 Then, among many properties of them, let us mention only one of them, namely, for any positive 1 integer k and any real number l satisfying 0 < l < k , (k − 1)! G (k) = . l (1 − l)(1 − 2l) ··· (1 − kl) Bell polynomials Bn(x) (see Equation (1)) are named after E. T. Bell [12] and also called exponential polynomials or Touchard polynomials. Bell polynomials together with their multivariate versions, Mathematics 2019, 7, 1086; doi:10.3390/math7111086 www.mdpi.com/journal/mathematics Mathematics 2019, 7, 1086 2 of 12 namely the partial and complete Bell polynomials, have diverse applications not only in mathematics but also in physics and engineering as well [13]. For instance, the celebrated Faà di Bruno formula is given by dn n ◦ ( ) = (k) ( ) ( 0( ) 00( ) ··· (n−k+1)( )) n f g t ∑ f g t Bn,k g t , g t , , g t , dt k=0 which gives an explicit formula for higher derivatives of composite functions. Here the partial Bell polynomials Bn,k(x1, x2, ··· xn−k+1) are defined by n−k+1 i n! xl l B (x , x , ··· x − + ) = , (n ≥ k ≥ 0), n,k 1 2 n k 1 ∑ n−k+1 ∏ l! ∏l=1 il! l=1 where the sum runs over all nonnegative integers i1, i2, ··· , in−k+1, satisfying i1 + i2 + ··· + in−k+1 = k, and i1 + 2i2 + ··· (n − k + 1)in−k+1 = n, (see [13] p. 133). In the previous paper, the partially degenerate Bell polynomials bn,l(x), which are a degenerate version of Bell polynomials, were introduced (see Equation (3)) and some interesting identities on them were obtained in connection with Stirling numbers of the first and second kinds [14]. Further, in [15] the umbral calculus techniques were employed in order to derive some properties, explicit expressions and representations of them in terms of other special polynomials. In the present paper, the new type degenerate Bell polynomials Bn(xjl), which are another degenerate version of Bell polynomials, are introduced and several expressions and identities on them are obtained. As we have witnessed in recent years, studying some degenerate versions of certain special polynomials and numbers is a promising area of research that there are still many things yet to be uncovered. In the rest of this section, we are going to review some necessary known definitions and results that will be needed throughout this paper. As is well known, the ordinary Bell polynomials are given by (see [12,14,16–21]) ¥ n x(et−1) t e = ∑ Bn(x) . (1) n=0 n! When x = 1, Bn = Bn(1) are called Bell numbers. For l 2 R, the degenerate exponential function x el(t) is defined as (see [1,2,4–7,10,11]) x x l 1 el(t) = (1 + lt) , el(t) = el(t). (2) In [14], the partially degenerate Bell polynomials are defined by the generating function to be ¥ tn x(el(t)−1) e = ∑ bn,l(x) . (3) n=0 n! Note that lim bn,l(x) = Bn(x), (n ≥ 0). When x = 1, bn,l = bn,l(1) are called degenerate Bell l!0 numbers. It is well known that the Stirling polynomials of the second kind are defined by (see [7,13]) n n (x + y) = ∑ S2(n, kjx)(y)n, (n ≥ 0), (4) k=0 where (y)0 = 1, (y)n = y(y − 1)(y − 2) ··· (y − n + 1), (n ≥ 1). Mathematics 2019, 7, 1086 3 of 12 When x = 0, S2(n, k) = S2(n, kj0), (n, k ≥ 0), are called the Stirling numbers of the second kind. From Equation (4), we can easily derive the generating function for the Stirling polynomials of the second kind given by (see [3,8,9,21,22]) ¥ n 1 t k xt t (e − 1) e = ∑ S2(n, kjx) , (5) k! n=k n! where k is a nonnegative integer. Here we mention that the generating function has also played an important role in percolation theory. See the two seminal works [23,24]. For k ≥ 0, the central factorial numbers of the second kind are defined by (see [2,5,13,21,25]) ¥ n 1 t − t k t e 2 − e 2 = ∑ T(n, k) . (6) k! n=k n! In [7], Kim considered the degenerate Stirling polynomials of the second kind given by ¥ n 1 k x t el(t) − 1) el(t) = ∑ S2,l(n, kjx) . (7) k! n=k n! When x = 0, S2,l = S2,l(n, kj0) are called the degenerate Stirling numbers of the second kind. In view of Equation (6), the degenerate central factorial numbers of the second kind are given by (see [5]) 1 1 − 1 ¥ tn 2 ( ) − 2 ( )k = ( ) el t el t ∑ T2,l n, k . (8) k! n=k n! Note that lim T2,l(n, k) = T(n, k), (n, k ≥ 0). l!0 From Equations (1) and (5), we easily note that (see [21]) ¥ n n −x m m m Bn(x) = e ∑ x = ∑ x S2(n, m), (n ≥ 0). (9) m=0 m! m=0 For n ≥ 0, the Stirling numbers of the first kind are defined as (see [21]) n k (x)n = ∑ S1(n, k)x . (10) k=0 Thus, by Equation (10), we easily get (see [21]) ¥ n 1 k t log(1 + t) = ∑ S1(n, k) , (11) k! n=k n! where k is a nonnegative integer. It is easy to see that n n x = ∑ S1(n, k)Bk(x), (k ≥ 0). (12) k=0 From Equation (2), we can derive the inverse function of el(t) given by 1 log (t) = (tl − 1), e log (t) = t. (13) l l l l Mathematics 2019, 7, 1086 4 of 12 By Equation (11), the degenerate Stirling numbers of the first kind are given by (see [4]) ¥ n 1 k t logl(1 + t) = ∑ S1,l(n, k) , (14) k! n=k n! where k is a nonnegative integer. Note that lim S1,l(n, k) = S1(n, k), (n, k ≥ 0). l!0 In this paper, we study the new type degenerate Bell numbers and polynomials and we give some new identities for those polynomials and numbers. 2. New Type Degenerate Bell Numbers and Polynomials For l 2 R, the falling factorial sequence is defined by (x)0,l = 1, (x)n,l = x(x − l) ··· (x − (n − 1)l), (n ≥ 1). From Equation (3), we note that ¥ ¥ n n xt 1 m t e = ∑ bm,l(x) logl(1 + t) = ∑ ∑ bm,l(x)S1,l(n, m) . m=0 m! n=0 m=0 n! Thus, we have n n x = ∑ bm,l(x)S1,l(n, m), (n ≥ 0). (15) m=0 On the other hand, ¥ ¥ n n 1 m t x(el(t)−1) m m e = ∑ x el(t) − 1 = ∑ ∑ x S2,l(n, m) . (16) m=0 m! n=0 m=0 n! By Equations (3) and (16), we get n ¥ m −x m (m)n,l bn,l(x) = ∑ x S2,l(n, m) = e ∑ x , (n ≥ 0). (17) m=0 m=0 m! Indeed, from Equation (3), we have ¥ tn ¥ 1 −x xel(t) −x m m ∑ bn,l(x) = e e = e ∑ x el (t) n=0 n! m=0 m! ¥ −x 1 m m = e ∑ x (1 + lt) l m=0 m! ¥ ¥ n −x 1 m t = e ∑ x ∑ (m)n,l m=0 m! n=0 n! ¥ ¥ (m) tn = ∑ e−x ∑ xm n,l .
Load more

Recommended publications
  • New Bell–Sheffer Polynomial Sets
    axioms Article New Bell–Sheffer Polynomial Sets Pierpaolo Natalini 1,* and Paolo Emilio Ricci 2 1 Dipartimento di Matematica e Fisica, Università degli Studi Roma Tre, Largo San Leonardo Murialdo, 1, 00146 Roma, Italy 2 Sezione di Matematica, International Telematic University UniNettuno, Corso Vittorio Emanuele II, 39, 00186 Roma, Italy; [email protected] * Correspondence: [email protected] Received: 20 July 2018; Accepted: 2 October 2018; Published: 8 October 2018 Abstract: In recent papers, new sets of Sheffer and Brenke polynomials based on higher order Bell numbers, and several integer sequences related to them, have been studied. The method used in previous articles, and even in the present one, traces back to preceding results by Dattoli and Ben Cheikh on the monomiality principle, showing the possibility to derive explicitly the main properties of Sheffer polynomial families starting from the basic elements of their generating functions. The introduction of iterated exponential and logarithmic functions allows to construct new sets of Bell–Sheffer polynomials which exhibit an iterative character of the obtained shift operators and differential equations. In this context, it is possible, for every integer r, to define polynomials of higher type, which are linked to the higher order Bell-exponential and logarithmic numbers introduced in preceding papers. Connections with integer sequences appearing in Combinatorial analysis are also mentioned. Naturally, the considered technique can also be used in similar frameworks, where the iteration of exponential and logarithmic functions appear. Keywords: Sheffer polynomials; generating functions; monomiality principle; shift operators; combinatorial analysis 1. Introduction In recent articles [1,2], new sets of Sheffer [3] and Brenke [4] polynomials, based on higher order Bell numbers [2,5–7], have been studied.
    [Show full text]
  • Bell Polynomials and Binomial Type Sequences Miloud Mihoubi
    CORE Metadata, citation and similar papers at core.ac.uk Provided by Elsevier - Publisher Connector Discrete Mathematics 308 (2008) 2450–2459 www.elsevier.com/locate/disc Bell polynomials and binomial type sequences Miloud Mihoubi U.S.T.H.B., Faculty of Mathematics, Operational Research, B.P. 32, El-Alia, 16111, Algiers, Algeria Received 3 March 2007; received in revised form 30 April 2007; accepted 10 May 2007 Available online 25 May 2007 Abstract This paper concerns the study of the Bell polynomials and the binomial type sequences. We mainly establish some relations tied to these important concepts. Furthermore, these obtained results are exploited to deduce some interesting relations concerning the Bell polynomials which enable us to obtain some new identities for the Bell polynomials. Our results are illustrated by some comprehensive examples. © 2007 Elsevier B.V. All rights reserved. Keywords: Bell polynomials; Binomial type sequences; Generating function 1. Introduction The Bell polynomials extensively studied by Bell [3] appear as a standard mathematical tool and arise in combina- torial analysis [12]. Moreover, they have been considered as important combinatorial tools [11] and applied in many different frameworks from, we can particularly quote : the evaluation of some integrals and alterning sums [6,10]; the internal relations for the orthogonal invariants of a positive compact operator [5]; the Blissard problem [12, p. 46]; the Newton sum rules for the zeros of polynomials [9]; the recurrence relations for a class of Freud-type polynomials [4] and many others subjects. This large application of the Bell polynomials gives a motivation to develop this mathematical tool.
    [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]
  • 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]
  • Moments of Partitions and Derivatives of Higher Order
    Moments of Partitions and Derivatives of Higher Order Shaul Zemel November 24, 2020 Abstract We define moments of partitions of integers, and show that they appear in higher order derivatives of certain combinations of functions. Introduction and Statement of the Main Result Changes of coordinates grew, through the history of mathematics, from a pow- erful computational tool to the underlying object behind the modern definition of many objects in various branches of mathematics, like differentiable mani- folds or Riemann surfaces. With the change of coordinates, all the objects that depend on these coordinates change their form, and one would like to investi- gate their behavior. For functions of one variable, like holomorphic functions on Riemann surfaces, this is very easy, but one may ask what happens to the derivatives of functions under this operation. The answer is described by the well-known formula of Fa`adi Bruno for the derivative of any order of a com- posite function. For the history of this formula, as well as a discussion of the relevant references, see [J]. For phrasing Fa`adi Bruno’s formula, we recall that a partition λ of some integer n, denoted by λ ⊢ n, is defined to be a finite sequence of positive integers, say al with 1 ≤ l ≤ L, written in decreasing order, whose sum is n. The number L is called the length of λ and is denoted by ℓ(λ), and given a partition λ, the arXiv:1912.13098v2 [math.CO] 22 Nov 2020 number n for which λ ⊢ n is denoted by |λ|. Another method for representing partitions, which will be more useful for our purposes, is by the multiplicities mi with i ≥ 1, which are defined by mi = {1 ≤ l ≤ L|al = i} , with mi ≥ 0 for every i ≥ 1 and such that only finitely many multiplicities are non-zero.
    [Show full text]
  • 1. Introduction Multivariate Partial Bell Polynomials (Bell Polynomials for Short) Have Been DeNed by E.T
    Séminaire Lotharingien de Combinatoire 75 (2017), Article B75h WORD BELL POLYNOMIALS AMMAR ABOUDy, JEAN-PAUL BULTEL{, ALI CHOURIAz, JEAN-GABRIEL LUQUEz, AND OLIVIER MALLETz Abstract. Multivariate partial Bell polynomials have been dened by E.T. Bell in 1934. These polynomials have numerous applications in Combinatorics, Analysis, Alge- bra, Probabilities, etc. Many of the formulas on Bell polynomials involve combinatorial objects (set partitions, set partitions into lists, permutations, etc.). So it seems natural to investigate analogous formulas in some combinatorial Hopf algebras with bases indexed by these objects. In this paper we investigate the connections between Bell polynomials and several combinatorial Hopf algebras: the Hopf algebra of symmetric functions, the Faà di Bruno algebra, the Hopf algebra of word symmetric functions, etc. We show that Bell polynomials can be dened in all these algebras, and we give analogs of classical results. To this aim, we construct and study a family of combinatorial Hopf algebras whose bases are indexed by colored set partitions. 1. Introduction Multivariate partial Bell polynomials (Bell polynomials for short) have been dened by E.T. Bell in [1] in 1934. But their name is due to Riordan [29], who studied the Faà di Bruno formula [11, 12] allowing one to write the nth derivative of a composition f ◦ g in terms of the derivatives of f and g [28]. The applications of Bell polynomials in Combinatorics, Analysis, Algebra, Probability Theory, etc. are so numerous that it would take too long to exhaustively list them here. Let us give only a few seminal examples. • The main applications to Probability Theory are based on the fact that the nth moment of a probability distribution is a complete Bell polynomial of the cumu- lants.
    [Show full text]
  • SEVERAL CLOSED and DETERMINANTAL FORMS for CONVOLVED FIBONACCI NUMBERS Contents 1. Background and Motivations 1 2. Lemmas 2 3. M
    SEVERAL CLOSED AND DETERMINANTAL FORMS FOR CONVOLVED FIBONACCI NUMBERS MUHAMMET CIHAT DAGLI˘ AND FENG QI Abstract. In the paper, with the aid of the Fa`adi Bruno formula, some properties of the Bell polynomials of the second kind, and a general derivative formula for a ratio of two differentiable functions, the authors establish several closed and determinantal forms for convolved Fibonacci numbers. Contents 1. Background and motivations 1 2. Lemmas 2 3. Main results 4 References 8 1. Background and motivations The Fibonacci numbers Fn are defined by the recurrence relation Fn = Fn−1 + Fn−2 for n ≥ 2 subject to initial values F0 = 0 and F1 = 1. All the Fibonacci numbers Fn for n ≥ 1 can be generated by 1 1 X = F tn = 1 + t + 2t2 + 3t3 + 5t4 + 8t5 + ··· 1 − t − t2 n+1 n=0 Numerous types of generalizations of these numbers have been offered in the liter- ature and they have a plenty of interesting properties and applications to almost every field of science and art. For more information, please refer to [11, 18, 32] and closely related references therein. For r 2 R, convolved Fibonacci numbers Fn(r) can be defined by 1 1 X = F (r)tn: (1) (1 − t − t2)r n+1 n=0 See [1, 2, 6, 14, 19] and closely related references therein. It is easy to see that Fn(1) = Fn for n ≥ 1. Convolved Fibonacci numbers Fn(r) for n 2 N and their generalizations have been considered in the papers [8, 10, 12, 14, 19, 37, 38, 39] 2010 Mathematics Subject Classification.
    [Show full text]
  • The Girard–Waring Power Sum Formulas for Symmetric Functions
    THE GIRARD-WARING POWER SUM FORMULAS FOR SYMMETRIC FUNCTIONS AND FIBONACCI SEQUENCES Henry W. Gould Dept. of Mathematics, West Virginia University, PO Box 6310, Morgantown, WV 26506-6310 email: [email protected] (Submitted May 1997) Dedicated to Professor Leonard Carlitz on his 90th birthday. The very widely-known identity 0<k<n/2 rl K\ J which appears frequently in papers about Fibonacci numbers, and the formula of Carlitz [4], [5], X ( - i y — ^ % ^ (2) summed over all 0 < j , j , k < n, n > 0, and where xyz = 1, as well as the formula where xy+jz + zx = 03 are special cases of an older well-known formula for sums of powers of roots of a polynomial which was evidently first found by Girard [12] in 1629, and later given by Waring in 1762 [29], 1770 and 1782 [30]. These may be derived from formulas due to Sir Isaac Newton., The formulas of Newton, Girard, and Waring do not seem to be as well known to current writers as they should be, and this is the motivation for our remarks: to make the older results more accessible. Our paper was motivated while refereeing a paper [32] that calls formula (1) the "Kummer formula" (who came into the matter very late) and offers formula (3) as a generalization of (1), but with no account of the extensive history of symmetric functions. The Girard-Waring formula may be derived from what are called Newton's formulas. These appear in classical books on the "Theory of Equations." For example, see Dickson [9, pp.
    [Show full text]
  • Extended Central Factorial Polynomials of the Second Kind Taekyun Kim1,Daesankim2,Gwan-Woojang1 and Jongkyum Kwon3*
    Kim et al. Advances in Difference Equations (2019)2019:24 https://doi.org/10.1186/s13662-019-1963-1 R E S E A R C H Open Access Extended central factorial polynomials of the second kind Taekyun Kim1,DaeSanKim2,Gwan-WooJang1 and Jongkyum Kwon3* *Correspondence: [email protected] Abstract 3Department of Mathematics Education and ERI, Gyeongsang In this paper, we consider the extended central factorial polynomials and numbers of National University, Jinju, Republic the second kind, and investigate some properties and identities for these polynomials of Korea and numbers. In addition, we give some relations between those polynomials and Full list of author information is available at the end of the article the extended central Bell polynomials. Finally, we present some applications of our results to moments of Poisson distributions. MSC: 11B75; 11B83 Keywords: Extended central factorial polynomials of the second kind; Extended central Bell polynomials 1 Introduction For n ≥ 0, the central factorial numbers of the second kind are defined by n xn = T(n, k)x[k], n ≥ 0, (see [1, 2, 20–22]), (1.1) k=0 [k] k k ··· k ≥ [0] where x = x(x + 2 –1)(x + 2 –2) (x – 2 +1),k 1, x =1. By (1.1), we see that the generating function of the central factorial numbers of the sec- ond kind is given by ∞ n 1 t t k t e 2 – e– 2 = T(n, k) (see [1–4, 21]). (1.2) k! n! n=k Here the definition of T(n, k)isextendedsothatT(n, k)=0forn < k.Thisagreementwill be applied to all similar situations without further mention.
    [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]
  • 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]
  • 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]