DOCSLIB.ORG

MATH 802: ENUMERATIVE COMBINATORICS ASSIGNMENT 2 Facts Recall That, the Stirling Number S(K, N) of the Second Kind Is Defined As

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
MATH 802: ENUMERATIVE COMBINATORICS ASSIGNMENT 2 Facts Recall That, the Stirling Number S(K, N) of the Second Kind Is Defined As MATH 802: ENUMERATIVE COMBINATORICS ASSIGNMENT 2 KANNAPPAN SAMPATH Facts Recall that, the Stirling number S(k; n) of the second kind is defined as the number of partitions of a [k] into n non-empty blocks. We recall the following result from class: Lemma 0.1. The following numbers are equal: (1) The number of surjective maps from [k] to [n]. (2) PS(k; n)n! where( ) S(k; n) denotes the Stirling number of the second kind. n − i n − k (3) i=0( 1) i (n i) . Proof. (1) = (2): Given a partition of [k] into n blocks, one may define a surjective map by mapping distinct parts to distinct numbers between 1 and n. There are n! such surjections. (1) = (3): (Principle of Inclusion and Exclusion.) Let Ai denote the set of maps f :[k] ! [n] such that i2 = Im(f). Then, it follows that the number of surjective ! maps [k] [n] is given by [k [k] n [n] Ai : i=1 Applying the principle of inclusion-exclusion, we conclude: [k X [k] n − jIj [n] Ai = ( 1) AI i=1 I⊆[k] ( ) Xn n = (−1)i (n − i)k: i i=0 This completes the proof. □ Problems Problem 1. Let S(n; k) be the number of ways of partitioning an n(-set) into k n−1 − − n blocks. Prove that S(n; 1) = 1, S(n; 2) = 2 1 and S(n; n 1) = 2 , Find a formula for S(n; n − 2). Solution. Proof that S(n; 1) = 1: There is exactly one partition of an n-set which consists of just one block, viz, [n]. So, S(n; 1) = 1. 1 2 KANNAPPAN SAMPATH Proof that S(n; 2) = 2n−1 − 1: Let Σ(n; 2) denote the set of all partitions of [n] into 2 parts (so` that jΣ(n; 2)j = S(n; 2)). Note that any element of Σ(n; 2) is of the form A Ac for a subset A of [n] such that A =6 ? =6 Ac. Consider the map: ϕ : 2[n] n f?; [n]g ! Σ(n; k) a A 7! A Ac Then, this map is clearly surjective and is 2-to-1, indeed ϕ(A) = ϕ(Ac). Thus, 2jΣ(n; k)j = j2[n] n f?; [n]gj = 2n − 2 − whence we have S((n;)2) = 2n 1 − 1 as required. − n − Proof that S(n; n 1) = 2 : Let Σ(n; n 1) denote the set of all partitions of [n] into n−1 parts (so that jΣ(n; n−`1)j =`S(n;` n−1)). Note that any element of Σ(n; n − 1) is of the form A1 A2 ··· An−1 where Ai is non-empty for every i. For a fixed partition of the above form, let ai = jAij. Then, we have that ai > 1 and nX−1 ai = n: i=1 If there are atleast two indices, say i; j such that ai; aj > 2, then, we have that nX−1 n = ai > 2 + 2 + (n − 1) − 2 = n + 1 i=1 a contradiction. On the other hand, if ai = 1 for all i, then, we get the absurd equation n = n − 1. Thus, there is precisely one index i such that ai = 2 and aj = 1 for all j =6 i. We may let i = n − 1 without loss of generality. (This is an elaboration of the Pigeonhole principle.) The above consideration shows that an element of Σ(n; n − 1) is deter- mined by the 2-set An−1. Conversely, every 2-subset T of [n] determines a partition of [n] into n − 1 blocks: a a [n] = fag T: a=2T ( ) − n This shows that S(n; n 1) = 2 (the number of 2-subsets of [n]). Formula for S(n; n − 2): In this part, we argue as in the previous part, but some- what more systematically. Let kc denote the number of blocks with car- dinality c in a given partition of [n] into n − 2 blocks. Then, we have the equation: X X X (n − 2) − kc + ckc = n =) (c − 1)kc = 2: c>2 c>2 c>2 This equation shows that if kc > 0, then c 6 3. Further it follows that k2 = 2; k3 = 0 or k2 = 0; k3 = 1. The number of partitions of [n] into n(−)(2 blocks) consisting of two blocks 1 n n−2 of size 2 (and other blocks singleton) is 2 2 2 . The number of partitions of [n] into n −( )2 blocks consisting of one block of size 3 (and other blocks n singleton) is 3 . MATH 802: ENUMERATIVE COMBINATORICS ASSIGNMENT 2 3 Based on the above analysis, it follows that ( ) ( )( ) n 1 n n − 2 n(n − 1)(n − 2)(3n − 5) S(n; n − 2) = + = : 3 2 2 2 24 This completes this problem. □ Remark 0.2. Another way to approach the above problem would be through re- currence established for Stirling numbers S(n; k) of the second kind. Recall from class that S(n; k) = S(n − 1; k − 1) + kS(n − 1; k) Set an = S(n; n − 2); we know that a3 = S(3; 1) = 1. On taking k = n − 2 in the above recurrence relation, we have ( ) n − 1 a = a − + (n − 2) n n 1 2 using the previous calculation. Rearranging the above equality and summing from n = 4 to k gives us: Xk ak − 1 = (an − an−1) n=4 Xk (n − 1)(n − 2)2 = 2 n=4 Making a change of variable in the above sum: − kX2 n2(n + 1) = 2 n=2 − 1 kX2 = n3 + n2 2 n=2 Using the known formulae: ( ) 1 (k − 2)2(k − 1)2 (k − 2)(k − 1)(2k − 3) = − 1 + − 1 2 4 6 ( ) (k − 1)(k − 2) (k − 2)(k − 1) 2k − 3 a = + k 4 2 3 k(k − 1)(k − 2)(3k − 5) = 24 This also proves the expression we computed for S(n; n − 2) above. Problem 2. Let fn and gn be two sequences with exponential generating functions 1 1 X f tn X g tn F (t) = n ;G(t) = n : n! n! n=0 n=0 Show that the following are equivalent: (a) ( ) Xn n g = f ; n k k k=0 4 KANNAPPAN SAMPATH (b) G(t) = F (t)et: Proof. Since an exponential generating function uniquely determines the sequence and conversely, the equivalence is immediate in view of the following calculation: ( ) Xn n g = f n k k k=0 1 ( ) X tn Xn n () G(t) = f n! k k n=0 k=0 1 X tn Xn n! () G(t) = f n! k!(n − k)! k n=0 k=0 Interchanging the order of summation: 1 1 X tk X tn−k () G(t) = f k! k (n − k)! k=0 n=k Making the change of variable n − k = u in the inner sum: 1 1 X tk X tu () G(t) = f k! k u! k=0 u=0 () G(t) = F (t)et This finishes the proof. □ Problem 3. Let dn be the number of derangements of an n-element set (that is, the number of elements of Sn without any fixed points). Show that n dn = ndn−1 + (−1) Deduce that dn is odd if and only if n is even. Proof. We have shown in class that dn satisfies the following recurrence: dn = (n − 1)(dn−1 + dn−2); for n > 1 d0 = 1; d1 = 0: Substracting ndn−1, the relation becomes: dn − ndn−1 = −(dn−1 − (n − 1)dn−2) Setting cn = dn − ndn−1, we see that cn = −cn−1 with c1 = −1. Thus, it follows n immediately that cn = (−1) which proves the relation required. n Now, the final parity argument is easy: if n is even, then, dn ≡ (−1) = 1 mod 2, so dn is odd. On the other hand, if n is odd, then, dn is even since n − 1 is even and we have just shown that dn−1 is odd; using the fact that dn = ndn−1 − 1, we have that dn is even. This finishes the problem. □ Problem 4. The Bernoulli numbers bn are defined by the recurrence b0 = 1 and ( ) Xn n + 1 b = 0 k k k=0 MATH 802: ENUMERATIVE COMBINATORICS ASSIGNMENT 2 5 for n > 1. Prove that 1 X b t f(t) := n tn = : n! et − 1 n=0 Proof. From the given recurrence, we have − ( ) 1 nX1 n + 1 b = − b n n + 1 k k k=0 for n > 0. Now, we compute the function f(t) as follows: 1 X b tn f(t) = n n! n=0 1 − ( ) X tn nX1 n + 1 = 1 − b (n + 1)! k k n=1 k=0 1 − X nX1 1 = 1 − tn b k!(n + 1 − k)! k n=1 k=0 Put m = n − 1: 1 X Xm 1 = 1 − tm+1 b k!(m + 2 − k)! k m=0 k=0 Interchanging the order of summation, we have: 1 1 X X tm+1 = 1 − b k!(m + 2 − k)! k k=0 m=k Put v = m − k + 2 to get: 1 1 X X tv+k−1 = 1 − b k!v! k k=0 v=2 1 1 X tk−1b X tv = 1 − k k! v! k=0 v=2 f(t)(et − t − 1) f(t) = 1 − t t f(t) = : et − 1 This finishes the proof. □ Problem 5. In the previous question, show that t f(t) + 2 is an even function of t (that is, it is invariant under the map t 7! −t).
Load more

Recommended publications
  • Asymptotic Estimates of Stirling Numbers
    Asymptotic Estimates of Stirling Numbers By N. M. Temme New asymptotic estimates are given of the Stirling numbers s~mJ and (S)~ml, of first and second kind, respectively, as n tends to infinity. The approxima­ tions are uniformly valid with respect to the second parameter m. 1. Introduction The Stirling numbers of the first and second kind, denoted by s~ml and (S~~m>, respectively, are defined through the generating functions n x(x-l)···(x-n+l) = [. S~m)Xm, ( 1.1) m= 0 n L @~mlx(x -1) ··· (x - m + 1), ( 1.2) m= 0 where the left-hand side of (1.1) has the value 1 if n = 0; similarly, for the factors in the right-hand side of (1.2) if m = 0. This gives the 'boundary values' Furthermore, it is convenient to agree on s~ml = @~ml= 0 if m > n. The Stirling numbers are integers; apart from the above mentioned zero values, the numbers of the second kind are positive; those of the first kind have the sign of ( - l)n + m. Address for correspondence: Professor N. M. Temme, CWI, P.O. Box 4079, 1009 AB Amsterdam, The Netherlands. e-mail: [email protected]. STUDIES IN APPLIED MATHEMATICS 89:233-243 (1993) 233 Copyright © 1993 by the Massachusetts Institute of Technology Published by Elsevier Science Publishing Co., Inc. 0022-2526 /93 /$6.00 234 N. M. Temme Alternative generating functions are [ln(x+1)r :x n " s(ln)~ ( 1.3) m! £..,, n n!' n=m ( 1.4) The Stirling numbers play an important role in difference calculus, combina­ torics, and probability theory.
    [Show full text]
  • A Unified Approach to Generalized Stirling Numbers
    ADVANCES IN APPLIED MATHEMATICS 20, 366]384Ž. 1998 ARTICLE NO. AM980586 A Unified Approach to Generalized Stirling Numbers Leetsch C. Hsu Institute of Mathematics, Dalian Uni¨ersity of Technology, Dalian 116024, China View metadata, citation and similar papers at core.ac.ukand brought to you by CORE provided by Elsevier - Publisher Connector Peter Jau-Shyong Shiue Department of Mathematical Sciences, Uni¨ersity of Ne¨ada, Las Vegas, Las Vegas, Ne¨ada 89154-4020 Received January 1, 1995; accepted January 3, 1998 It is shown that various well-known generalizations of Stirling numbers of the first and second kinds can be unified by starting with transformations between generalized factorials involving three arbitrary parameters. Previous extensions of Stirling numbers due to Riordan, Carlitz, Howard, Charalambides-Koutras, Gould-Hopper, Tsylova, and others are included as particular cases of our unified treatment. We have also investigated some basic properties related to our general pattern. Q 1998 Academic Press 1. INTRODUCTION As may be observed, a natural approach to generalizing Stirling numbers is to define Stirling number pairs as connection coefficients of linear transformations between generalized factorials. Of course, any useful generalization should directly imply some interesting special cases that have certain applications. The whole approach adopted in this paper is entirely different from that of Hsu and Yuwx 13 , starting with generating functions, and various new results are provided by a unified treatment. A recent paperwx 24 of TheoretÂÃ investigated some generating functions for the solutions of a type of linear partial difference equation with first-degree polynomial coefficients. Theoretically, it also provides a way of 366 0196-8858r98 $25.00 Copyright Q 1998 by Academic Press All rights of reproduction in any form reserved.
    [Show full text]
  • Expression and Computation of Generalized Stirling Numbers
    Expression and Computation of Generalized Stirling Numbers Tian-Xiao He Department of Mathematics and Computer Science Illinois Wesleyan University Bloomington, IL 61702-2900, USA August 2, 2012 Abstract Here presented is a unified expression of Stirling numbers and their generalizations by using generalized factorial functions and general- ized divided difference. Three algorithms for calculating the Stirling numbers and their generalizations based on our unified form are also given, which include a comprehensive algorithm using the character- ization of Riordan arrays. AMS Subject Classification: 05A15, 65B10, 33C45, 39A70, 41A80. Key Words and Phrases: Stirling numbers of the first kind, Stir- ling numbers of the second kind, factorial polynomials, generalized factorial, divided difference, k-Gamma functions, Pochhammer sym- bol and k-Pochhammer symbol. 1 Introduction The classical Stirling numbers of the first kind and the second kind, denoted by s(n; k) and S(n; k), respectively, can be defined via a pair of inverse relations n n X k n X [z]n = s(n; k)z ; z = S(n; k)[z]k; (1.1) k=0 k=0 with the convention s(n; 0) = S(n; 0) = δn;0, the Kronecker symbol, where z 2 C, n 2 N0 = N [ f0g, and the falling factorial polynomials [z]n = 1 2 T. X. He z(z − 1) ··· (z − n + 1). js(n; k)j presents the number of permutations of n elements with k disjoint cycles while S(n; k) gives the number of ways to partition n elements into k nonempty subsets. The simplest way to compute s(n; k) is finding the coefficients of the expansion of [z]n.
    [Show full text]
  • A Generalization of Stirling Numbers of the Second Kind Via a Special Multiset
    1 2 Journal of Integer Sequences, Vol. 13 (2010), 3 Article 10.2.5 47 6 23 11 A Generalization of Stirling Numbers of the Second Kind via a Special Multiset Martin Griffiths School of Education (Mathematics) University of Manchester Manchester M13 9PL United Kingdom [email protected] Istv´an Mez˝o Department of Applied Mathematics and Probability Theory Faculty of Informatics University of Debrecen H-4010 Debrecen P. O. Box 12 Hungary [email protected] Abstract Stirling numbers of the second kind and Bell numbers are intimately linked through the roles they play in enumerating partitions of n-sets. In a previous article we studied a generalization of the Bell numbers that arose on analyzing partitions of a special multiset. It is only natural, therefore, next to examine the corresponding situation for Stirling numbers of the second kind. In this paper we derive generating functions, formulae and interesting properties of these numbers. 1 Introduction In [6] we studied the enumeration of partitions of a particular family of multisets. Whereas all the n elements of a finite set are distinguishable, the elements of a multiset are allowed to 1 possess multiplicities greater than 1. A multiset may therefore be regarded as a generalization of a set. Indeed, a set is a multiset in which each of the elements has multiplicity 1. The enumeration of partitions of the special multisets we considered gave rise to families of numbers that we termed generalized near-Bell numbers. In this follow-up paper we study the corresponding generalization of Stirling numbers of the second kind.
    [Show full text]
  • Degenerate Stirling Polynomials of the Second Kind and Some Applications
    S S symmetry Article Degenerate Stirling Polynomials of the Second Kind and Some Applications Taekyun Kim 1,*, Dae San Kim 2,*, Han Young Kim 1 and Jongkyum Kwon 3,* 1 Department of Mathematics, Kwangwoon University, Seoul 139-701, Korea 2 Department of Mathematics, Sogang University, Seoul 121-742, Korea 3 Department of Mathematics Education and ERI, Gyeongsang National University, Jinju 52828, Korea * Correspondence: [email protected] (T.K.); [email protected] (D.S.K.); [email protected] (J.K.) Received: 20 July 2019; Accepted: 13 August 2019; Published: 14 August 2019 Abstract: Recently, the degenerate l-Stirling polynomials of the second kind were introduced and investigated for their properties and relations. In this paper, we continue to study the degenerate l-Stirling polynomials as well as the r-truncated degenerate l-Stirling polynomials of the second kind which are derived from generating functions and Newton’s formula. We derive recurrence relations and various expressions for them. Regarding applications, we show that both the degenerate l-Stirling polynomials of the second and the r-truncated degenerate l-Stirling polynomials of the second kind appear in the expressions of the probability distributions of appropriate random variables. Keywords: degenerate l-Stirling polynomials of the second kind; r-truncated degenerate l-Stirling polynomials of the second kind; probability distribution 1. Introduction For n ≥ 0, the Stirling numbers of the second kind are defined as (see [1–26]) n n x = ∑ S2(n, k)(x)k, (1) k=0 where (x)0 = 1, (x)n = x(x − 1) ··· (x − n + 1), (n ≥ 1).
    [Show full text]
  • Sets of Iterated Partitions and the Bell Iterated Exponential Integers
    Sets of iterated Partitions and the Bell iterated Exponential Integers Ivar Henning Skau University of South-Eastern Norway 3800 Bø, Telemark [email protected] Kai Forsberg Kristensen University of South-Eastern Norway 3918 Porsgrunn, Telemark [email protected] March 21, 2019 Abstract It is well known that the Bell numbers represent the total number of partitions of an n-set. Similarly, the Stirling numbers of the second kind, represent the number of k-partitions of an n-set. In this paper we introduce a certain partitioning process that gives rise to a sequence of sets of ”nested” partitions. We prove that at stage m, the cardinality of the resulting set will equal the m-th order Bell number. This set- theoretic interpretation enables us to make a natural definition of higher order Stirling numbers and to study the combinatorics of these entities. The cardinality of the elements of the constructed ”hyper partition” sets are explored. 1 A partitioning process. arXiv:1903.08379v1 [math.CO] 20 Mar 2019 (1) Consider the 3-set S = {a,b,c}. The partition set ℘3 of S, where the elements of S are put into boxes, contains the five partitions shown in the second column of Figure 1. Now we proceed, putting boxes into boxes. This means that we create a second (1) order partition set to each first order partition in ℘3 . The union of all the (2) second order partition sets is denoted by ℘3 , and appears in the third column of Figure 1. 1 (0) (1) (2) S = ℘3 ℘3 ℘3 { abc {a,b,c} { abc , , c ab c ab c ab , , , ac ac b ac b b , , , a bc a bc a bc , , , a c a b c a b c b } , , a c b b c a a b c , , } (1) (2) Figure 1: The basic set S together with the partition sets ℘3 and ℘3 (1) (m) Definition.
    [Show full text]
  • Multiple Stirling Number Identities
    Multiple Stirling Number Identities H. Coskun Department of Mathematics, Texas A&M University{Commerce, Binnion Hall, Room 314, Commerce, TX 75429 Abstract A remarkable multiple analogue of the Stirling numbers of the first and sec- ond kind was recently constructed by the author. Certain summation iden- tities, and related properties of this family of multiple special numbers are investigated in the present paper. Keywords: multiple binomial coefficients, multiple special numbers, qt-Stirling numbers, well-poised symmetric rational Macdonald functions 2000 MSC: 05A10, 11B65, 33D67 1. Introduction The Stirling numbers of the first and second kind are studied and their properties are investigated extensively in number theory and combinatorics. One dimensional generalizations of these numbers have also been subject of interest. An important class of generalizations is their one parameter q- extensions. Many have made significant contributions to such q-extensions investigating their properties and applications. We will give references to some of these important work in Section 3 below. In a recent paper, the author took a major step and constructed an el- egant multiple qt-generalization of Stirling numbers of the first and second kind, besides sequences of other special numbers including multiple bino- mial, Fibonacci, Bernoulli, Catalan, and Bell numbers [16]. In this paper, we focus on multiple Stirling numbers of both kinds, and give interesting new identities satisfied by them. Email address: [email protected] (H. Coskun) URL: http://faculty.tamuc.edu/hcoskun (H. Coskun) Preprint submitted to American Journal of Mathematics The multiple generalizations developed in [16] are given in terms of the qt-binomial coefficients constructed in the same paper.
    [Show full text]
  • Some Identities Involving Second Kind Stirling Numbers of Types B and D∗
    Some identities involving second kind Stirling numbers of types B and D∗ Eli Bagno Riccardo Biagioli Jerusalem College of Technology Institut Camille Jordan, 21 HaVaad HaLeumi St., Universit´eClaude Bernard Lyon 1 Jerusalem, Israel 69622 Villeurbanne Cedex, France [email protected] [email protected] David Garber Department of Applied Mathematics, Holon Institute of Technology, 52 Golomb St., PO Box 305, 58102 Holon, Israel, and (sabbatical:) Einstein Institute of Mathematics, Hebrew University of Jerusalem, Jerusalem, Israel [email protected] Submitted: Apr 30, 2019; Accepted: Jun 20, 2019; Published: Jul 5, 2019 c The authors. Released under the CC BY-ND license (International 4.0). Abstract Using Reiner's definition of Stirling numbers of the second kind in types B and D, we generalize two well-known identities concerning the classical Stirling numbers of the second kind. The first identity relates them with Eulerian numbers and the second identity interprets them as entries in a transition matrix between the elements of two standard bases of the polynomial ring R[x]. Finally, we generalize these identities to the group of colored permutations Gm;n. Mathematics Subject Classifications: Primary: 05A18, Secondary: 11B73, 20F55 1 Introduction The Stirling number of the second kind, denoted S(n; k), is defined as the number of par- titions of the set [n] := f1; : : : ; ng into k non-empty subsets (see [20, page 81]). Stirling numbers of the second kind arise in a variety of problems in enumerative combinatorics; ∗This research was supported by a grant from the Ministry of Science and Technology, Israel, and the France's Centre National pour la Recherche Scientifique (CNRS) the electronic journal of combinatorics 26(3) (2019), #P3.9 1 they have many combinatorial interpretations, and have been generalized in various con- texts and in different ways.
    [Show full text]
  • Computation of Stirling Numbers and Generalizations
    Computation of Stirling numbers and generalizations S. Ilie D. J. Jeffrey R. M. Corless X. Zhang Dept. Mathematics, Dept. Applied Mathematics Dept. Applied Mathematics Dept. Applied Mathematics Ryerson University Western University · Canada Western University · Canada Western University · Canada [email protected] [email protected] [email protected] [email protected] 0 Abstract—We consider the computation of Stirling numbers proposal leaves the value of 0 undecided, and we discuss and generalizations for positive and negative arguments. We possible values here. describe computational schemes for Stirling Partition and Stir- ling Cycle numbers, and for their generalizations to associated II. DEFINITIONS AND PROPERTIES FOR r = 1 Stirling numbers. The schemes use recurrence relations and are We begin with the case r = 1, which has been the traditional more efficient than the current method used in MAPLE for cycle numbers, which is based on an algebraic expansion. We also meaning given to Stirling numbers. point out that the proposed generalization of Stirling numbers Definition II.1. The Stirling partition number n is the due to Flajolet and Prodinger changes the evaluation of Stirling k partition numbers for negative arguments. They are no longer number of ways to partition a set of n objects into k nonempty zero, but become rational numbers. subsets. Definition II.2. The Stirling cycle number n is the number I. INTRODUCTION k of permutations of n objects having k cycles. Among the remarkable sequences of numbers with impor- Stirling numbers satisfy the recurrence relations tant combinatorial significance one can count the sequences n + 1 n n of Stirling numbers.
    [Show full text]
  • An Explicit Formula for Bell Numbers in Terms of Stirling Numbers and Hypergeometric Functions
    Global Journal of Mathematical Analysis, 2 (4) (2014) 243-248 °c Science Publishing Corporation www.sciencepubco.com/index.php/GJMA doi: 10.14419/gjma.v2i4.3310 Research Paper An explicit formula for Bell numbers in terms of Stirling numbers and hypergeometric functions Bai-Ni Guo1;¤ & Feng Qi2;3 1School of Mathematics and Informatics, Henan Polytechnic University, Jiaozuo City, Henan Province, 454010, China 2College of Mathematics, Inner Mongolia University for Nationalities, Tongliao City, Inner Mongolia Autonomous Region, 028043, China 3Department of Mathematics, College of Science, Tianjin Polytechnic University, Tianjin City, 300387, China ¤Corresponding author's e-mail: [email protected], [email protected] ¤Corresponding author's URL: http: // www. researchgate. net/ profile/ Bai-Ni_ Guo/ Copyright °c 2014 Bai-Ni Guo and Feng Qi. 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 the paper, by two methods, the authors ¯nd an explicit formula for computing Bell numbers in terms of Kummer confluent hypergeometric functions and Stirling numbers of the second kind. Moreover, the authors supply an alternative proof of the well-known \triangular" recurrence relation for Stirling numbers of the second kind. In a remark, the authors reveal the combinatorial interpretation of the special values for Kummer confluent hypergeo- metric functions and the total sum of Lah numbers. Keywords: explicit formula; Bell number; confluent hypergeometric function of the ¯rst kind; Stirling number of the second kind; combinatorial interpretation; alternative proof; recurrence relation; polylogarithm MSC : Primary 11B73; Secondary 33B10, 33C15 1 Introduction In combinatorics, Bell numbers, usually denoted by Bn for n 2 f0g [ N, count the number of ways a set with n elements can be partitioned into disjoint and non-empty subsets.
    [Show full text]
  • Special Numbers ITT9131 Konkreetne Matemaatika
    Special Numbers ITT9131 Konkreetne Matemaatika Chapter Six Stirling Numbers Eulerian Numbers Harmonic Numbers Harmonic Summation Bernoulli Numbers Fibonacci Numbers Continuants Contents 1 Stirling numbers Stirling numbers of the second kind Stirling numbers of the rst kind Basic Stirling number identities, for integer n > 0 Extension of Stirling numbers 2 Fibonacci Numbers Next section 1 Stirling numbers Stirling numbers of the second kind Stirling numbers of the rst kind Basic Stirling number identities, for integer n > 0 Extension of Stirling numbers 2 Fibonacci Numbers Next subsection 1 Stirling numbers Stirling numbers of the second kind Stirling numbers of the rst kind Basic Stirling number identities, for integer n > 0 Extension of Stirling numbers 2 Fibonacci Numbers Stirling numbers of the second kind Denition n The Stirling number of the second kind k , read n subset k, is the number of ways to partition a set with n elements into k non-empty subsets. Stirling numbers of the second kind Denition n The Stirling number of the second kind k , read n subset k, is the number of ways to partition a set with n elements into k non-empty subsets. Example: splitting a four-element set into two parts f1;2;3gSf4g f1;2;4gSf3g f1;3;4gSf2g f2;3;4gSf1g f1;2gSf3;4g f1;3gSf2;4g f1;4gSf2;3g 4 Hence 2 = 7 Stirling numbers of the second kind Denition n The Stirling number of the second kind k , read n subset k, is the number of ways to partition a set with n elements into k non-empty subsets.
    [Show full text]
  • Chapter 2 Generating Functions
    Chapter 2 Generating Functions Do not pray for tasks equal to your powers. Pray for powers equal to your tasks. Twenty Sermons, PHILLIPS BROOKS Generating functions provide an algebraic machinery for solving combinatorial problems. The usual algebraic operations (convolution, especially) facilitate considerably not only the computational aspects but also the thinking processes involved in finding satisfactory solutions. More often than not we remain blissfully unaware of this disinterested service, until trying to reproduce the same by direct calculations (a task usually accompanied by no insignificant mental strain). The main reason for introducing formal power series is the ability to translate key combinatorial operations into algebraic ones that are, in turn, easily and routinely performed within a set (usually an algebra) of generating functions. Generally this is much easier said than done, for it takes great skill to establish such a 1 2 CHAPTER 2. GENERATING FUNCTIONS happy interplay. Yet notable examples exist, and we examine a couple of better known ones in considerable detail. We begin by introducing the ordinary and exponential generating functions. Upon closely investigating the combinatorial meaning of the operation of convolution in these two well-known cases, we turn to specific generating functions associated with the Stirling and Lah numbers. The latter part of the chapter touches briefly upon the uses of formal power series to recurrence relations and introduces the Bell polynomials, in connection with Faa DiBruno’s formula, for explicitly computing the higher order derivatives of a composition of two functions. In ending the chapter we dote upon subjects such as Kirch- hoff’s tree generating matrix (along with applications to statistical design), partitions of an integer, and a generating function for solutions to Diophantine systems of linear equations in nonnegative integers.
    [Show full text]