ay? ox? Se Wi UtTon § Student Name and ID Number MATH 3012, Quiz 3, November 16, 2017, WIT 1. Consider the poset 27 consisting of all subsets of [17] = {1,2,...,17}, partially ordered by a. The height of this poset is: 18 17) also (‘7) b. The width of this poset is: 3 \ 7 c. The number of maximal chains in this poset is: fF | 4. The number of maximal chains in this poset passing through the subset {2,3,8,10, 14} is: $i 12! 2. This question concerns inclusion-exclusion. a, How many permutations of the integers in [17] satisfy the requirements that o(3) = 3, o(7) and o(14) = 14? yee b. Write the inclusion- exergy form for dy;, the ee of derangements of the integers in Ut (2% ae Sey (re!) [4 eo c. How many functions from [10] to (7| satisfy the requirement that neither 2 nor 6 is in the range of the function? 10 s Write the inclusion-exelusion formula for $(20, the number ofsupjections from [10] to [7] st, = Zev (Fa Ce =0 ce. For the integer n = 3*-5°-78, how many integers in [n] are divisible by 3 and 7? You may give your answer in terms of n, using multiplication and division. 3 £, Write out the inclusion-exclusion formula for #(n) for this particular value of n. Again, you do not have to carry out any arithmetic in your answer gin) 2 cis) I$) FI3. This question concems generating functions. a, Find a partition of 87 into 5 distinet parts: _ covreck Ansuee AT +OtBr2e! Mang 'b. Find a partition of 37 into 5 odd parts: t OieF th 4s +? Nock c. Write in product form the generating function for the number of partitions of an integer n into distinct parts: : ; 3 ¥ se) Cl ext) --- (two Crt) Chex?) Lit J Coes) lex d. Wiite in product form the generating functioa for the number of partitions of an integer n into odd parts: / : fife ee Feng Tox —_ lek e. Write in closed form the function whose Taylor series is 7%.9 (2")2". (/~ 4x) 2 @ 4. This question concerns advancement operator equations. Find th grr sltion to th achaoemansopeatr ation: 38 at (2-81) (4-44 7) %(A~ 5)4F(n) = n £ln)2e, A-F) cant Fis a eye +G ne “ (a=nf(0) =3-7 rh F 9 a=3 + = dene? ‘ Tne on in) done a Ata 2 BAe a wee ic ain) ‘aati: Fda? arn ets c. Find the solution to the advancemert operator equation: (A? =8A415)f(n) =0, (0) =2 and f(1) = 22. as) a>) =? eds CSS QF L pe\E Le, bee x $d 7 BG FS Eo f b 2, the cover graph of 2" has a hemiltonian cycle. 2. 3 4, For all n > 1, the subset lattice 2” has a Dilworth partition using symmetric chains. in 2°, the following sete form a symmetric chcin: (2,5), (2,4,5), (24,5,8} and {1,2,4,5,8}} ‘The number of partitions of an integer n into even parts is equal to the number of partitions of n into parts, all of which have the same size, Generating functions of the form f(x) = S%,,a,2” are only applied in combinatorics when they are a Taylor series. When p(A) is a polynomial in the advancement operator A and the degree of this polynomial is d = 5.74, the solution space to the equation p(A) f(n) is a vector space whose dimension is d(1 — 1/5)(1 1/7), To implement Kruskal’s algorithin, it is not necessary to sort the edges by weight. One can simply take the edges in any order and take the first one avoiding a cycle when added to those edges already chosen. Dijkstra’s algorithm finds shortest paths having the maximmm number of edges. ‘Weakly convergent generating operators which span Kruskal products have dimension at most the Spemer width of hamiltonian advancements. Gyadnn Summer a $2 Tests scored Bown 6D ie, 2. 13 aie we still gee 3. 15 tl. ¥ 1 c: 16 oe 15 t. z a —— oTAL 99