distinct distinct n k n k n! n n k k n 1 if k n, identical identical p j (k) p 0 if k > n n (k)
|
|
- Esmond McDonald
- 5 years ago
- Views:
Transcription
1 THE TWELVEFOLD WAY FOLLOWING GIAN-CARLO ROTA How ay ways ca we distribute objects to recipiets? Equivaletly, we wat to euerate equivalece classes of fuctios f : X Y where X = ad Y = The fuctios are subject to three restrictios: f is arbitrary, f is ijective, f is surjective The four differet equivalece relatios o fuctios coe about fro regardig the eleets of X ad Y as distiguishable or idistiguishable Thi of X as a set of balls ad Y as a set of boxes A fuctio f : X Y cosists of placig each ball ito soe box If we ca tell the balls apart, the the eleets of X are distiguishable, otherwise they are idistiguishable Siilarly, if we ca tell the boxes apart, the the eleets of Y are distiguishable, otherwise they are idistiguishable More forally, two fuctios f,g: X Y are equivalet with X idistiguishable if there is a bijectio u: X X such that f ux = gx for all x X Siilarly, f ad g are equivalet with Y idistiguishable if there is a bijectio v: Y Y such that v f x = gx for all x X Fially, f ad g are equivalet with X ad Y idistiguishable if there are bijectios u: X X ad v: Y Y such that v f ux = gx for all x X The twelve etries i the table give the uber of iequivalet fuctios f : X Y eleets of X eleets of Y arbitrary f ijective f surjective f } distict distict! idetical distict } } distict idetical 1 if, j 0 if > 1 if, idetical idetical p j p 0 if > j=0 : For each x X, f x ca be ay of the eleets of Y, so there are fuctios : If X = x 1,x 2,,x }, the f x 1 ca be chose i ways, f x 2 i 1 ways, Hece, there are = 1 1 choices i total! } : If Y = y1,y 2,,y }, the f 1 y j is a oepty subset of X ad these subsets partitio X There are } ways to partitio X ito blocs, ad! ways to liearly order the blocs : The balls are idistiguishable, so we are oly iterested i how ay balls go ito each box If νy j balls go ito box y j, the ν defies a ultiset of size, ad there are such ultisets : The balls are idistiguishable, so we are oly iterested i which boxes get a ball There are ways to choose which boxes get a ball MATH 402 : 2017 page 29 of 34
2 : Each box y j ust cotai at least oe ball If we reove oe ball fro each box, the we obtai a ultiset of size There are such ultisets j} : Sice the boxes are idistiguishable, a fuctio f : X Y is deteried by the oepty sets f 1 y for all y Y These sets for a partitio of X ad the uber of partitios of X ito at ost blocs i } j [ ]: Each bloc i the partitio correspodig to f ust have oe eleet If, there is oe such partitio If >, the there is o such partitio by the Pigeohole Priciple } : If f is surjective, the oe of the sets f 1 y is epty Hece, the correspodig partitio of X cotais exactly blocs, ad there are } such partitios j=0 p j: If both X ad Y are idistiguishable, the the fuctio is deteried by the uber of eleets i each bloc of the correspodig partitio of X; the actual eleets are irrelevat The oly restrictio o these ubers is that they be positive itegers suig to ad that there ca be o ore that The uber of such iteger partitios is j=0 p j p : If f is surjective, the the correspodig partitio of X has blocs, so their cardialities for a partitio of ito exactly parts SUMMARY Additio forula = = 1 } } } [ ] [ = = 1 1 p = p p 1 Suatio forula = 2 Z =0 [ ] Z Algebraic forula x 1 = Z [ ] x = Z = =! p = p Z x x 1 1 x = x N?? = p x Z Z ] 1 [ 1 1 ] } = ϖ } x = x Z MATH 402 : 2017 page 30 of 34
3 INCLUSION EXCLUSION PRINCIPLE Proble If a school has 100 studets with 50 studets studyig Frech, 40 studets studyig Eglish, ad 20 studets studyig both laguages, the how ay studets are ot studyig either laguage? Solutio The uber of studets ot studyig either laguage is 100 }} uber of studets 50 }} uber i Frech 40 }} uber i Eglish }} 20 = 30 overcout: uber i both Proble Cout the perutatios of [9] with first digit greater tha 2 ad last digit less tha 8? Solutio Let F be the set of perutatios with a 1 or 2 i the first digit ad let L be the set of perutatios with a 8 or 9 i the last digits It follows that F L = 9! F L F L = 9! 28! 28! 227! = Proble If a school has 100 studets with 50 studets studyig Frech, 40 studets studyig Eglish, 30 studets studyig Chiese, 15 studets are studyig ay give pair of laguages, ad 5 studets are studyig all three, the how ay studets are ot studyig ay of these laguages? Solutio The uber of studets ot studyig ay of these laguages is = 20 Theore Iclusio Exclusio Priciple For fiite sets A 1,A 2,,A, we have A 1 A 2 A = τ [] = 1 j 1 τ 1 A j A j j τ 1 j< A j A 1 A 1 A 2 A Proof The bioial theore states that x y = Z x y Assuig > 0, x = 1, ad y = 1, we obtai 0 = Z 1 Now, if a eleet x lies i exactly of the sets, the A 1 A 2 A will cout this eleet exactly = 1 ties Siilarly, the eleet x appears i 2 pairs of sets, so 1 i< j Ai A j will cout it 2 ties More geerally, the eleet x appears i j j-tuples of MATH 402 : 2017 page 31 of 34
4 sets, so τ [] τ = j i τ A i will cout it j ties Overall, the eleet x will be couted = 3 = 1 0 ties Hece, every eleet i A 1 A 2 A is couted exactly oce Rear If A 1 = A 2 = = A = [1], the Iclusio Exclusio gives 1 = 1 j1 Proble Derageets How ay perutatios σ : [] [] have ot fixed poits; that is σ j j for all j []? A perutatio i which o eleet appears i it origial positio is called a derageet Solutio Let D be the uber of derageets of [], so D0 = 1, D1 = 0, D2 = 1, ad D3 = 2 Let A j cosist of all perutatios of [] with σ j = j It follows that A i A j A is the set of perutatios that fix at least the set i, j,}, so Ai A j A = 3! Hece, Iclusio Exclusio iplies that D = =0 1! =! =0 1! Sice e 1 = 0 1 /!, it is clear that!/e is a good approxiatio to D ; oe ca show that D is the earest iteger to!/e Proble Surjectios How ay surjectios fro [] to [] are there? Solutio Let A j cosist of appigs fro [] to [] such that j is ot i the iage It follows that A p A q A r is the set of aps fro [] to [] that iss p,q,r}, so A p A q A r = 3 Hece, Iclusio Exclusio iplies that the uber of surjectios is j=0 1 j j j } Corollary For, N, we have! = j=0 1 j j j Coet o Proof Both sides cout the uber of surjectios fro [] to [] Proble* Euler s totiet fuctio Let ϕ be the uber of itegers i [] that are relatively prie to If p, q, ad r are distict pries, the copute ϕpqr Solutio We cout those positive itegers that are ot relatively prie to pqr Clearly, there are pq itegers i [pqr] that are divisible by r Hece, Iclusio Exclusio gives ϕpqr = pqr pq pr qr p q 1 1 = p 1q 1r 1 More geerally, if = p a 1 1 pa 2 2 pa r r, the oe has ϕp a 1 1 pa 2 2 pa r r = r p j 1 j< r = p j p r 1 1p j MATH 402 : 2017 page 32 of 34
5 ALTERNATING SIGN IDENTITIES Proble For > 0, we have 1 = 0 Z Solutio We give a bijective proof SET 1: Let E deote the subsets of [] with eve cardiality, so we have E = 0 od 2 SET 2: Let O deote the subsets of [] with odd cardiality, so we have O = 1 od 2 BIJECTION: For X = x 1,x 2,,x } where 1 x 1 < x 2 < < x, cosider the syetric differece of X ad } defied by x 1,x 2,,x,} if X; X } := x 1,x 2,,x 1 } if X I other words, if is ot i X, the X } puts ito X ad if is i X the X } reoves it fro X Hece, the set X } has either oe ore or oe fewer eleet tha X, so it produces aps E O ad O E Moreover, this operatio is ivolutive, that is X } } = X, so we obtai a bijectio Fro the bijectio, we deduce that E = O as required Rear* The syetric differece also ow as the disjuctive uio of two sets is the set of eleets which are i either of the sets ad ot i their itersectio I other words, give two sets X ad Y, the syetric differece is X Y := X \ Y Y \ X Proble For N ad > 0, we have Solutio We give a bijective proof =0 1 = 1 1 SET 1: Let E deote the subsets of [] with eve cardiality at ost, so E = 0 od 2 SET 2: Let O deote the subsets of [] with odd cardiality at ost, so, so O = 0 od 2 BIJECTION: The syetric differece X } is agai useful We cosider two cases: Whe is eve ad X is a eleet of E, the set X } belogs to O provided that X } does ot have ore tha eleets The oly uatched subsets occur i the 1 istaces where X = ad X, because X } cotais 1 eleets Thus, whe is eve, we deduce that E = O 1 Whe is odd ad X is a eleet of E, the set X } is always defied, but we iss those ebers of O that cotai eleets fro [ 1] because such a set ca oly be hit by a 1 eleet subset of [] that cotais Here, we have O = E 1 Cobiig the two cases, we have E O = 1 1 as desired Notatio The Kroecer delta fuctio is defied to be 1 if j =, δ j, := 0 if j I other words, it gives the etries of the idetity atrix I = [δ j, ] MATH 402 : 2017 page 33 of 34
6 Proble For all, N, we have Solutio We give a bijective proof =0 1 = 1 δ, SET 1: For, 0, let E deote the set of ordered pairs S,T where T S [], T =, ad S is eve For eve ubers, the set E cotais eleets where S = ad therefore cotais 0 od 2 eleets i total SET 2: For, 0, let O deote the set of ordered pairs S,T where T S [], T =, ad S is odd For odd ubers, O cotais eleets where S = ad therefore cotais 1 od 2 eleets i total BIJECTION: We cosider three cases: < : I this case, both E ad O are epty, so the idetity is trivially true = : Whe = is eve, the the set E cotais oe eleet, aely T = S = [] ad O is epty Liewise, whe = is odd, the set E is epty ad O cotais oe eleet Either way, the cardialities of E ad O differ by exactly oe eleet > : For ay pair S,T, let x be the largest eleet of [] that is ot i T; such a x ust exist because > Now if x S we reove it If x S, we put it i I other words, we ap S,T to S x},t Sice S ad S x} have opposite parity, we obtai a bijectio betwee E ad O Cobiig the three cases, we see that E O = 1 δ, Rear* We ca reiterpret this idetity as atrix ultiplicatio Up to appropriate sigs, the atrix of bioial coefficiets is its ow iverse; I = = MATH 402 : 2017 page 34 of 34
COMP 2804 Solutions Assignment 1
COMP 2804 Solutios Assiget 1 Questio 1: O the first page of your assiget, write your ae ad studet uber Solutio: Nae: Jaes Bod Studet uber: 007 Questio 2: I Tic-Tac-Toe, we are give a 3 3 grid, cosistig
More informationMATH10040 Chapter 4: Sets, Functions and Counting
MATH10040 Chapter 4: Sets, Fuctios ad Coutig 1. The laguage of sets Iforally, a set is ay collectio of objects. The objects ay be atheatical objects such as ubers, fuctios ad eve sets, or letters or sybols
More informationMath 4707 Spring 2018 (Darij Grinberg): midterm 2 page 1. Math 4707 Spring 2018 (Darij Grinberg): midterm 2 with solutions [preliminary version]
Math 4707 Sprig 08 Darij Griberg: idter page Math 4707 Sprig 08 Darij Griberg: idter with solutios [preliiary versio] Cotets 0.. Coutig first-eve tuples......................... 3 0.. Coutig legal paths
More informationDiscrete Mathematics: Lectures 8 and 9 Principle of Inclusion and Exclusion Instructor: Arijit Bishnu Date: August 11 and 13, 2009
Discrete Matheatics: Lectures 8 ad 9 Priciple of Iclusio ad Exclusio Istructor: Arijit Bishu Date: August ad 3, 009 As you ca observe by ow, we ca cout i various ways. Oe such ethod is the age-old priciple
More informationMa/CS 6a Class 22: Power Series
Ma/CS 6a Class 22: Power Series By Ada Sheffer Power Series Mooial: ax i. Polyoial: a 0 + a 1 x + a 2 x 2 + + a x. Power series: A x = a 0 + a 1 x + a 2 x 2 + Also called foral power series, because we
More informationJacobi symbols. p 1. Note: The Jacobi symbol does not necessarily distinguish between quadratic residues and nonresidues. That is, we could have ( a
Jacobi sybols efiitio Let be a odd positive iteger If 1, the Jacobi sybol : Z C is the costat fuctio 1 1 If > 1, it has a decopositio ( as ) a product of (ot ecessarily distict) pries p 1 p r The Jacobi
More information1 Summary: Binary and Logic
1 Summary: Biary ad Logic Biary Usiged Represetatio : each 1-bit is a power of two, the right-most is for 2 0 : 0110101 2 = 2 5 + 2 4 + 2 2 + 2 0 = 32 + 16 + 4 + 1 = 53 10 Usiged Rage o bits is [0...2
More information6.4 Binomial Coefficients
64 Bioial Coefficiets Pascal s Forula Pascal s forula, aed after the seveteeth-cetury Frech atheaticia ad philosopher Blaise Pascal, is oe of the ost faous ad useful i cobiatorics (which is the foral ter
More informationBernoulli Polynomials Talks given at LSBU, October and November 2015 Tony Forbes
Beroulli Polyoials Tals give at LSBU, October ad Noveber 5 Toy Forbes Beroulli Polyoials The Beroulli polyoials B (x) are defied by B (x), Thus B (x) B (x) ad B (x) x, B (x) x x + 6, B (x) dx,. () B 3
More informationExercises 1 Sets and functions
Exercises 1 Sets ad fuctios HU Wei September 6, 018 1 Basics Set theory ca be made much more rigorous ad built upo a set of Axioms. But we will cover oly some heuristic ideas. For those iterested studets,
More informationProblem. Consider the sequence a j for j N defined by the recurrence a j+1 = 2a j + j for j > 0
GENERATING FUNCTIONS Give a ifiite sequece a 0,a,a,, its ordiary geeratig fuctio is A : a Geeratig fuctios are ofte useful for fidig a closed forula for the eleets of a sequece, fidig a recurrece forula,
More information42 Dependence and Bases
42 Depedece ad Bases The spa s(a) of a subset A i vector space V is a subspace of V. This spa ay be the whole vector space V (we say the A spas V). I this paragraph we study subsets A of V which spa V
More information1 Counting and Stirling Numbers
1 Coutig ad Stirlig Numbers Natural Numbers: We let N {0, 1, 2,...} deote the set of atural umbers. []: For N we let [] {1, 2,..., }. Sym: For a set X we let Sym(X) deote the set of bijectios from X to
More informationChapter 0. Review of set theory. 0.1 Sets
Chapter 0 Review of set theory Set theory plays a cetral role i the theory of probability. Thus, we will ope this course with a quick review of those otios of set theory which will be used repeatedly.
More informationMath 155 (Lecture 3)
Math 55 (Lecture 3) September 8, I this lecture, we ll cosider the aswer to oe of the most basic coutig problems i combiatorics Questio How may ways are there to choose a -elemet subset of the set {,,,
More informationCSE 191, Class Note 05: Counting Methods Computer Sci & Eng Dept SUNY Buffalo
Coutig Methods CSE 191, Class Note 05: Coutig Methods Computer Sci & Eg Dept SUNY Buffalo c Xi He (Uiversity at Buffalo CSE 191 Discrete Structures 1 / 48 Need for Coutig The problem of coutig the umber
More informationThe multiplicative structure of finite field and a construction of LRC
IERG6120 Codig for Distributed Storage Systems Lecture 8-06/10/2016 The multiplicative structure of fiite field ad a costructio of LRC Lecturer: Keeth Shum Scribe: Zhouyi Hu Notatios: We use the otatio
More informationThe Hypergeometric Coupon Collection Problem and its Dual
Joural of Idustrial ad Systes Egieerig Vol., o., pp -7 Sprig 7 The Hypergeoetric Coupo Collectio Proble ad its Dual Sheldo M. Ross Epstei Departet of Idustrial ad Systes Egieerig, Uiversity of Souther
More informationDouble Derangement Permutations
Ope Joural of iscrete Matheatics, 206, 6, 99-04 Published Olie April 206 i SciRes http://wwwscirporg/joural/ojd http://dxdoiorg/04236/ojd2066200 ouble erageet Perutatios Pooya aeshad, Kayar Mirzavaziri
More informationMath 475, Problem Set #12: Answers
Math 475, Problem Set #12: Aswers A. Chapter 8, problem 12, parts (b) ad (d). (b) S # (, 2) = 2 2, sice, from amog the 2 ways of puttig elemets ito 2 distiguishable boxes, exactly 2 of them result i oe
More information) is a square matrix with the property that for any m n matrix A, the product AI equals A. The identity matrix has a ii
square atrix is oe that has the sae uber of rows as colus; that is, a atrix. he idetity atrix (deoted by I, I, or [] I ) is a square atrix with the property that for ay atrix, the product I equals. he
More informationIntegrals of Functions of Several Variables
Itegrals of Fuctios of Several Variables We ofte resort to itegratios i order to deterie the exact value I of soe quatity which we are uable to evaluate by perforig a fiite uber of additio or ultiplicatio
More informationHomework 3. = k 1. Let S be a set of n elements, and let a, b, c be distinct elements of S. The number of k-subsets of S is
Homewor 3 Chapter 5 pp53: 3 40 45 Chapter 6 p85: 4 6 4 30 Use combiatorial reasoig to prove the idetity 3 3 Proof Let S be a set of elemets ad let a b c be distict elemets of S The umber of -subsets of
More informationInjections, Surjections, and the Pigeonhole Principle
Ijectios, Surjectios, ad the Pigeohole Priciple 1 (10 poits Here we will come up with a sloppy boud o the umber of parethesisestigs (a (5 poits Describe a ijectio from the set of possible ways to est pairs
More informationBertrand s postulate Chapter 2
Bertrad s postulate Chapter We have see that the sequece of prie ubers, 3, 5, 7,... is ifiite. To see that the size of its gaps is ot bouded, let N := 3 5 p deote the product of all prie ubers that are
More informationAxioms of Measure Theory
MATH 532 Axioms of Measure Theory Dr. Neal, WKU I. The Space Throughout the course, we shall let X deote a geeric o-empty set. I geeral, we shall ot assume that ay algebraic structure exists o X so that
More informationREVIEW FOR CHAPTER 1
REVIEW FOR CHAPTER 1 A short summary: I this chapter you helped develop some basic coutig priciples. I particular, the uses of ordered pairs (The Product Priciple), fuctios, ad set partitios (The Sum Priciple)
More information1.2 AXIOMATIC APPROACH TO PROBABILITY AND PROPERTIES OF PROBABILITY MEASURE 1.2 AXIOMATIC APPROACH TO PROBABILITY AND
NTEL- robability ad Distributios MODULE 1 ROBABILITY LECTURE 2 Topics 1.2 AXIOMATIC AROACH TO ROBABILITY AND ROERTIES OF ROBABILITY MEASURE 1.2.1 Iclusio-Exclusio Forula I the followig sectio we will discuss
More information3.1 Counting Principles
3.1 Coutig Priciples Goal: Cout the umber of objects i a set. Notatio: Whe S is a set, S deotes the umber of objects i the set. This is also called S s cardiality. Additio Priciple: Whe you wat to cout
More informationName Period ALGEBRA II Chapter 1B and 2A Notes Solving Inequalities and Absolute Value / Numbers and Functions
Nae Period ALGEBRA II Chapter B ad A Notes Solvig Iequalities ad Absolute Value / Nubers ad Fuctios SECTION.6 Itroductio to Solvig Equatios Objectives: Write ad solve a liear equatio i oe variable. Solve
More informationLecture Overview. 2 Permutations and Combinations. n(n 1) (n (k 1)) = n(n 1) (n k + 1) =
COMPSCI 230: Discrete Mathematics for Computer Sciece April 8, 2019 Lecturer: Debmalya Paigrahi Lecture 22 Scribe: Kevi Su 1 Overview I this lecture, we begi studyig the fudametals of coutig discrete objects.
More information[ 11 ] z of degree 2 as both degree 2 each. The degree of a polynomial in n variables is the maximum of the degrees of its terms.
[ 11 ] 1 1.1 Polyomial Fuctios 1 Algebra Ay fuctio f ( x) ax a1x... a1x a0 is a polyomial fuctio if ai ( i 0,1,,,..., ) is a costat which belogs to the set of real umbers ad the idices,, 1,...,1 are atural
More informationWeek 5-6: The Binomial Coefficients
Wee 5-6: The Biomial Coefficiets March 6, 2018 1 Pascal Formula Theorem 11 (Pascal s Formula For itegers ad such that 1, ( ( ( 1 1 + 1 The umbers ( 2 ( 1 2 ( 2 are triagle umbers, that is, The petago umbers
More informationComplex Numbers Solutions
Complex Numbers Solutios Joseph Zoller February 7, 06 Solutios. (009 AIME I Problem ) There is a complex umber with imagiary part 64 ad a positive iteger such that Fid. [Solutio: 697] 4i + + 4i. 4i 4i
More informationSome remarks on the paper Some elementary inequalities of G. Bennett
Soe rears o the paper Soe eleetary iequalities of G. Beett Dag Ah Tua ad Luu Quag Bay Vieta Natioal Uiversity - Haoi Uiversity of Sciece Abstract We give soe couterexaples ad soe rears of soe of the corollaries
More informationSolutions to Math 347 Practice Problems for the final
Solutios to Math 347 Practice Problems for the fial 1) True or False: a) There exist itegers x,y such that 50x + 76y = 6. True: the gcd of 50 ad 76 is, ad 6 is a multiple of. b) The ifiimum of a set is
More informationf(1), and so, if f is continuous, f(x) = f(1)x.
2.2.35: Let f be a additive fuctio. i Clearly fx = fx ad therefore f x = fx for all Z+ ad x R. Hece, for ay, Z +, f = f, ad so, if f is cotiuous, fx = fx. ii Suppose that f is bouded o soe o-epty ope set.
More informationPutnam Training Exercise Counting, Probability, Pigeonhole Principle (Answers)
Putam Traiig Exercise Coutig, Probability, Pigeohole Pricile (Aswers) November 24th, 2015 1. Fid the umber of iteger o-egative solutios to the followig Diohatie equatio: x 1 + x 2 + x 3 + x 4 + x 5 = 17.
More informationThe Boolean Ring of Intervals
MATH 532 Lebesgue Measure Dr. Neal, WKU We ow shall apply the results obtaied about outer measure to the legth measure o the real lie. Throughout, our space X will be the set of real umbers R. Whe ecessary,
More informationReview Problems 1. ICME and MS&E Refresher Course September 19, 2011 B = C = AB = A = A 2 = A 3... C 2 = C 3 = =
Review Problems ICME ad MS&E Refresher Course September 9, 0 Warm-up problems. For the followig matrices A = 0 B = C = AB = 0 fid all powers A,A 3,(which is A times A),... ad B,B 3,... ad C,C 3,... Solutio:
More informationBinomial transform of products
Jauary 02 207 Bioial trasfor of products Khristo N Boyadzhiev Departet of Matheatics ad Statistics Ohio Norther Uiversity Ada OH 4580 USA -boyadzhiev@ouedu Abstract Give the bioial trasfors { b } ad {
More informationIt is always the case that unions, intersections, complements, and set differences are preserved by the inverse image of a function.
MATH 532 Measurable Fuctios Dr. Neal, WKU Throughout, let ( X, F, µ) be a measure space ad let (!, F, P ) deote the special case of a probability space. We shall ow begi to study real-valued fuctios defied
More informationCIS Spring 2018 (instructor Val Tannen)
CIS 160 - Sprig 2018 (istructor Val Tae) Lecture 5 Thursday, Jauary 25 COUNTING We cotiue studyig how to use combiatios ad what are their properties. Example 5.1 How may 8-letter strigs ca be costructed
More information1 Last time: similar and diagonalizable matrices
Last time: similar ad diagoalizable matrices Let be a positive iteger Suppose A is a matrix, v R, ad λ R Recall that v a eigevector for A with eigevalue λ if v ad Av λv, or equivaletly if v is a ozero
More informationSets. Sets. Operations on Sets Laws of Algebra of Sets Cardinal Number of a Finite and Infinite Set. Representation of Sets Power Set Venn Diagram
Sets MILESTONE Sets Represetatio of Sets Power Set Ve Diagram Operatios o Sets Laws of lgebra of Sets ardial Number of a Fiite ad Ifiite Set I Mathematical laguage all livig ad o-livig thigs i uiverse
More informationA Note on the Symmetric Powers of the Standard Representation of S n
A Note o the Symmetric Powers of the Stadard Represetatio of S David Savitt 1 Departmet of Mathematics, Harvard Uiversity Cambridge, MA 0138, USA dsavitt@mathharvardedu Richard P Staley Departmet of Mathematics,
More informationM A T H F A L L CORRECTION. Algebra I 1 4 / 1 0 / U N I V E R S I T Y O F T O R O N T O
M A T H 2 4 0 F A L L 2 0 1 4 HOMEWORK ASSIGNMENT #4 CORRECTION Algebra I 1 4 / 1 0 / 2 0 1 4 U N I V E R S I T Y O F T O R O N T O P r o f e s s o r : D r o r B a r - N a t a Correctio Homework Assigmet
More informationLecture 10: Mathematical Preliminaries
Lecture : Mathematical Prelimiaries Obective: Reviewig mathematical cocepts ad tools that are frequetly used i the aalysis of algorithms. Lecture # Slide # I this
More informationMath 7409 Homework 2 Fall from which we can calculate the cycle index of the action of S 5 on pairs of vertices as
Math 7409 Hoewok 2 Fall 2010 1. Eueate the equivalece classes of siple gaphs o 5 vetices by usig the patte ivetoy as a guide. The cycle idex of S 5 actig o 5 vetices is 1 x 5 120 1 10 x 3 1 x 2 15 x 1
More informationEnumerative & Asymptotic Combinatorics
C50 Eumerative & Asymptotic Combiatorics Notes 4 Sprig 2003 Much of the eumerative combiatorics of sets ad fuctios ca be geeralised i a maer which, at first sight, seems a bit umotivated I this chapter,
More informationx !1! + 1!2!
4 Euler-Maclauri Suatio Forula 4. Beroulli Nuber & Beroulli Polyoial 4.. Defiitio of Beroulli Nuber Beroulli ubers B (,,3,) are defied as coefficiets of the followig equatio. x e x - B x! 4.. Expreesio
More informationPROBLEM SET 5 SOLUTIONS 126 = , 37 = , 15 = , 7 = 7 1.
Math 7 Sprig 06 PROBLEM SET 5 SOLUTIONS Notatios. Give a real umber x, we will defie sequeces (a k ), (x k ), (p k ), (q k ) as i lecture.. (a) (5 pts) Fid the simple cotiued fractio represetatios of 6
More informationLecture Outline. 2 Separating Hyperplanes. 3 Banach Mazur Distance An Algorithmist s Toolkit October 22, 2009
18.409 A Algorithist s Toolkit October, 009 Lecture 1 Lecturer: Joatha Keler Scribes: Alex Levi (009) 1 Outlie Today we ll go over soe of the details fro last class ad ake precise ay details that were
More informationBooks Recommended for Further Reading
Books Recommeded for Further Readig by 8.5..8 o 0//8. For persoal use oly.. K. P. Bogart, Itroductory Combiatorics rd ed., S. I. Harcourt Brace College Publishers, 998.. R. A. Brualdi, Itroductory Combiatorics
More informationChapter 4. Fourier Series
Chapter 4. Fourier Series At this poit we are ready to ow cosider the caoical equatios. Cosider, for eample the heat equatio u t = u, < (4.) subject to u(, ) = si, u(, t) = u(, t) =. (4.) Here,
More information18.S34 (FALL, 2007) GREATEST INTEGER PROBLEMS. n + n + 1 = 4n + 2.
18.S34 (FALL, 007) GREATEST INTEGER PROBLEMS Note: We use the otatio x for the greatest iteger x, eve if the origial source used the older otatio [x]. 1. (48P) If is a positive iteger, prove that + + 1
More informationDifferent kinds of Mathematical Induction
Differet ids of Mathematical Iductio () Mathematical Iductio Give A N, [ A (a A a A)] A N () (First) Priciple of Mathematical Iductio Let P() be a propositio (ope setece), if we put A { : N p() is true}
More informationModel Theory 2016, Exercises, Second batch, covering Weeks 5-7, with Solutions
Model Theory 2016, Exercises, Secod batch, coverig Weeks 5-7, with Solutios 3 Exercises from the Notes Exercise 7.6. Show that if T is a theory i a coutable laguage L, haso fiite model, ad is ℵ 0 -categorical,
More informationMATH 205 HOMEWORK #2 OFFICIAL SOLUTION. (f + g)(x) = f(x) + g(x) = f( x) g( x) = (f + g)( x)
MATH 205 HOMEWORK #2 OFFICIAL SOLUTION Problem 2: Do problems 7-9 o page 40 of Hoffma & Kuze. (7) We will prove this by cotradictio. Suppose that W 1 is ot cotaied i W 2 ad W 2 is ot cotaied i W 1. The
More informationLecture Notes for CS 313H, Fall 2011
Lecture Notes for CS 313H, Fall 011 August 5. We start by examiig triagular umbers: T () = 1 + + + ( = 0, 1,,...). Triagular umbers ca be also defied recursively: T (0) = 0, T ( + 1) = T () + + 1, or usig
More information19.1 The dictionary problem
CS125 Lecture 19 Fall 2016 19.1 The dictioary proble Cosider the followig data structural proble, usually called the dictioary proble. We have a set of ites. Each ite is a (key, value pair. Keys are i
More informationA brief introduction to linear algebra
CHAPTER 6 A brief itroductio to liear algebra 1. Vector spaces ad liear maps I what follows, fix K 2{Q, R, C}. More geerally, K ca be ay field. 1.1. Vector spaces. Motivated by our ituitio of addig ad
More informationRandom Models. Tusheng Zhang. February 14, 2013
Radom Models Tusheg Zhag February 14, 013 1 Radom Walks Let me describe the model. Radom walks are used to describe the motio of a movig particle (object). Suppose that a particle (object) moves alog the
More informationZeros of Polynomials
Math 160 www.timetodare.com 4.5 4.6 Zeros of Polyomials I these sectios we will study polyomials algebraically. Most of our work will be cocered with fidig the solutios of polyomial equatios of ay degree
More informationSOLVED EXAMPLES
Prelimiaries Chapter PELIMINAIES Cocept of Divisibility: A o-zero iteger t is said to be a divisor of a iteger s if there is a iteger u such that s tu I this case we write t s (i) 6 as ca be writte as
More informationMeasure and Measurable Functions
3 Measure ad Measurable Fuctios 3.1 Measure o a Arbitrary σ-algebra Recall from Chapter 2 that the set M of all Lebesgue measurable sets has the followig properties: R M, E M implies E c M, E M for N implies
More informationsubcaptionfont+=small,labelformat=parens,labelsep=space,skip=6pt,list=0,hypcap=0 subcaption ALGEBRAIC COMBINATORICS LECTURE 8 TUESDAY, 2/16/2016
subcaptiofot+=small,labelformat=pares,labelsep=space,skip=6pt,list=0,hypcap=0 subcaptio ALGEBRAIC COMBINATORICS LECTURE 8 TUESDAY, /6/06. Self-cojugate Partitios Recall that, give a partitio λ, we may
More informationX. Perturbation Theory
X. Perturbatio Theory I perturbatio theory, oe deals with a ailtoia that is coposed Ĥ that is typically exactly solvable of two pieces: a referece part ad a perturbatio ( Ĥ ) that is assued to be sall.
More informationMath 4107: Abstract Algebra I Fall Webwork Assignment1-Groups (5 parts/problems) Solutions are on Webwork.
Math 4107: Abstract Algebra I Fall 2017 Assigmet 1 Solutios 1. Webwork Assigmet1-Groups 5 parts/problems) Solutios are o Webwork. 2. Webwork Assigmet1-Subgroups 5 parts/problems) Solutios are o Webwork.
More informationChapter 1 : Combinatorial Analysis
STAT/MATH 394 A - PROBABILITY I UW Autum Quarter 205 Néhémy Lim Chapter : Combiatorial Aalysis A major brach of combiatorial aalysis called eumerative combiatorics cosists of studyig methods for coutig
More informationCommutativity in Permutation Groups
Commutativity i Permutatio Groups Richard Wito, PhD Abstract I the group Sym(S) of permutatios o a oempty set S, fixed poits ad trasiet poits are defied Prelimiary results o fixed ad trasiet poits are
More informationA sequence of numbers is a function whose domain is the positive integers. We can see that the sequence
Sequeces A sequece of umbers is a fuctio whose domai is the positive itegers. We ca see that the sequece,, 2, 2, 3, 3,... is a fuctio from the positive itegers whe we write the first sequece elemet as
More information( ) GENERATING FUNCTIONS
GENERATING FUNCTIONS Solve a ifiite umber of related problems i oe swoop. *Code the problems, maipulate the code, the decode the aswer! Really a algebraic cocept but ca be eteded to aalytic basis for iterestig
More informationTHE ASYMPTOTIC COMPLEXITY OF MATRIX REDUCTION OVER FINITE FIELDS
THE ASYMPTOTIC COMPLEXITY OF MATRIX REDUCTION OVER FINITE FIELDS DEMETRES CHRISTOFIDES Abstract. Cosider a ivertible matrix over some field. The Gauss-Jorda elimiatio reduces this matrix to the idetity
More informationDiscrete Math Class 5 ( )
Discrete Math 37110 - Class 5 (2016-10-11 Istructor: László Babai Notes tae by Jacob Burroughs Revised by istructor 5.1 Fermat s little Theorem Theorem 5.1 (Fermat s little Theorem. If p is prime ad gcd(a,
More informationTutorial F n F n 1
(CS 207) Discrete Structures July 30, 203 Tutorial. Prove the followig properties of Fiboacci umbers usig iductio, where Fiboacci umbers are defied as follows: F 0 =0,F =adf = F + F 2. (a) Prove that P
More informationSequences A sequence of numbers is a function whose domain is the positive integers. We can see that the sequence
Sequeces A sequece of umbers is a fuctio whose domai is the positive itegers. We ca see that the sequece 1, 1, 2, 2, 3, 3,... is a fuctio from the positive itegers whe we write the first sequece elemet
More information(1 x n ) 1, (1 + x n ). (1 + g n x n ) r n
COMBINATORIAL ANALYSIS OF INTEGER POWER PRODUCT EXPANSIONS HGINGOLD, WEST VIRGINIA UNIVERSITY, DEPARTMENT OF MATHEMATICS, MORGANTOWN WV 26506, USA, GINGOLD@MATHWVUEDU JOCELYN QUAINTANCE, UNIVERSITY OF
More informationLecture 10: Bounded Linear Operators and Orthogonality in Hilbert Spaces
Lecture : Bouded Liear Operators ad Orthogoality i Hilbert Spaces 34 Bouded Liear Operator Let ( X, ), ( Y, ) i i be ored liear vector spaces ad { } X Y The, T is said to be bouded if a real uber c such
More informationGROUPOID CARDINALITY AND EGYPTIAN FRACTIONS
GROUPOID CARDINALITY AND EGYPTIAN FRACTIONS JULIA E. BERGNER AND CHRISTOPHER D. WALKER Abstract. I this paper we show that two very ew questios about the cardiality of groupoids reduce to very old questios
More information(s)h(s) = K( s + 8 ) = 5 and one finite zero is located at z 1
ROOT LOCUS TECHNIQUE 93 should be desiged differetly to eet differet specificatios depedig o its area of applicatio. We have observed i Sectio 6.4 of Chapter 6, how the variatio of a sigle paraeter like
More informationarxiv: v1 [math.nt] 10 Dec 2014
A DIGITAL BINOMIAL THEOREM HIEU D. NGUYEN arxiv:42.38v [math.nt] 0 Dec 204 Abstract. We preset a triagle of coectios betwee the Sierpisi triagle, the sum-of-digits fuctio, ad the Biomial Theorem via a
More informationBasic Counting. Periklis A. Papakonstantinou. York University
Basic Coutig Periklis A. Papakostatiou York Uiversity We survey elemetary coutig priciples ad related combiatorial argumets. This documet serves oly as a remider ad by o ways does it go i depth or is it
More informationand each factor on the right is clearly greater than 1. which is a contradiction, so n must be prime.
MATH 324 Summer 200 Elemetary Number Theory Solutios to Assigmet 2 Due: Wedesday July 2, 200 Questio [p 74 #6] Show that o iteger of the form 3 + is a prime, other tha 2 = 3 + Solutio: If 3 + is a prime,
More informationSOME FINITE SIMPLE GROUPS OF LIE TYPE C n ( q) ARE UNIQUELY DETERMINED BY THEIR ELEMENT ORDERS AND THEIR ORDER
Joural of Algebra, Nuber Theory: Advaces ad Applicatios Volue, Nuber, 010, Pages 57-69 SOME FINITE SIMPLE GROUPS OF LIE TYPE C ( q) ARE UNIQUELY DETERMINED BY THEIR ELEMENT ORDERS AND THEIR ORDER School
More informationOn an Algorithm for Isomorphism-Free Generations of Combinatorial Objects
O a Algorith for Isoorphis-Free Geeratios of Cobiatorial Objects Krasiir Yordzhev Faculty of Matheatics ad Natural Scieces South-West Uiversity, Blagoevgrad, Bulgaria yordzhev@swubg Abstract: I the wor
More informationNICK DUFRESNE. 1 1 p(x). To determine some formulas for the generating function of the Schröder numbers, r(x) = a(x) =
AN INTRODUCTION TO SCHRÖDER AND UNKNOWN NUMBERS NICK DUFRESNE Abstract. I this article we will itroduce two types of lattice paths, Schröder paths ad Ukow paths. We will examie differet properties of each,
More informationUniversity of Twente The Netherlands
Faculty of Mathematical Scieces t Uiversity of Twete The Netherlads P.O. Box 7 7500 AE Eschede The Netherlads Phoe: +3-53-4893400 Fax: +3-53-48934 Email: memo@math.utwete.l www.math.utwete.l/publicatios
More information(ii) Two-permutations of {a, b, c}. Answer. (B) P (3, 3) = 3! (C) 3! = 6, and there are 6 items in (A). ... Answer.
SOLUTIONS Homewor 5 Due /6/19 Exercise. (a Cosider the set {a, b, c}. For each of the followig, (A list the objects described, (B give a formula that tells you how may you should have listed, ad (C verify
More informationA string of not-so-obvious statements about correlation in the data. (This refers to the mechanical calculation of correlation in the data.
STAT-UB.003 NOTES for Wedesday 0.MAY.0 We will use the file JulieApartet.tw. We ll give the regressio of Price o SqFt, show residual versus fitted plot, save residuals ad fitted. Give plot of (Resid, Price,
More informationMATH10212 Linear Algebra B Proof Problems
MATH22 Liear Algebra Proof Problems 5 Jue 26 Each problem requests a proof of a simple statemet Problems placed lower i the list may use the results of previous oes Matrices ermiats If a b R the matrix
More information(k) x n. n! tk = x a. (i) x p p! ti ) ( q 0. i 0. k A (i) n p
Math 880 Bigraded Classes & Stirlig Cycle Numbers Fall 206 Bigraded classes. Followig Flajolet-Sedgewic Ch. III, we defie a bigraded class A to be a set of combiatorial objects a A with two measures of
More informationPermutations & Combinations. Dr Patrick Chan. Multiplication / Addition Principle Inclusion-Exclusion Principle Permutation / Combination
Discrete Mathematic Chapter 3: C outig 3. The Basics of Coutig 3.3 Permutatios & Combiatios 3.5 Geeralized Permutatios & Combiatios 3.6 Geeratig Permutatios & Combiatios Dr Patrick Cha School of Computer
More information4 The Sperner property.
4 The Sperer property. I this sectio we cosider a surprisig applicatio of certai adjacecy matrices to some problems i extremal set theory. A importat role will also be played by fiite groups. I geeral,
More informationIntroduction To Discrete Mathematics
Itroductio To Discrete Mathematics Review If you put + pigeos i pigeoholes the at least oe hole would have more tha oe pigeo. If (r + objects are put ito boxes, the at least oe of the boxes cotais r or
More informationMATH 324 Summer 2006 Elementary Number Theory Solutions to Assignment 2 Due: Thursday July 27, 2006
MATH 34 Summer 006 Elemetary Number Theory Solutios to Assigmet Due: Thursday July 7, 006 Departmet of Mathematical ad Statistical Scieces Uiversity of Alberta Questio [p 74 #6] Show that o iteger of the
More informationFourier Series and the Wave Equation
Fourier Series ad the Wave Equatio We start with the oe-dimesioal wave equatio u u =, x u(, t) = u(, t) =, ux (,) = f( x), u ( x,) = This represets a vibratig strig, where u is the displacemet of the strig
More informationpage Suppose that S 0, 1 1, 2.
page 10 1. Suppose that S 0, 1 1,. a. What is the set of iterior poits of S? The set of iterior poits of S is 0, 1 1,. b. Give that U is the set of iterior poits of S, evaluate U. 0, 1 1, 0, 1 1, S. The
More informationq-fibonacci polynomials and q-catalan numbers Johann Cigler [ ] (4) I don t know who has observed this well-known fact for the first time.
-Fiboacci polyoials ad -Catala ubers Joha Cigler The Fiboacci polyoials satisfy the recurrece F ( x s) = s x = () F ( x s) = xf ( x s) + sf ( x s) () with iitial values F ( x s ) = ad F( x s ) = These
More informationMath 61CM - Solutions to homework 3
Math 6CM - Solutios to homework 3 Cédric De Groote October 2 th, 208 Problem : Let F be a field, m 0 a fixed oegative iteger ad let V = {a 0 + a x + + a m x m a 0,, a m F} be the vector space cosistig
More information