Random partition of a set 2/28/01
|
|
- Myra Vivien Lane
- 6 years ago
- Views:
Transcription
1 Random partition of a set 220 A partition of the set i is a collection of disjoint nonempty sets whose union equals i. e.g. The & partitions of the set i ß#ß$ are ß #ß $ ß # ß $ ß $ ß # #ß$ ß ß # ß $ We refer to each nonempty subset making up a partition of the set i as a block. For any partition of the set i we refer to the number of blocks that have cardinality as the multiplicity of in that partition. It is well known that, the Bell Number, counts the total number of partitions of a set of elements and that Wß, the Stirling Number of the Second Kind, counts the total number of partition of a set of elements into exactly blocks. The article A Review of the Stirling Numbers, Their Generalizations and Statistical Applications, Charalambides, Ch. A.; Singh, Jagbir; Communications in Statistics, Theory and Methods, Vol. 7, No., 9, pages , is an excellent resource on both Bell and Stirling Numbers. 2 Let i be any set of (distinct) elements. If a partition of the set i is selected uniformly at random from the set of all partitions of i, we will refer to this as a random partition of i. If a partition of i is selected uniformly at random from the set of all Wß partitions of i with blocks, we will refer to this as a random partition of i with blocks. We will need the following definitions. : the infinite product space 0,, á 0,, á â : the set of all vectors s,s, á in such that = #= á # # ß : the set of all vectors s,s, # á in such that = #= # á = = á # ß ß For any T define T T and T T We note that the condition that = #= # á implies that =! for all Þ Hence all vectors in T and Tß are of the form +, á, + ß!ß!ß á Þ
2 For all T Á!ß!ßá, let be the collection of -dimensional vectors formed by taking each infinite-dimensional vector in and truncating after +ÞSo for example, T +, á, + ß!ß!ß á +, á, + Define ß similarly. For notational consistency it is necessary to separate out the case T!ß!ßá. Let \ equal the multiplicity of in a random partition of a set of elements into blocks. We can construct the set of all partitions of a set of elements into blocks such that \ B ßáß\ B in the following manner. Take any one of the x permutations of the elements and use the first B elements of that permutation to fill the first B blocks, use the next #B# elements of that permutation to fill the next B # blocks, and so on. In total we would use the B #B á B elements to fill the B B á B blocks. # # This yields x set partitions but not all of these set partitions are distinct. In particular this count would assume that rearranging the B blocks of cardinality amongst themselves leads to distinct set partitions - which they do not. Furthermore this count would assume that rearranging elements within a block leads to distinct set partitions - which they do not. Therefore it is necessary to divide the count of x by the number of ways to arrange the B blocks of cardinality amongst themselves ß á ß and by the number of ways to arrange the elements in each block. It follows that there are x â BxâBx x x B B partitions of a set of elements into block s such that \ B ßáß\ B provided B á B, B á B, and B!ßáß a and T \ ß ß\ B ß ßB! x B B B xâbx x â x Wß B áb B áb B!ßßáßa otherwise 2
3 If we let [ equal the multiplicity of in a random partition of a set of elements then it follows similarly that T [ ß ß[ A ß ßA! x A A A xâax x â x A áa A!ßßáßa otherwise Theorem... E \ ß ß\ E ) - ] ß] # ß xw ß.-.) )! where + ß+ # ßá is any function and + ßáß+ + ßáß+ ß!ß!ßáand for T Á!ß!ßá.. T \ß ß\ ß T ]ß]ß xwß ) - # á T.-.) )! where that ]ß]ßá # is an infinite sequence of independent Poisson random variables such )- )- C x x T ] C C!ßß#ßáand ß#ßá è Cx Theorem 2.. E [ ß ß[ E ] ß] # ß.- - -! where + ß+ # ßá is any function and + ßáß+ + ßáß+ ß!ß!ßáand for T Á!ß!ßá. - T [ ß ß[ T ] ß] # ßá T.- 3
4 where that ]ß]ßá # is an infinite sequence of independent Poisson random variables such - - C x x T ] C C!ßß#ßá and ß#ßá è Cx Now suppose we randomly distribute distinct objects into distinct urns such that objects are distributed independently and are equally likely to go into any of the urns. If one or more urns are still empty after this distribution we empty all of the urns and start the distribution process over. The distribution process stops as soon as we obtain a distribution of the objects where each of the urns has at least one object. Let Yß ßáß equal the number of objects in the urn after the distribution process has stopped. Then, 2 TYß ßY?ß ß?! x?xâ?xx Wß? á?? ß#ßá a else Let Zß ßáß equal the number of (labeled) urns containing objects after the distribution process has stopped. Then, TZ ß ßZ ß ß! x xâ x x â x Wß á á!ßßáß a otherwise We note that the above probability distribution is based on a model where the urns are distinguishable (labeled) but clearly the latter probability would be the same if the urns were not labeled. However distributing distinguishable objects into like (unlabeled) urns is equivalent to partitioning a set of objects into blocks. That is TZ ß ßZ T \ ß ß\ ß ß where as before the \ ßßáß equal the number of blocks with elements in a random partition of a set of elements into blocks.
5 The distinction between the two probabilities is that in the case of labeled urns there are Wß possible distributions and in the case of unlabeled urns there are only Wß possible distributions. We will need the following definitions. À the -dimensional product space,#á, â,#á, À the set of all vectors?, áß? in such that? á? ß Define h as that set such that Z ß ßZ Í Y ß ßY h. Theorem 3. d T \ ß ß\ - T ß ], á,] h xwß d- where ]ßáß] are iid zero-truncated Poisson random variables with parameter -. That is, - C - C ß #ß á Cx - T ] C è! else
6 Applications Problem. (a) Show that the number of partitions of a set of elements into blocks containing exactly blocks of cardinality equals minß x x x W ß (b) Show that the number of partitions of a set of elements containing exactly blocks of cardinality equals x x x provided Ÿ Þ (c) Show that the number of partitions of a set of elements containing at least blocks of cardinality equals x xx provided Ÿ. We note that the special case of (c) where is in agreement with Haigh, J., Random Equivalence Relations, Journal of Combinatorial Theory, Series A, Vol. 3, 972, pages Problem 2. 2 (a) Show that the factorial moment of the number of blocks containing elements in a random partition of a set of elements into blocks equals 6
7 x Wß provided Ÿ and x Wß We note that the special case where is in agreement with Proposition 2. in Recski, A., On Random Permutations, Discrete Mathematics, 6, 976, (b) As a check on the result in (a) verify that Wß. Wß 2 (c) Show that the factorial moment of the number of blocks containing elements in a random partition of a set of elements equals x provided Ÿ x We note that the special case where is in agreement with Proposition. in Recski, A., On Random Permutations, Discrete Mathematics, 6, 976, Problem 3. (a) Show that the expected number of multiplicities in a random partition of a set of elements into blocks that equal is minß x W ß x x Wß (b) Show that the expected number of multiplicities in a random partition of a set of elements that equal is minß x W ß x x 7
8 Problem. Show that the expected number of blocks in a random partition of a set with elements equals in agreement with L. H. Harper, Stirling Behavior is Asymptotically Normal, Annals of Mathematical Statistics, Vol 3, 967, pages 0-Þ Problem. (a) Suppose that a partition is picked uniformly at random from the set of Wß partitions of a set of elements into exactly blocks and from that partition a block is then picked uniformly at random. Show that the expected size of this block is (b) Suppose that a partition is picked uniformly at random from the set of partitions of a set of elements and from that partition a block is then picked uniformly at random. Show that the expected size of this block is W ß (c) Suppose that a block is picked uniformly at random from the set of all W ß blocks in the partitions of a set of elements. Show that the expected size of this block is (d) Suppose that a partition is picked uniformly at random from the set of Wß partitions of a set of elements into exactly blocks and from that partition an element is selected uniformly at random. Show that the expected size of the block containing the selected element is
9 Wß Wß (e) Suppose that a partition is picked uniformly at random from the set of partitions of a set of elements and from that partition an element is selected uniformly at random. Show that the expected size of the block containing the selected element is Problem 6. Show that the number of partitions of a set of elements into blocks where exactly < of the blocks have an even number of elements is #< < #< < # x < #!! The special case < (all blocks have an even number of elements) simplifies to # # x #! and the special case <! (all blocks have an odd number of elements) to # x #! in agreement with (2.2 and 2.2) of Set Partitions, L. Carlitz, Fibonacci Quarterly, Nov. 976, pages , apart from an obvious typo in equation 2.2. Problem 7. Suppose that a partition is picked uniformly at random from the set of 9
10 partitions of a set of elements and from that partition a block size is picked uniformly at random from the set of all block sizes in that partition. Show that the expected size of the selected block size is 0
11 Proof (Theorem ) Consider an infinite sequence ] ß] ßá # - of independent Poisson random variables where - C x x T ] C C!ß ß #ß á and ß #ß á Cx Let C be a nonnegative integer for ß #ß âþ Then T] C ß] C ßá # # x C - C C x C x C x x C and T ] ât] C ß] # C# ßá C ßC# ßá C C - x - âx x C ßC# ßá C x C - - x It follows that for T Á!ß!ßá
12 T] ß] # ßá T T] ß] # ßá T ± ] T ] Therefore!! T - - C x - x - x C - x C C# C - C xc xâc x x #x â x # - x [ [ T ß ß x x - # T] ß] ßá T T[ ß ß[ - x and <..- < - T] ß] # ßá T T[ ß ß[ <xiö< x Therefore, for T Á!ß!ßá. T[ ß ß[ T] ß] # ßá T.- - 2
13 Proof (Theorem 2) Consider an infinite sequence ]ß]ßá # )- of independent Poisson random variables where )- C x x T ] C C!ßß#ßá and ß#ßá Cx Let C be a nonnegative integer for ß#ßâÞ Then T ] Cß] Cßá # # C C )- ) - x C C x C C - ) ) - C x x x C and T ] and ] ât ] Cß] # Cßá # C ßC# ßá C C ) - )- x C x âx C ßC# ßá C x C C - )- Wß x ) It follows that 3
14 T ] ß] # ßá T T ]ß]ß # á T ± ] ß ] T ] ß ]!!!! T ß ß ) - )- )- C x Wß Cx ) - ) - x # x C C CxCxâCx x #x â C x # Wß x ) - )- Wß ) - e )- T \ ß ß\ ß Wß x x )- Wß Therefore ) - Wß T ] ß] # ßá T T \ ß ß\ ß ) - x and < =...-.) < = ) - T ] ß] # ßá T Wß T \ ß ß\ ß <x=xi < I = x )! Therefore, for T Á!ß!ßá.. T \ß ß\ ß T ]ß]ß xwß ) - # á T.-.) )!
15 Proof (Theorem 3) T \ ß ß\ ß TZ ß ßZ ß TYß ßY h But by the Zero-Truncated Poisson Randomization Theorem, d TY ß ßY h T ] ] -, á, h xwß d- where ]ßáß] are iid zero-truncated Poisson random variables with parameter -. That is, - C - C ß #ß á Cx - T ] C! else
16 Solutions Problem (a) This problem can be handled by a direct application of the inclusion-exclusion principle but we will apply Theorem to illustrate its use. Clearly the solution equals WßT\. Now define ß +, + #, á, + + á + ß + á + and + Tß +, + #, á, + ß!ß!ßá + á + ß+ á + and + T +, +, á, + ß+ ß+ ßá + # Then by Theorem, # T \ T \ß ß\ ß.. á ) - T ] ß] ß xw ß.. # T - ) where T ] ß] # ßá T T ] 3 0,, á T ] 3Á T ] )- x )- )! Therefore, T \.. )- )- ) xwß.-.) - x.. ) xw ß x. -.) )- - - )!. Wß xx )! 6
17 . - - Wß xx.- -!. x W 3ß 3 - Wß xx.- x 3x - -! 3. x W 3ß 3 Wß xx.- x 3x -- -! 3. x W 3ß 3 Wß xx.- x 3x -! 3 x W 3ß Wß xx x 3x x I3! 3 x W 3ß Wß xx x 3x x I 3! 3 x Wß Wß x x x x x Ißá! minß x Wß x Wß x x x x! Therefore the number of partitions of the set of elements into blocks which contain exactly blocks of cardinality is minß x x x W ß Problem (b). -.- # T [ ß ß[ T ] ß] ßá T 7
18 Clearly the solution equals T [. Now define +, + #, á, + + á + and + T +, + #, á, + ß!ß!ßá + á + and + T +, +, á, + ß+ ß+ ßá + # Then by Theorem 2, # T [ T [ß ß[. - T ] ß] ßá. # T - where T ] ß] # ßá T T ] 3 0,, á T ] 3Á T ] - x - Therefore,. - T [.- x. x x. 3xx 3!! 3 x I3 x 3xx 3!! 3 x I 3 x 3xx! 3!
19 x! xx x I!ßßá xx x x I!ßßá! provided!! x x x x Therefore the number of partitions of the set of elements which contain exactly blocks of cardinality is x x x provided! Problem (c) By Theorem 3, the number of partitions of a set of elements into blocks containing at least blocks of cardinality equals where x d d- - T ], á,] h h? ßáß? ± at least of the values? ßáß? equal and ] ßáß] are iid zero-truncated Poisson random variables with parameter -. That is, T ] C! - C - - Cx C ß #ß á else 9
20 Summing this result over all yields the total number of partitions of a set of elements containing at least blocks of cardinality. However as an application of the Zero-Truncated Poisson Randomization Theorem we showed that the number of ways that distinguishable balls can be distributed among distinguishable urns such that at least urns will contain balls and no urn is left empty equals d d - - T ], á,] h minß x x Wß xx Dividing this result by x and summing this result over all possible values of gives minß x Wß xx x Wß xx x Wß xx x xx Problem 2(a) It is well known and easy to verify that the factorial moment of a Poisson random variable with parameter 7 is just 7. Therefore it follows from Theorem that if we define ] µ Poisson )- then 2 20
21 E\ \ â \.. ) xwß.-.) E] ] â ] ) )-.. xwß.-.) - )! - )! xwß x.- ßßá x. - - I Wß.- x. - - I ßßá. - Wß - Ißßá Wß. x xwß x I Ißßá Wß x x Wß Wß ßßá ßßá I I x Wß provided Ÿ and. x Wß Problem 2(b) As a check on our work we note that \ á \ and hence E\ á\ E\ which can serve as a check on the above result for E Wß Wß Wß Wß \. We note that 2
22 Wß! W ß Wß W ß Wß W ß Wß Wß W ß W ß Wß W ß Þ In this proof we used two well known recurrence relations for the Stirling Numbers of the Second Kind. Namely, and Wß W <ß < < W ß Wß Wß Problem 2(c) By Theorem 2, if we define ] µ Poisson - then E[ [ â [..- ] ] â ] - E x! x x I! 22
23 Ÿ x x provided Problem 3(a) We have defined the random variable \ as the multiplicity of in a random partition of a set of elements into blocks. It follows that I \ is the number of multiplicities that equal in a random partition of a set of elements into blocks. The problem asks for the expected value of this sum. However and from Problem (a) E I \ T \ T \ minß x W ß x x Wß Hence the expected number of multiplicities equaling in a random partition of a set of elements into blocks is x W ß x x Wß minß Problem 3(b) We have defined the random variable [ as the multiplicity of in a random partition of a set of elements. It follows that I [ is the number of multiplicities that equal in a random partition of a set of elements. The problem asks for the expected value of this sum. However, if we let X equal the number of blocks in a random partition, then 23
24 EI [ EEI [ X E I \ TX minß x x x Wß Problem Let X equal the number of blocks in a random partition of a set with elements. EX TX Wß Wß Wß Wß Wß Wß Wß Problem (a) The given two step procedure for selecting a block is equivalent to selecting a block uniformly at random from the set of all Wß blocks making up the Wß partitions of a set of elements into exactly block s. As before, we let \ equal the multiplicity of in a random partition of a set of elements into blocks. Then, 2
25 TP number of blocks of size among the set of all Wß blocks Wß min ß T\Wß! Wß. E\ Wß Wß It follows that EP TP Wß Wß Wß Wß Wß w W ß! w w W ß Wß. Problem (b) Let X represent the number of blocks in a randomly selected partition. Then EP EEPX EP TX Wß Wß 2
26 Problem 6 From Theorem 3 the solution will equal where x d d- - T ], á,] h h? ßáß? ± exactly < of the values? ßáß? are even numbers and ] ßáß] are iid zero-truncated Poisson random variables with parameter -. That is, T ] C! - C - - Cx C ß #ß á else The zero-truncated Poisson distribution is a member of the Power Series Family with + C Cx,, - -, and 7. H ence from Theorem PSMM, taking 7#, we find $ and T ] #ß%ßá, -, - #, - # # - - # # # - # and T ] ß$ßá, -, - #, - 26
27 # # Therefore, and x T ] ] - -, á, h - - # # < - - # # d d- -, á, h T ] ] - - # # # # - - d x d - - < - # - # #< d - - < x < # d- # # - - #< < < d #< < # x < # d - - #< <!! #< < d # - x < #!! d- #< < x < #!! #< < # < < < Problem 7 27
28 Notes: For using Derive, define W +ß, -23!ß +ß ß! -23!ß,ß ß! W3<63# +ß, because Derive mistakenly defines W3<63#!ß!!Þ d db +B x B + Ißßá x B! and and - Wß- x x - - x! Also read Arratia, R. and Tavare, S. (992). Independent process approximations for random combinatorial structures. Advances in Mathematics.??? 2
29 2 : Descending Factorial Moment of \ E\ \â\. Suppose \µ Poisson -. Then â T \.! â T \ â x x 29
Binomial Randomization 3/13/02
Binomial Randomization 3/13/02 Define to be the product space 0,1, á, m â 0,1, á, m and let be the set of all vectors Ðs, á,s Ñ in such that s á s t. Suppose that \, á,\ is a multivariate hypergeometric
More informationMultinomial Allocation Model
Multinomial Allocation Model Theorem 001 Suppose an experiment consists of independent trials and that every trial results in exactly one of 8 distinct outcomes (multinomial trials) Let : equal the probability
More informationCombinatorial Enumeration. Jason Z. Gao Carleton University, Ottawa, Canada
Combinatorial Enumeration Jason Z. Gao Carleton University, Ottawa, Canada Counting Combinatorial Structures We are interested in counting combinatorial (discrete) structures of a given size. For example,
More informationNamed numbres. Ngày 25 tháng 11 năm () Named numbres Ngày 25 tháng 11 năm / 7
Named numbres Ngày 25 tháng 11 năm 2011 () Named numbres Ngày 25 tháng 11 năm 2011 1 / 7 Fibonacci, Catalan, Stirling, Euler, Bernoulli Many sequences are famous. 1 1, 2, 3, 4,... the integers. () Named
More informationPROBABILITY VITTORIA SILVESTRI
PROBABILITY VITTORIA SILVESTRI Contents Preface. Introduction 2 2. Combinatorial analysis 5 3. Stirling s formula 8 4. Properties of Probability measures Preface These lecture notes are for the course
More informationJuly 21, 2002, Poisson Randomization (Multinomial Allocation)
July 21, 2002, Poisson Ranomization (Multinomial Allocation) Theorem 1. Poisson Ranomization Theorem Define to be the prouct space á,, â á,, an let be the set of all vectors =, á, = in such that = á =.
More informationPROBABILITY. Contents Preface 1 1. Introduction 2 2. Combinatorial analysis 5 3. Stirling s formula 8. Preface
PROBABILITY VITTORIA SILVESTRI Contents Preface. Introduction. Combinatorial analysis 5 3. Stirling s formula 8 Preface These lecture notes are for the course Probability IA, given in Lent 09 at the University
More informationCS2800 Fall 2013 October 23, 2013
Discrete Structures Stirling Numbers CS2800 Fall 203 October 23, 203 The text mentions Stirling numbers briefly but does not go into them in any depth. However, they are fascinating numbers with a lot
More informationOrder Statistics. The order statistics of a set of random variables X 1, X 2,, X n are the same random variables arranged in increasing order.
Order Statistics The order statistics of a set of random variables 1, 2,, n are the same random variables arranged in increasing order. Denote by (1) = smallest of 1, 2,, n (2) = 2 nd smallest of 1, 2,,
More informationThe Inclusion Exclusion Principle
The Inclusion Exclusion Principle 1 / 29 Outline Basic Instances of The Inclusion Exclusion Principle The General Inclusion Exclusion Principle Counting Derangements Counting Functions Stirling Numbers
More informationChapter 5: Integer Compositions and Partitions and Set Partitions
Chapter 5: Integer Compositions and Partitions and Set Partitions Prof. Tesler Math 184A Winter 2017 Prof. Tesler Ch. 5: Compositions and Partitions Math 184A / Winter 2017 1 / 32 5.1. Compositions A strict
More informationA = A U. U [n] P(A U ). n 1. 2 k(n k). k. k=1
Lecture I jacques@ucsd.edu Notation: Throughout, P denotes probability and E denotes expectation. Denote (X) (r) = X(X 1)... (X r + 1) and let G n,p denote the Erdős-Rényi model of random graphs. 10 Random
More informationIndistinguishable objects in indistinguishable boxes
Counting integer partitions 2.4 61 Indistinguishable objects in indistinguishable boxes When placing k indistinguishable objects into n indistinguishable boxes, what matters? We are partitioning the integer
More informationCDM Combinatorial Principles
CDM Combinatorial Principles 1 Counting Klaus Sutner Carnegie Mellon University Pigeon Hole 22-in-exclusion 2017/12/15 23:16 Inclusion/Exclusion Counting 3 Aside: Ranking and Unranking 4 Counting is arguably
More informationMath 105A HW 1 Solutions
Sect. 1.1.3: # 2, 3 (Page 7-8 Math 105A HW 1 Solutions 2(a ( Statement: Each positive integers has a unique prime factorization. n N: n = 1 or ( R N, p 1,..., p R P such that n = p 1 p R and ( n, R, S
More informationClimbing an Infinite Ladder
Section 5.1 Section Summary Mathematical Induction Examples of Proof by Mathematical Induction Mistaken Proofs by Mathematical Induction Guidelines for Proofs by Mathematical Induction Climbing an Infinite
More informationChapter 5: Integer Compositions and Partitions and Set Partitions
Chapter 5: Integer Compositions and Partitions and Set Partitions Prof. Tesler Math 184A Fall 2017 Prof. Tesler Ch. 5: Compositions and Partitions Math 184A / Fall 2017 1 / 46 5.1. Compositions A strict
More informationMULTI-RESTRAINED STIRLING NUMBERS
MULTI-RESTRAINED STIRLING NUMBERS JI YOUNG CHOI DEPARTMENT OF MATHEMATICS SHIPPENSBURG UNIVERSITY SHIPPENSBURG, PA 17257, U.S.A. Abstract. Given positive integers n, k, and m, the (n, k)-th m- restrained
More informationStatistical Inference
Statistical Inference Lecture 1: Probability Theory MING GAO DASE @ ECNU (for course related communications) mgao@dase.ecnu.edu.cn Sep. 11, 2018 Outline Introduction Set Theory Basics of Probability Theory
More informationL11.P1 Lecture 11. Quantum statistical mechanics: summary
Lecture 11 Page 1 L11.P1 Lecture 11 Quantum statistical mechanics: summary At absolute zero temperature, a physical system occupies the lowest possible energy configuration. When the temperature increases,
More informationGenerating Functions
Semester 1, 2004 Generating functions Another means of organising enumeration. Two examples we have seen already. Example 1. Binomial coefficients. Let X = {1, 2,..., n} c k = # k-element subsets of X
More informationPropositional Logic, Predicates, and Equivalence
Chapter 1 Propositional Logic, Predicates, and Equivalence A statement or a proposition is a sentence that is true (T) or false (F) but not both. The symbol denotes not, denotes and, and denotes or. If
More informationPart IA Probability. Definitions. Based on lectures by R. Weber Notes taken by Dexter Chua. Lent 2015
Part IA Probability Definitions Based on lectures by R. Weber Notes taken by Dexter Chua Lent 2015 These notes are not endorsed by the lecturers, and I have modified them (often significantly) after lectures.
More information1. How many labeled trees are there on n vertices such that all odd numbered vertices are leaves?
1. How many labeled trees are there on n vertices such that all odd numbered vertices are leaves? This is most easily done by Prüfer codes. The number of times a vertex appears is the degree of the vertex.
More informationChapter 10. Infinite Sequences and Series
10.6 Alternating Series, Absolute and Conditional Convergence 1 Chapter 10. Infinite Sequences and Series 10.6 Alternating Series, Absolute and Conditional Convergence Note. The convergence tests investigated
More informationare the q-versions of n, n! and . The falling factorial is (x) k = x(x 1)(x 2)... (x k + 1).
Lecture A jacques@ucsd.edu Notation: N, R, Z, F, C naturals, reals, integers, a field, complex numbers. p(n), S n,, b(n), s n, partition numbers, Stirling of the second ind, Bell numbers, Stirling of the
More information3. The Multivariate Hypergeometric Distribution
1 of 6 7/16/2009 6:47 AM Virtual Laboratories > 12. Finite Sampling Models > 1 2 3 4 5 6 7 8 9 3. The Multivariate Hypergeometric Distribution Basic Theory As in the basic sampling model, we start with
More informationCS 336. We use the principle of inclusion and exclusion. Let B. = {five digit decimal numbers ending with a 5}, and
CS 336 1. The important issue is the logic you used to arrive at your answer. 2. Use extra paper to determine your solutions then neatly transcribe them onto these sheets. 3. Do not submit the scratch
More informationThe solutions to the two examples above are the same.
One-to-one correspondences A function f : A B is one-to-one if f(x) = f(y) implies that x = y. A function f : A B is onto if for any element b in B there is an element a in A such that f(a) = b. A function
More informationSets. A set is a collection of objects without repeats. The size or cardinality of a set S is denoted S and is the number of elements in the set.
Sets A set is a collection of objects without repeats. The size or cardinality of a set S is denoted S and is the number of elements in the set. If A and B are sets, then the set of ordered pairs each
More informationSets McGraw-Hill Education
Sets A set is an unordered collection of objects. The objects in a set are called the elements, or members of the set. A set is said to contain its elements. The notation a A denotes that a is an element
More information1. Determine (with proof) the number of ordered triples (A 1, A 2, A 3 ) of sets which satisfy
UT Putnam Prep Problems, Oct 19 2016 I was very pleased that, between the whole gang of you, you solved almost every problem this week! Let me add a few comments here. 1. Determine (with proof) the number
More informationClimbing an Infinite Ladder
Section 5.1 Section Summary Mathematical Induction Examples of Proof by Mathematical Induction Mistaken Proofs by Mathematical Induction Guidelines for Proofs by Mathematical Induction Climbing an Infinite
More information1 Chapter 1: SETS. 1.1 Describing a set
1 Chapter 1: SETS set is a collection of objects The objects of the set are called elements or members Use capital letters :, B, C, S, X, Y to denote the sets Use lower case letters to denote the elements:
More information1 The distributive law
THINGS TO KNOW BEFORE GOING INTO DISCRETE MATHEMATICS The distributive law The distributive law is this: a(b + c) = ab + bc This can be generalized to any number of terms between parenthesis; for instance:
More informationMA 524 Final Fall 2015 Solutions
MA 54 Final Fall 05 Solutions Name: Question Points Score 0 0 3 5 4 0 5 5 6 5 7 0 8 5 Total: 60 MA 54 Solutions Final, Page of 8. Let L be a finite lattice. (a) (5 points) Show that p ( (p r)) (p ) (p
More information2030 LECTURES. R. Craigen. Inclusion/Exclusion and Relations
2030 LECTURES R. Craigen Inclusion/Exclusion and Relations The Principle of Inclusion-Exclusion 7 ROS enumerates the union of disjoint sets. What if sets overlap? Some 17 out of 30 students in a class
More informationLarge subsets of semigroups
CHAPTER 8 Large subsets of semigroups In the van der Waerden theorem 7.5, we are given a finite colouring ω = A 1 A r of the commutative semigroup (ω, +); the remark 7.7(b) states that (at least) one of
More informationDerangements with an additional restriction (and zigzags)
Derangements with an additional restriction (and zigzags) István Mező Nanjing University of Information Science and Technology 2017. 05. 27. This talk is about a class of generalized derangement numbers,
More informationLectures on Elementary Probability. William G. Faris
Lectures on Elementary Probability William G. Faris February 22, 2002 2 Contents 1 Combinatorics 5 1.1 Factorials and binomial coefficients................. 5 1.2 Sampling with replacement.....................
More informationMATH 10B METHODS OF MATHEMATICS: CALCULUS, STATISTICS AND COMBINATORICS
MATH 10B METHODS OF MATHEMATICS: CALCULUS, STATISTICS AND COMBINATORICS Lior Pachter and Lawrence C. Evans Department of Mathematics University of California Berkeley, CA 94720 January 21, 2013 Lior Pachter
More informationBasic counting techniques. Periklis A. Papakonstantinou Rutgers Business School
Basic counting techniques Periklis A. Papakonstantinou Rutgers Business School i LECTURE NOTES IN Elementary counting methods Periklis A. Papakonstantinou MSIS, Rutgers Business School ALL RIGHTS RESERVED
More informationMaximising the number of induced cycles in a graph
Maximising the number of induced cycles in a graph Natasha Morrison Alex Scott April 12, 2017 Abstract We determine the maximum number of induced cycles that can be contained in a graph on n n 0 vertices,
More informationICS141: Discrete Mathematics for Computer Science I
ICS141: Discrete Mathematics for Computer Science I Dept. Information & Computer Sci., Jan Stelovsky based on slides by Dr. Baek and Dr. Still Originals by Dr. M. P. Frank and Dr. J.L. Gross Provided by
More informationMATH 556: PROBABILITY PRIMER
MATH 6: PROBABILITY PRIMER 1 DEFINITIONS, TERMINOLOGY, NOTATION 1.1 EVENTS AND THE SAMPLE SPACE Definition 1.1 An experiment is a one-off or repeatable process or procedure for which (a there is a well-defined
More informationPartition of Integers into Distinct Summands with Upper Bounds. Partition of Integers into Even Summands. An Example
Partition of Integers into Even Summands We ask for the number of partitions of m Z + into positive even integers The desired number is the coefficient of x m in + x + x 4 + ) + x 4 + x 8 + ) + x 6 + x
More information5 Set Operations, Functions, and Counting
5 Set Operations, Functions, and Counting Let N denote the positive integers, N 0 := N {0} be the non-negative integers and Z = N 0 ( N) the positive and negative integers including 0, Q the rational numbers,
More informationThe expansion of random regular graphs
The expansion of random regular graphs David Ellis Introduction Our aim is now to show that for any d 3, almost all d-regular graphs on {1, 2,..., n} have edge-expansion ratio at least c d d (if nd is
More informationCounting. Mukulika Ghosh. Fall Based on slides by Dr. Hyunyoung Lee
Counting Mukulika Ghosh Fall 2018 Based on slides by Dr. Hyunyoung Lee Counting Counting The art of counting is known as enumerative combinatorics. One tries to count the number of elements in a set (or,
More informationWhat you learned in Math 28. Rosa C. Orellana
What you learned in Math 28 Rosa C. Orellana Chapter 1 - Basic Counting Techniques Sum Principle If we have a partition of a finite set S, then the size of S is the sum of the sizes of the blocks of the
More informationÐ"Ñ + Ð"Ñ, Ð"Ñ +, +, + +, +,,
Handout #11 Confounding: Complete factorial experiments in incomplete blocks Blocking is one of the important principles in experimental design. In this handout we address the issue of designing complete
More informationChapter Generating Functions
Chapter 8.1.1-8.1.2. Generating Functions Prof. Tesler Math 184A Fall 2017 Prof. Tesler Ch. 8. Generating Functions Math 184A / Fall 2017 1 / 63 Ordinary Generating Functions (OGF) Let a n (n = 0, 1,...)
More informationChapter Summary. Sets The Language of Sets Set Operations Set Identities Functions Types of Functions Operations on Functions Computability
Chapter 2 1 Chapter Summary Sets The Language of Sets Set Operations Set Identities Functions Types of Functions Operations on Functions Computability Sequences and Summations Types of Sequences Summation
More informationSet Theory. CSE 215, Foundations of Computer Science Stony Brook University
Set Theory CSE 215, Foundations of Computer Science Stony Brook University http://www.cs.stonybrook.edu/~cse215 Set theory Abstract set theory is one of the foundations of mathematical thought Most mathematical
More information(n = 0, 1, 2,... ). (2)
Bull. Austral. Math. Soc. 84(2011), no. 1, 153 158. ON A CURIOUS PROPERTY OF BELL NUMBERS Zhi-Wei Sun and Don Zagier Abstract. In this paper we derive congruences expressing Bell numbers and derangement
More informationDiscrete Mathematics, Spring 2004 Homework 4 Sample Solutions
Discrete Mathematics, Spring 2004 Homework 4 Sample Solutions 4.2 #77. Let s n,k denote the number of ways to seat n persons at k round tables, with at least one person at each table. (The numbers s n,k
More informationProblem Set 2: Solutions Math 201A: Fall 2016
Problem Set 2: s Math 201A: Fall 2016 Problem 1. (a) Prove that a closed subset of a complete metric space is complete. (b) Prove that a closed subset of a compact metric space is compact. (c) Prove that
More informationMath 535: Topology Homework 1. Mueen Nawaz
Math 535: Topology Homework 1 Mueen Nawaz Mueen Nawaz Math 535 Topology Homework 1 Problem 1 Problem 1 Find all topologies on the set X = {0, 1, 2}. In the list below, a, b, c X and it is assumed that
More informationCS 2336 Discrete Mathematics
CS 2336 Discrete Mathematics Lecture 9 Sets, Functions, and Relations: Part I 1 What is a Set? Set Operations Identities Cardinality of a Set Outline Finite and Infinite Sets Countable and Uncountable
More informationMATH 802: ENUMERATIVE COMBINATORICS ASSIGNMENT 2
MATH 80: ENUMERATIVE COMBINATORICS ASSIGNMENT KANNAPPAN SAMPATH Facts Recall that, the Stirling number S(, n of the second ind is defined as the number of partitions of a [] into n non-empty blocs. We
More informationToday s topics. Introduction to Set Theory ( 1.6) Naïve set theory. Basic notations for sets
Today s topics Introduction to Set Theory ( 1.6) Sets Definitions Operations Proving Set Identities Reading: Sections 1.6-1.7 Upcoming Functions A set is a new type of structure, representing an unordered
More informationMathematical Induction. Section 5.1
Mathematical Induction Section 5.1 Section Summary Mathematical Induction Examples of Proof by Mathematical Induction Mistaken Proofs by Mathematical Induction Guidelines for Proofs by Mathematical Induction
More informationProbability & Combinatorics Test and Solutions February 18, 2012
1. A standard 12-hour clock has hour, minute, and second hands. How many times do two hands cross between 1:00 and 2:00 (not including 1:00 and 2:00 themselves)? Answer: 119 Solution: We know that the
More informationCMSC Discrete Mathematics SOLUTIONS TO FIRST MIDTERM EXAM October 18, 2005 posted Nov 2, 2005
CMSC-37110 Discrete Mathematics SOLUTIONS TO FIRST MIDTERM EXAM October 18, 2005 posted Nov 2, 2005 Instructor: László Babai Ryerson 164 e-mail: laci@cs This exam contributes 20% to your course grade.
More informationMath 378 Spring 2011 Assignment 4 Solutions
Math 3 Spring 2011 Assignment 4 Solutions Brualdi 6.2. The properties are P 1 : is divisible by 4. P 2 : is divisible by 6. P 3 : is divisible by. P 4 : is divisible by 10. Preparing to use inclusion-exclusion,
More informationSummary of basic probability theory Math 218, Mathematical Statistics D Joyce, Spring 2016
8. For any two events E and F, P (E) = P (E F ) + P (E F c ). Summary of basic probability theory Math 218, Mathematical Statistics D Joyce, Spring 2016 Sample space. A sample space consists of a underlying
More information{ 0! = 1 n! = n(n 1)!, n 1. n! =
Summations Question? What is the sum of the first 100 positive integers? Counting Question? In how many ways may the first three horses in a 10 horse race finish? Multiplication Principle: If an event
More informationDiscrete mathematics , Fall Instructor: prof. János Pach
Discrete mathematics 016-017, Fall Instructor: prof. János Pach - covered material - Lecture 1. Counting problems To read: [Lov]: 1.. Sets, 1.3. Number of subsets, 1.5. Sequences, 1.6. Permutations, 1.7.
More informationMath Fall 2014 Final Exam Solutions
Math 2001-003 Fall 2014 Final Exam Solutions Wednesday, December 17, 2014 Definition 1. The union of two sets X and Y is the set X Y consisting of all objects that are elements of X or of Y. The intersection
More informationDiscrete Mathematics. Kishore Kothapalli
Discrete Mathematics Kishore Kothapalli 2 Chapter 4 Advanced Counting Techniques In the previous chapter we studied various techniques for counting and enumeration. However, there are several interesting
More informationDiscrete Mathematics & Mathematical Reasoning Chapter 6: Counting
Discrete Mathematics & Mathematical Reasoning Chapter 6: Counting Kousha Etessami U. of Edinburgh, UK Kousha Etessami (U. of Edinburgh, UK) Discrete Mathematics (Chapter 6) 1 / 39 Chapter Summary The Basics
More informationMath 710 Homework 1. Austin Mohr September 2, 2010
Math 710 Homework 1 Austin Mohr September 2, 2010 1 For the following random experiments, describe the sample space Ω For each experiment, describe also two subsets (events) that might be of interest,
More informationFirst Midterm Examination
2015-2016 Spring Semester First Midterm Examination 1) How many numbers in the set {1000, 1001, 1002,..., 9999} have sum of digits equal to 17? 2) Let n Z +. Find the negation, converse and contrapositive
More informationChapter Summary. Mathematical Induction Strong Induction Well-Ordering Recursive Definitions Structural Induction Recursive Algorithms
1 Chapter Summary Mathematical Induction Strong Induction Well-Ordering Recursive Definitions Structural Induction Recursive Algorithms 2 Section 5.1 3 Section Summary Mathematical Induction Examples of
More informationRMT 2013 Power Round Solutions February 2, 2013
RMT 013 Power Round Solutions February, 013 1. (a) (i) {0, 5, 7, 10, 11, 1, 14} {n N 0 : n 15}. (ii) Yes, 5, 7, 11, 16 can be generated by a set of fewer than 4 elements. Specifically, it is generated
More informationCHAPTER 7. Connectedness
CHAPTER 7 Connectedness 7.1. Connected topological spaces Definition 7.1. A topological space (X, T X ) is said to be connected if there is no continuous surjection f : X {0, 1} where the two point set
More informationACO Comprehensive Exam March 17 and 18, Computability, Complexity and Algorithms
1. Computability, Complexity and Algorithms (a) Let G(V, E) be an undirected unweighted graph. Let C V be a vertex cover of G. Argue that V \ C is an independent set of G. (b) Minimum cardinality vertex
More informationSet theory background for probability
Set theory background for probability Defining sets (a very naïve approach) A set is a collection of distinct objects. The objects within a set may be arbitrary, with the order of objects within them having
More informationLECTURE Questions 1
Contents 1 Questions 1 2 Reality 1 2.1 Implementing a distribution generator.............................. 1 2.2 Evaluating the generating function from the series expression................ 2 2.3 Finding
More informationChapter Summary. Sets (2.1) Set Operations (2.2) Functions (2.3) Sequences and Summations (2.4) Cardinality of Sets (2.5) Matrices (2.
Chapter 2 Chapter Summary Sets (2.1) Set Operations (2.2) Functions (2.3) Sequences and Summations (2.4) Cardinality of Sets (2.5) Matrices (2.6) Section 2.1 Section Summary Definition of sets Describing
More informationUC Berkeley Department of Electrical Engineering and Computer Science. EE 126: Probablity and Random Processes. Problem Set 3: Solutions Fall 2007
UC Berkeley Department of Electrical Engineering and Computer Science EE 126: Probablity and Random Processes Problem Set 3: Solutions Fall 2007 Issued: Thursday, September 13, 2007 Due: Friday, September
More informationConvex Feasibility Problems
Laureate Prof. Jonathan Borwein with Matthew Tam http://carma.newcastle.edu.au/drmethods/paseky.html Spring School on Variational Analysis VI Paseky nad Jizerou, April 19 25, 2015 Last Revised: May 6,
More information6 CARDINALITY OF SETS
6 CARDINALITY OF SETS MATH10111 - Foundations of Pure Mathematics We all have an idea of what it means to count a finite collection of objects, but we must be careful to define rigorously what it means
More informationq xk y n k. , provided k < n. (This does not hold for k n.) Give a combinatorial proof of this recurrence by means of a bijective transformation.
Math 880 Alternative Challenge Problems Fall 2016 A1. Given, n 1, show that: m1 m 2 m = ( ) n+ 1 2 1, where the sum ranges over all positive integer solutions (m 1,..., m ) of m 1 + + m = n. Give both
More informationAn Introduction to Combinatorial Species
An Introduction to Combinatorial Species Ira M. Gessel Department of Mathematics Brandeis University Summer School on Algebraic Combinatorics Korea Institute for Advanced Study Seoul, Korea June 14, 2016
More informationDiscrete Mathematics
Discrete Mathematics Workshop Organized by: ACM Unit, ISI Tutorial-1 Date: 05.07.2017 (Q1) Given seven points in a triangle of unit area, prove that three of them form a triangle of area not exceeding
More informationUndergraduate Probability I. Class Notes for Engineering Students
Undergraduate Probability I Class Notes for Engineering Students Fall 2014 Contents I Probability Laws 1 1 Mathematical Review 2 1.1 Elementary Set Operations.................... 4 1.2 Additional Rules
More informationPROBABILITY THEORY 1. Basics
PROILITY THEORY. asics Probability theory deals with the study of random phenomena, which under repeated experiments yield different outcomes that have certain underlying patterns about them. The notion
More informationCombinatorics. But there are some standard techniques. That s what we ll be studying.
Combinatorics Problem: How to count without counting. How do you figure out how many things there are with a certain property without actually enumerating all of them. Sometimes this requires a lot of
More informationMonty Hall Puzzle. Draw a tree diagram of possible choices (a possibility tree ) One for each strategy switch or no-switch
Monty Hall Puzzle Example: You are asked to select one of the three doors to open. There is a large prize behind one of the doors and if you select that door, you win the prize. After you select a door,
More informationMATH 580, midterm exam SOLUTIONS
MATH 580, midterm exam SOLUTIONS Solve the problems in the spaces provided on the question sheets. If you run out of room for an answer, continue on the back of the page or use the Extra space empty page
More informationGenerating Functions
8.30 lecture notes March, 0 Generating Functions Lecturer: Michel Goemans We are going to discuss enumeration problems, and how to solve them using a powerful tool: generating functions. What is an enumeration
More informationHow to count - an exposition of Polya s theory of enumeration
How to count - an exposition of Polya s theory of enumeration Shriya Anand Published in Resonance, September 2002 P.19-35. Shriya Anand is a BA Honours Mathematics III year student from St. Stephens College,
More informationThe Inclusion Exclusion Principle and Its More General Version
The Inclusion Exclusion Principle and Its More General Version Stewart Weiss June 28, 2009 1 Introduction The Inclusion-Exclusion Principle is typically seen in the context of combinatorics or probability
More informationWith Question/Answer Animations
Chapter 5 With Question/Answer Animations Copyright McGraw-Hill Education. All rights reserved. No reproduction or distribution without the prior written consent of McGraw-Hill Education. Chapter Summary
More informationMath 421, Homework #6 Solutions. (1) Let E R n Show that = (E c ) o, i.e. the complement of the closure is the interior of the complement.
Math 421, Homework #6 Solutions (1) Let E R n Show that (Ē) c = (E c ) o, i.e. the complement of the closure is the interior of the complement. 1 Proof. Before giving the proof we recall characterizations
More informationWelsh s problem on the number of bases of matroids
Welsh s problem on the number of bases of matroids Edward S. T. Fan 1 and Tony W. H. Wong 2 1 Department of Mathematics, California Institute of Technology 2 Department of Mathematics, Kutztown University
More informationLECTURE 1. 1 Introduction. 1.1 Sample spaces and events
LECTURE 1 1 Introduction The first part of our adventure is a highly selective review of probability theory, focusing especially on things that are most useful in statistics. 1.1 Sample spaces and events
More informationThe integers. Chapter 3
Chapter 3 The integers Recall that an abelian group is a set A with a special element 0, and operation + such that x +0=x x + y = y + x x +y + z) =x + y)+z every element x has an inverse x + y =0 We also
More informationWeek 4-5: Binary Relations
1 Binary Relations Week 4-5: Binary Relations The concept of relation is common in daily life and seems intuitively clear. For instance, let X be the set of all living human females and Y the set of all
More information