A combinatorial problem associated with nonograms

Size: px
Start display at page:

Download "A combinatorial problem associated with nonograms"

Transcription

1 A combnatoral problem assocated wth nonograms Jessca Benton Ron Snow Nolan Wallach March 21, Introducton. Ths work was motvated by a queston posed by the second named author to the frst named author about a game that goes by many names but we wll refer to t here as the nonogram game. We frst descrbe a nonogram. The startng pont s an m n board wth all squares whte. One puts black squares n a selecton of postons on the board for example: We have a pcture n a 5 5 board. Now one looks at each row and puts together a sequence of postve ntegers that gves a lst of the numbers of contguous black squares and one gets a sequence of m lsts. One does the same for the columns gettng n lsts. The nonogram s ths par of lsts of lsts. Thus the nonogram assocated wth the above pcture s [[1, 1], [3], [1, 1], [2, 2], [3]], [[1], [5], [1, 1], [5], [1]]. The puzzle s to be gven a nonogram and to construct a pcture that yelds t. Thus the pcture above s a soluton to the correspondng nonogram. One can see easly that ths nonogram has a unque soluton (.e. pcture). We note that the two pctures below are solutons to [[1, 1], [1], [1, 1], [1, 1], [1, 1]], [[1, 1], [2], [1], [2], [1, 1]]. 1

2 There are also nonograms that are not related to pctures. For example, [[5], [1, 1, 1], [1], [1], [1]], [[1, 2], [5], [1], [1], [1]]. No good algorthms have been found to determne f a nonogram corresponds to a pcture and, f so, fnd a pcture. In fact, ths leads to an NP-complete problem. Havng descrbed the actual puzzle let us descrbe the queston. We smplfy the nonogram and replace the arrays of arrays wth row sums and column sums where we thnk of the orgnal pcture as an m n matrx wth entres consstng of 0 or 1. Thus the frst pcture above yelds (2, 3, 2, 4, 3) for the rows and (1, 5, 2, 5, 1) for the columns. The second par gve (2, 1, 2, 2, 2), (2, 2, 1, 2, 2). The queston s how many possble pars of row sums and column sums are there for m n matrces wth entres consstng only of 0 or 1? Is there a method of fndng all such possbltes? For example the mpossble nonogram above corresponds to (5, 3, 1, 1, 1), (3, 5, 1, 1, 1) whch s not even possble as a row and column sum of such a 5 5 matrx. The second named author found that for 1 1, 2 2, 3 3, 4 4 the number of such s respectvely, 2, 15, 328, In ths paper we gve a method of answerng both questons. It s very ntrgung that ths seemngly nnocent queston led us to look at farly deep aspects of the combnatorcs of the symmetrc group and a further property of Young s rasng operators (actually we do lowerng) and Schur functons. We also develop a q analogue of the queston and a conjecture about dvsblty by the q-analogue of n + 1, for the case of n n matrces (notce that the numbers above are respectvely dvsble by 2, 3, 4, 5). D. Goldsten and R. Stong [GS] have proved recurson formula for ths q analogue and n partcular gve a relatvely fast recurson to count the possble pars and a proof of the conjecture. Goldsten and Stong have ponted out to the authors that the man theorem n ths paper, Theorem 6, can be found n the standard lterature (cf. [BR] and [vlw]). Our method of proof s dfferent and t yelds an algorthm for constructng the pertnent matrces. 2 Row and column sum. We denote by B m,n the set of all m n matrces wth entres n the set {0, 1}. If M B m,n then we wrte M = [m j ]. We set x (M) = j m j for = 1,..., m and set y j (M) = m j for j = 1,..., n. We put x(m) = (x 1 (M), x 2 (M),..., x m (M)) and y(m) = (y 1 (M), y 2 (M),..., y n (M)). In what follows we the notaton wll not be consstent wth rght and left actons of groups. The lemma below should clarfy the nconsstences. If σ S m and f M = [m j ] s an m n matrx then we set σm = [m σ,j ] and f σ S n then we set Mσ = [m,σj ]. If v = (v 1,..., v n ) then we set vσ = (v σ1,..., v σn ) for σ S n. The followng result s proved by the obvous calculaton. 2

3 Lemma 1 Wth these notatons n place we have x(σm) = x(m)σ, y(σm) = y(m) and x(mσ) = x(m), y(mσ) = y(m)σ. We set RC(m, n) = {(x, y) x = x(m), y = y(m), M B m,n }. We are nterested n calculatng ths functon. We set RC(m, n) = {(x, y) x = x(m), y = y(m), M B m,n }. Clearly, RC(m, n) = RC(m, n). We wll now gve a prelmnary descrpton of RC(m, n). We say that an element x N n s domnant f x x +1 for = 1,..., n 1. If x N n then there exsts a unque domnant element of the form xσ wth σ S n. Set RC + (m, n) = {(x, y) RC(m, n) x, y domnant }. If x N n s domnant then we set orb n (x) = {xσ σ S n }. For such x we defne l 1,..., l p > 0 wth l l p = n and x 1 =... = x l1, x l1+1 =... = x l1+l 2, x l1+l 2+1 =... = x l1+l 2+l 3,... Then orb n (x) = n! l. We set λ 1! l p! n(x) = (l 1,..., l p ). If α N p then we set α! = α 1! α p!. Lemma 2 We have RC(m, n) = (x,y) RC +(m,n) orb m (x) orb n (y) = m!n! (x,y) RC +(m,n) 1 λ m (x)!λ n (y)!. Our problem s thus to determne the elements of RC + (m, n). If x = (x 1,..., x m ) s domnant and x 1 n then we can defne M B m,n by m 1 = 1 for = 1,..., x 1, m 2 = 1 for = 1,..., x 2, etc. and all other entres 0. Then x = x(m) and we set µ(x) = y(m). In the theory of parttons µ(x) s the dual partton of x possbly expanded to have n rows by ncludng 0 rows. We note that (x, µ(x)) RC + (m, n). If x s domnant and x 1 n then we set Y (x) = {y (x, y) RC + (m, n)}. Thus µ(x) Y (x). We now defne two orders on N n. (N ={0, 1, 2,...}). The frst s the lexcographc order that s x > y f x = y for < j and x j > y j. The other s the root order (or domnance order) whch s only a partal order that s x y f (x y ) 0 for all j = 1,..., n and at least one of these sums s postve. If j 0 r mn we defne ν r = ν r,m,n a domnant element of N n as follows: Let c 0 be defned by (c 1)n < r cn. Then snce r mn we see that 0 c m. Defne (ν r ) = c for = 1,..., r (c 1)n, and (ν r ) = c 1 for > r (c 1)n. Notce that f r = 0 then c = 0 and r (c 1)n = n so ν 0 = (0,..., 0). If 0 < r n then c = 1 and ν r = (1, 1,..., 1, 0,..., 0) wth r ones. If r > n then c > 1 we have ν r s domnant and (ν r ) = c(r (c 1)n) + (c 1)(n r + (c 1)n) = c(r (c 1)n) + (c 1)(cn r) = r. 3

4 In general f x N n then we set x = x x n. Lemma 3 Let 0 r mn and let P m,n (r) denote the set of all x domnant wth x m and x = r. Then ν r,m,n s the unque mnmal element n P m,n (r) relatve to both the lexcographc and the root order. Proof. Let x P m,n (r) and suppose that x 1 < c then x 1 c 1 thus x (c 1)n < r. Set k = r (c 1)n. Then f x = c for < j k and x j < c then the same argument shows that x < r. Thus we must have x = c for = 1,..., k. Now assume that x = r and x ν n the lexcographc order. Thus we have x = c for = 1,..., k and x k+1 c 1. If x = c 1 for = k + 1,..., k + l 1 but x k+l < c 1 then x < r. Thus the asserton about the lexcographc order follows. We wll now prove the asserton about the root order. We frst observe that f x, y N n and f x y and f x = y then x = y + <j a j (e e j ) wth e the usual vector wth a one n the -th poston and all the other entres 0 wth each a j a non-negatve nteger and some a j > 0. Assume that a j = 0 for < o and a = a oj > 0. Then x = y for < o and x o = y o + a > y o. j Thus f x y then x > y. Ths mples that ν r s a mnmal element relatve to the root order. We wll now show that t s the only one. We note that λ(ν r ) = (r (c 1)n, cn r) (f c = 0 then r = 0 and we should nterpret ths as only havng one entry, smlarly for r = un so c = u). If x P m,n (r) and f x x +1 2 then x e +e +1 P m,n (r). So x cannot be mnmal n P m,n (r). Thus f x s mnmal then x x Suppose now that λ(x) = (l 1,..., l p ) wth p 3. Then x e l1 + e l1+l 2+1 P m,n (r). Thus f x s mnmal wth respect to the root order then p = 1 or 2. If p = 1 then x = (u,..., u) and so r = un and ν r = x. If p = 2 then f x were mnmal then x 1 = u and x l1+1 = u 1. Thus we have and ul 1 + (u 1)l 2 = r l 1 + l 2 = n. Hence l 2 = un r. Snce l 2 > 0 we see that u c. If u > c then l 1 = n l 2 = n un + r = r (u 1)n < 0. Thus u = c so x = ν r. The technque n the proof of the precedng lemma suggests some operatons on the elements of RC + (m, n) whch we wll make precse n the next secton. 3 Some operatons on domnant elements If x P m,n (r) recall that Y (x) = {y P m,n (r) (x, y) RC + (m, n)}. In ths secton we study two operatons on Y (x) that decrease elements n the root order. 4

5 Move 1. If y Y (x) and y y +1 > 1 then y e + e +1 Y (x). Indeed, let M B m,n be such that x = x(m) and y = y(m). Suppose that m k = 1 mples that m k+1 = 1 for all k = 1,..., n. Then y y +1. Snce we have assumed the contrary, there exsts k so that m k = 1 and m k+1 = 0. Thus f M = [m rs] wth m rs = m rs for (r, s) / {(k, ), (k, + 1)} and m k = 0, m k+1 = 1 then x(m ) = x and y(m ) = y e + e +1. Snce y y , y e + e +1 s domnant. Move 2. If y Y (x) and f y > y +1 y y +k > y +k+1 then y e + e +k+1 Y (x). Indeed, let M B m,n be such that x = x(m) and y = y(m). Argung as n the justfcaton of Move 1 we see that there exsts 1 l n wth m l = 1 and m l,+k+1 = 0. Defne M as above to have all entres but the ones n the l, and the l, +k+1 postons the same as those of M but wth the two ndcated values nterchanged. Then as above x = x(m ) and y e + e +k+1 = y(m ) Y (x). Lemma 4 Let 0 r mn and let x P m (r). Then µ(x) s the maxmum element of Y (x) wth respect to the lexcographc order and t s the unque maxmal element of Y (x) wth respect to the root order. Also ν m,n,r s the mnmal element n Y (x) wth respect to the lexcographc order and the unque mnmal element n Y (x) wth respect to the root order. Proof. Let z = µ(x) and let y Y (x). Let M B n be such that x(m) = x and y(m) = y. Then we note that the number of j wth m j,1 = 1 s equal to y 1 and s less than the number of j such that x j 0. Thus y 1 z 1 and f y 1 = z 1 then m j1 = 1 precsely f x j 0. We show by nducton that f y = z for k 1 then y k z k and f y k = z k then m jk = 1 precsely when x j k. We have proved ths for k = 1. Assume for k l and we wll now prove t for k = l + 1. Suppose that y k > z k. Then then the number of j such that m jk = 1 s larger than the number of l such that x l k. Thus there exsts l wth x l k 1 and m l,k = 1. The nductve hypothess mples that m ls = 1 for s = 1,..., x l. But then f m l,k = 1 we would have x l > x l. Ths contradcton shows that y k z k and that m jk = 1 mples that x j k. We have observed that of α β then α > β. Ths shows that z = µ(x) s maxmal n Y (x) n the root order. Set Ỹ (x) = {y (x, y) RC(m, n)}. Suppose that y Ỹ (x) s maxmal n the root order. Then we assert that y Y (x) (we wll leave ths as an exercse to the reader). Thus the maxmal elements of Y (x) are exactly the same as those of Ỹ (x). Now let y Y (x) be maxmal n the root order. Let M B m,n be such that x(m) = x and y(m) = y. Suppose that y 1 < z 1. Then the number f ndces such that m j,1 = 1 must be less than the number of j such that x j > 0. Hence there s a j wth x j > 0 and m j,1 = 0. Hence there must be a k > 1 wth m j,k = 1. If we defne M to have the same entres as M except that m j,1 = 1and m j,k = 0 then x(m ) = x and y(m ) = y + e 1 e k. Thus y(m ) y n Ỹ (x). Ths s a contradcton. Now suppose that we have shown that y = z for k 1. But y k < z k. Then we can apply the argument n the 5

6 prevous part to see that x j k 1 f and only f m jl = 1 for j k 1. Now snce y k < z k there must be an ndex j such that x j k but m jk = 0. There must therefore be an ndex s > k wth m js = 1. We can therefore argue as n the case when k = 1 to see that y + e k e s Ỹ (x). The obvous nducton now shows that y s greater than z n the lexcographc order. The last asserton s mpled by Lemma 3. Theorem 5 Let 0 r mn and let x P m (r). P n (r) µ(x) y ν r }. Then Y (x) = {y We wll actually prove a much more general result. In the followng P n (r) can be replaced by the set of all domnant n-tuples wth non-negatve entres that sum to r. The condton that the entres need be at most m can be dropped. Theorem 6 Let z, y P n (r) wth z y then there exst elements z () P n (r), = 0,..., m such that z (0) = z and z (m) = y and z (+1) s obtaned from z () by a Move 1 or a Move 2. Theorem 5 follows from Theorem 6. Indeed, we have observed that these moves preserve Y (x). So applyng Theorem 6 to µ(x) we wll have proved Theorem 5. We note that the proof we gve of Theorem 6 actually gves an algorthm for the constructon of the connectng sequence. Here s a demonstraton. Consder z = (7, 5, 5, 3, 3, 3, 2) and y = (5, 5, 4, 4, 4, 4, 2). Then z y = (2, 0, 1, 1, 1, 1, 0). So z y. The method of the proof below would choose z (1) = (6, 6, 5, 3, 3, 3, 2) by Move 1, z (2) = (6, 5, 5, 4, 3, 3, 2) Move 2, z (3) = (5, 5, 5, 5, 3, 3, 2) Move 2, z (4) = (5, 5, 5, 4, 4, 3, 2) Move 1, z (5) = (5, 5, 4, 4, 4, 2) Move 2. We wll now prove Theorem 6. We wll prove the theorem by nducton on z n the order. If z s the mnmal element, ν r, of P n (r) the result s obvous snce then y = ν r and we take m = 0. So assume the result for all u P n (r) wth z u. We now prove the result for z. If z = y then there s nothng to prove. Thus there exsts o such that z = y for o and z o > y o. If z o > z o then we may apply Move 1 to z and get z (1). We show that z (1) y. Indeed we have z (1) 1 = y 1, z (1) 2 = y 2,..., z (1) = y o 1 o 1 thus (z (1) y ) = 0 for j < o. (z (1) y ) = z o y o 1 0 and j o (z (1) y ) = (z y ) for k > o. Snce z z (1) the nductve hypothess k k mples the result n ths case. We may thus assume that z o z o If z o = z o Then snce we have z o > y o y o+1 we see that z o+1 y o+1. Now suppose that we have z j = z o+1 for all j o + 1. Then t s easly seen (argung as n the proof of the mnmalty of ν r ) that ths s 6

7 mpossble. Thus there exsts a frst j such that j o + 1 and z j > z j+1. We can apply Move 2 to z and get z (1) = z e o + e j+1. We wll now show that z (1) y whch wll complete the nducton n ths case. We note that we have z o+1 =... = z j > z j+1. Snce y o+1... y j y j+1 we have z k y k for o + 1 k j. Ths mples that (z (1) y ) 0 for k j. Now 0 and (z (1) k (z (1) j+1 k y ) = (z (1) y )+z j+1 y j+1 +1 = (z y ) j j+1 y ) = (z y ) 0 for k > j + 1. Thus z (1) y. k We are left wth the case when z o = z o+1. We note that snce z = x there must be a frst j such that z k = z o for k j and z j+1 < z j.. There are two cases. Frst, f z j > z j Then we can do Move 1 to get z (1) = z e j +e j+1. As n the other cases we have z k > y k for all k = o,..., j. So the argument for the frst part of the proof mples that z (1) y. We may thus assume that z j = z j Now as above there must be another descent that s l > j such that z k = z j+1 for j + 1 k l and z l > z l+1. We now do Move 2 to get z (1) = z e j + e l+1. We note that as before z k y k for j + 1 k l and so the argument above mples that z (1) y. The proof s now complete. 4 A q-analogue In ths secton we wll study RC(q, m, n) = (x,y) RC(m.n) q x. The results of the prevous secton mply that RC(q, m, n) = m!n! r q r x P m(r) 1 λ m (x)! y P n (r) µ(x) y 1 λ n (y)!. We note that the polynomal RC(q, n, n) s of degree n 2 and that t s easly seen that the coeffcent of q j s the same as that of q n2 j for 0 j n 2. Conjecture 7 The polynomal RC(q, n, n) = RC(q, n) s evenly dvsble by 1 + q + q q n. Here are some examples. RC(q, 1) = 1 + q. RC(q, 2) = (1 + q + q 2 )(1 + 3q + q 2 ) 7

8 RC(q, 3) = (1 + q + q 2 + q 3 )(1 + 8q + 18q q q 4 + 8q 5 + q 6 ) Ths conjecture has been proved by D. Goldsten and R. Stong. They also prove that the polynomals P (m, n) = RC(q, m, n) satsfy the followng recurson. Set [m + 1] q = 1 + q q m. Then 1. P (0, n) = 1 for n P (m, n) = P (n, m). 3. If m n then P (m, n) = m ( 1) +1( m =1 ) [m + 1] P (m, n ). Obvously, ths proves the conjecture. Note that ths mples that P (1, n) = (q + 1) n. so we could add ths to stop the recurson at m = 1. Ths recurson s easly mplemented n Mathematca or Maple. Here s a sample Mathematca code (you wll have to type out the exponents): P[m, n ] := Block[{}, If[m == 0, Return[1]]; If[n <m, Return[P[n, m]]]; If[m == 1, Return[(1 + q) n ]]; Return[ Expand[ Sum[(-1) +1 Bnomal[m, ](Factor[(1 - q m+1 )/(1 -q)] )* P[m, n - ], {, 1, m}]]]] References q [BR]R.H.Bruald and H.J.Ryser, Combnatoral Matrx Theory,Cambrdge Unversty Press, [GS] Danel Goldsten and Rchard Stong, On the number of possble row and column sums of 0,1-matrces, Preprnt. [vlw] J.H.van Lnt and R.M.Wlson. A course n combnatorcs. Cambrdge Unversty Press,

A combinatorial problem associated with nonograms

A combinatorial problem associated with nonograms Lnear Algebra and ts Applcatons 412 (2006) 30 38 www.elsever.com/locate/laa A combnatoral problem assocated wth nonograms Jessca Benton, Ron Snow, Nolan Wallach Department of Mathematcs, Unversty of Calforna-San

More information

First day August 1, Problems and Solutions

First day August 1, Problems and Solutions FOURTH INTERNATIONAL COMPETITION FOR UNIVERSITY STUDENTS IN MATHEMATICS July 30 August 4, 997, Plovdv, BULGARIA Frst day August, 997 Problems and Solutons Problem. Let {ε n } n= be a sequence of postve

More information

Foundations of Arithmetic

Foundations of Arithmetic Foundatons of Arthmetc Notaton We shall denote the sum and product of numbers n the usual notaton as a 2 + a 2 + a 3 + + a = a, a 1 a 2 a 3 a = a The notaton a b means a dvdes b,.e. ac = b where c s an

More information

Anti-van der Waerden numbers of 3-term arithmetic progressions.

Anti-van der Waerden numbers of 3-term arithmetic progressions. Ant-van der Waerden numbers of 3-term arthmetc progressons. Zhanar Berkkyzy, Alex Schulte, and Mchael Young Aprl 24, 2016 Abstract The ant-van der Waerden number, denoted by aw([n], k), s the smallest

More information

a b a In case b 0, a being divisible by b is the same as to say that

a b a In case b 0, a being divisible by b is the same as to say that Secton 6.2 Dvsblty among the ntegers An nteger a ε s dvsble by b ε f there s an nteger c ε such that a = bc. Note that s dvsble by any nteger b, snce = b. On the other hand, a s dvsble by only f a = :

More information

Example: (13320, 22140) =? Solution #1: The divisors of are 1, 2, 3, 4, 5, 6, 9, 10, 12, 15, 18, 20, 27, 30, 36, 41,

Example: (13320, 22140) =? Solution #1: The divisors of are 1, 2, 3, 4, 5, 6, 9, 10, 12, 15, 18, 20, 27, 30, 36, 41, The greatest common dvsor of two ntegers a and b (not both zero) s the largest nteger whch s a common factor of both a and b. We denote ths number by gcd(a, b), or smply (a, b) when there s no confuson

More information

THE CHINESE REMAINDER THEOREM. We should thank the Chinese for their wonderful remainder theorem. Glenn Stevens

THE CHINESE REMAINDER THEOREM. We should thank the Chinese for their wonderful remainder theorem. Glenn Stevens THE CHINESE REMAINDER THEOREM KEITH CONRAD We should thank the Chnese for ther wonderful remander theorem. Glenn Stevens 1. Introducton The Chnese remander theorem says we can unquely solve any par of

More information

FACTORIZATION IN KRULL MONOIDS WITH INFINITE CLASS GROUP

FACTORIZATION IN KRULL MONOIDS WITH INFINITE CLASS GROUP C O L L O Q U I U M M A T H E M A T I C U M VOL. 80 1999 NO. 1 FACTORIZATION IN KRULL MONOIDS WITH INFINITE CLASS GROUP BY FLORIAN K A I N R A T H (GRAZ) Abstract. Let H be a Krull monod wth nfnte class

More information

Affine transformations and convexity

Affine transformations and convexity Affne transformatons and convexty The purpose of ths document s to prove some basc propertes of affne transformatons nvolvng convex sets. Here are a few onlne references for background nformaton: http://math.ucr.edu/

More information

2.3 Nilpotent endomorphisms

2.3 Nilpotent endomorphisms s a block dagonal matrx, wth A Mat dm U (C) In fact, we can assume that B = B 1 B k, wth B an ordered bass of U, and that A = [f U ] B, where f U : U U s the restrcton of f to U 40 23 Nlpotent endomorphsms

More information

Complete subgraphs in multipartite graphs

Complete subgraphs in multipartite graphs Complete subgraphs n multpartte graphs FLORIAN PFENDER Unverstät Rostock, Insttut für Mathematk D-18057 Rostock, Germany Floran.Pfender@un-rostock.de Abstract Turán s Theorem states that every graph G

More information

GELFAND-TSETLIN BASIS FOR THE REPRESENTATIONS OF gl n

GELFAND-TSETLIN BASIS FOR THE REPRESENTATIONS OF gl n GELFAND-TSETLIN BASIS FOR THE REPRESENTATIONS OF gl n KANG LU FINITE DIMENSIONAL REPRESENTATIONS OF gl n Let e j,, j =,, n denote the standard bass of the general lnear Le algebra gl n over the feld of

More information

k(k 1)(k 2)(p 2) 6(p d.

k(k 1)(k 2)(p 2) 6(p d. BLOCK-TRANSITIVE 3-DESIGNS WITH AFFINE AUTOMORPHISM GROUP Greg Gamble Let X = (Z p d where p s an odd prme and d N, and let B X, B = k. Then t was shown by Praeger that the set B = {B g g AGL d (p} s the

More information

Lecture 5 Decoding Binary BCH Codes

Lecture 5 Decoding Binary BCH Codes Lecture 5 Decodng Bnary BCH Codes In ths class, we wll ntroduce dfferent methods for decodng BCH codes 51 Decodng the [15, 7, 5] 2 -BCH Code Consder the [15, 7, 5] 2 -code C we ntroduced n the last lecture

More information

Math 261 Exercise sheet 2

Math 261 Exercise sheet 2 Math 261 Exercse sheet 2 http://staff.aub.edu.lb/~nm116/teachng/2017/math261/ndex.html Verson: September 25, 2017 Answers are due for Monday 25 September, 11AM. The use of calculators s allowed. Exercse

More information

8.4 COMPLEX VECTOR SPACES AND INNER PRODUCTS

8.4 COMPLEX VECTOR SPACES AND INNER PRODUCTS SECTION 8.4 COMPLEX VECTOR SPACES AND INNER PRODUCTS 493 8.4 COMPLEX VECTOR SPACES AND INNER PRODUCTS All the vector spaces you have studed thus far n the text are real vector spaces because the scalars

More information

Singular Value Decomposition: Theory and Applications

Singular Value Decomposition: Theory and Applications Sngular Value Decomposton: Theory and Applcatons Danel Khashab Sprng 2015 Last Update: March 2, 2015 1 Introducton A = UDV where columns of U and V are orthonormal and matrx D s dagonal wth postve real

More information

Lectures - Week 4 Matrix norms, Conditioning, Vector Spaces, Linear Independence, Spanning sets and Basis, Null space and Range of a Matrix

Lectures - Week 4 Matrix norms, Conditioning, Vector Spaces, Linear Independence, Spanning sets and Basis, Null space and Range of a Matrix Lectures - Week 4 Matrx norms, Condtonng, Vector Spaces, Lnear Independence, Spannng sets and Bass, Null space and Range of a Matrx Matrx Norms Now we turn to assocatng a number to each matrx. We could

More information

Remarks on the Properties of a Quasi-Fibonacci-like Polynomial Sequence

Remarks on the Properties of a Quasi-Fibonacci-like Polynomial Sequence Remarks on the Propertes of a Quas-Fbonacc-lke Polynomal Sequence Brce Merwne LIU Brooklyn Ilan Wenschelbaum Wesleyan Unversty Abstract Consder the Quas-Fbonacc-lke Polynomal Sequence gven by F 0 = 1,

More information

= z 20 z n. (k 20) + 4 z k = 4

= z 20 z n. (k 20) + 4 z k = 4 Problem Set #7 solutons 7.2.. (a Fnd the coeffcent of z k n (z + z 5 + z 6 + z 7 + 5, k 20. We use the known seres expanson ( n+l ( z l l z n below: (z + z 5 + z 6 + z 7 + 5 (z 5 ( + z + z 2 + z + 5 5

More information

Min Cut, Fast Cut, Polynomial Identities

Min Cut, Fast Cut, Polynomial Identities Randomzed Algorthms, Summer 016 Mn Cut, Fast Cut, Polynomal Identtes Instructor: Thomas Kesselhem and Kurt Mehlhorn 1 Mn Cuts n Graphs Lecture (5 pages) Throughout ths secton, G = (V, E) s a mult-graph.

More information

Beyond Zudilin s Conjectured q-analog of Schmidt s problem

Beyond Zudilin s Conjectured q-analog of Schmidt s problem Beyond Zudln s Conectured q-analog of Schmdt s problem Thotsaporn Ae Thanatpanonda thotsaporn@gmalcom Mathematcs Subect Classfcaton: 11B65 33B99 Abstract Usng the methodology of (rgorous expermental mathematcs

More information

Problem Set 9 Solutions

Problem Set 9 Solutions Desgn and Analyss of Algorthms May 4, 2015 Massachusetts Insttute of Technology 6.046J/18.410J Profs. Erk Demane, Srn Devadas, and Nancy Lynch Problem Set 9 Solutons Problem Set 9 Solutons Ths problem

More information

DIFFERENTIAL FORMS BRIAN OSSERMAN

DIFFERENTIAL FORMS BRIAN OSSERMAN DIFFERENTIAL FORMS BRIAN OSSERMAN Dfferentals are an mportant topc n algebrac geometry, allowng the use of some classcal geometrc arguments n the context of varetes over any feld. We wll use them to defne

More information

SL n (F ) Equals its Own Derived Group

SL n (F ) Equals its Own Derived Group Internatonal Journal of Algebra, Vol. 2, 2008, no. 12, 585-594 SL n (F ) Equals ts Own Derved Group Jorge Macel BMCC-The Cty Unversty of New York, CUNY 199 Chambers street, New York, NY 10007, USA macel@cms.nyu.edu

More information

Difference Equations

Difference Equations Dfference Equatons c Jan Vrbk 1 Bascs Suppose a sequence of numbers, say a 0,a 1,a,a 3,... s defned by a certan general relatonshp between, say, three consecutve values of the sequence, e.g. a + +3a +1

More information

18.781: Solution to Practice Questions for Final Exam

18.781: Solution to Practice Questions for Final Exam 18.781: Soluton to Practce Questons for Fnal Exam 1. Fnd three solutons n postve ntegers of x 6y = 1 by frst calculatng the contnued fracton expanson of 6. Soluton: We have 1 6=[, ] 6 6+ =[, ] 1 =[,, ]=[,,

More information

Errors for Linear Systems

Errors for Linear Systems Errors for Lnear Systems When we solve a lnear system Ax b we often do not know A and b exactly, but have only approxmatons  and ˆb avalable. Then the best thng we can do s to solve ˆx ˆb exactly whch

More information

APPENDIX A Some Linear Algebra

APPENDIX A Some Linear Algebra APPENDIX A Some Lnear Algebra The collecton of m, n matrces A.1 Matrces a 1,1,..., a 1,n A = a m,1,..., a m,n wth real elements a,j s denoted by R m,n. If n = 1 then A s called a column vector. Smlarly,

More information

Graph Reconstruction by Permutations

Graph Reconstruction by Permutations Graph Reconstructon by Permutatons Perre Ille and Wllam Kocay* Insttut de Mathémathques de Lumny CNRS UMR 6206 163 avenue de Lumny, Case 907 13288 Marselle Cedex 9, France e-mal: lle@ml.unv-mrs.fr Computer

More information

n α j x j = 0 j=1 has a nontrivial solution. Here A is the n k matrix whose jth column is the vector for all t j=0

n α j x j = 0 j=1 has a nontrivial solution. Here A is the n k matrix whose jth column is the vector for all t j=0 MODULE 2 Topcs: Lnear ndependence, bass and dmenson We have seen that f n a set of vectors one vector s a lnear combnaton of the remanng vectors n the set then the span of the set s unchanged f that vector

More information

8.6 The Complex Number System

8.6 The Complex Number System 8.6 The Complex Number System Earler n the chapter, we mentoned that we cannot have a negatve under a square root, snce the square of any postve or negatve number s always postve. In ths secton we want

More information

Maximizing the number of nonnegative subsets

Maximizing the number of nonnegative subsets Maxmzng the number of nonnegatve subsets Noga Alon Hao Huang December 1, 213 Abstract Gven a set of n real numbers, f the sum of elements of every subset of sze larger than k s negatve, what s the maxmum

More information

arxiv: v1 [math.co] 1 Mar 2014

arxiv: v1 [math.co] 1 Mar 2014 Unon-ntersectng set systems Gyula O.H. Katona and Dánel T. Nagy March 4, 014 arxv:1403.0088v1 [math.co] 1 Mar 014 Abstract Three ntersecton theorems are proved. Frst, we determne the sze of the largest

More information

College of Computer & Information Science Fall 2009 Northeastern University 20 October 2009

College of Computer & Information Science Fall 2009 Northeastern University 20 October 2009 College of Computer & Informaton Scence Fall 2009 Northeastern Unversty 20 October 2009 CS7880: Algorthmc Power Tools Scrbe: Jan Wen and Laura Poplawsk Lecture Outlne: Prmal-dual schema Network Desgn:

More information

International Mathematical Olympiad. Preliminary Selection Contest 2012 Hong Kong. Outline of Solutions

International Mathematical Olympiad. Preliminary Selection Contest 2012 Hong Kong. Outline of Solutions Internatonal Mathematcal Olympad Prelmnary Selecton ontest Hong Kong Outlne of Solutons nswers: 7 4 7 4 6 5 9 6 99 7 6 6 9 5544 49 5 7 4 6765 5 6 6 7 6 944 9 Solutons: Snce n s a two-dgt number, we have

More information

Convexity preserving interpolation by splines of arbitrary degree

Convexity preserving interpolation by splines of arbitrary degree Computer Scence Journal of Moldova, vol.18, no.1(52), 2010 Convexty preservng nterpolaton by splnes of arbtrary degree Igor Verlan Abstract In the present paper an algorthm of C 2 nterpolaton of dscrete

More information

MTH 819 Algebra I S13. Homework 1/ Solutions. 1 if p n b and p n+1 b 0 otherwise ) = 0 if p q or n m. W i = rw i

MTH 819 Algebra I S13. Homework 1/ Solutions. 1 if p n b and p n+1 b 0 otherwise ) = 0 if p q or n m. W i = rw i MTH 819 Algebra I S13 Homework 1/ Solutons Defnton A. Let R be PID and V a untary R-module. Let p be a prme n R and n Z +. Then d p,n (V) = dm R/Rp p n 1 Ann V (p n )/p n Ann V (p n+1 ) Note here that

More information

Math 426: Probability MWF 1pm, Gasson 310 Homework 4 Selected Solutions

Math 426: Probability MWF 1pm, Gasson 310 Homework 4 Selected Solutions Exercses from Ross, 3, : Math 26: Probablty MWF pm, Gasson 30 Homework Selected Solutons 3, p. 05 Problems 76, 86 3, p. 06 Theoretcal exercses 3, 6, p. 63 Problems 5, 0, 20, p. 69 Theoretcal exercses 2,

More information

Lecture 20: Lift and Project, SDP Duality. Today we will study the Lift and Project method. Then we will prove the SDP duality theorem.

Lecture 20: Lift and Project, SDP Duality. Today we will study the Lift and Project method. Then we will prove the SDP duality theorem. prnceton u. sp 02 cos 598B: algorthms and complexty Lecture 20: Lft and Project, SDP Dualty Lecturer: Sanjeev Arora Scrbe:Yury Makarychev Today we wll study the Lft and Project method. Then we wll prove

More information

Perron Vectors of an Irreducible Nonnegative Interval Matrix

Perron Vectors of an Irreducible Nonnegative Interval Matrix Perron Vectors of an Irreducble Nonnegatve Interval Matrx Jr Rohn August 4 2005 Abstract As s well known an rreducble nonnegatve matrx possesses a unquely determned Perron vector. As the man result of

More information

ISSN: ISO 9001:2008 Certified International Journal of Engineering and Innovative Technology (IJEIT) Volume 3, Issue 1, July 2013

ISSN: ISO 9001:2008 Certified International Journal of Engineering and Innovative Technology (IJEIT) Volume 3, Issue 1, July 2013 ISSN: 2277-375 Constructon of Trend Free Run Orders for Orthogonal rrays Usng Codes bstract: Sometmes when the expermental runs are carred out n a tme order sequence, the response can depend on the run

More information

NOTES ON SIMPLIFICATION OF MATRICES

NOTES ON SIMPLIFICATION OF MATRICES NOTES ON SIMPLIFICATION OF MATRICES JONATHAN LUK These notes dscuss how to smplfy an (n n) matrx In partcular, we expand on some of the materal from the textbook (wth some repetton) Part of the exposton

More information

763622S ADVANCED QUANTUM MECHANICS Solution Set 1 Spring c n a n. c n 2 = 1.

763622S ADVANCED QUANTUM MECHANICS Solution Set 1 Spring c n a n. c n 2 = 1. 7636S ADVANCED QUANTUM MECHANICS Soluton Set 1 Sprng 013 1 Warm-up Show that the egenvalues of a Hermtan operator  are real and that the egenkets correspondng to dfferent egenvalues are orthogonal (b)

More information

Chapter 5. Solution of System of Linear Equations. Module No. 6. Solution of Inconsistent and Ill Conditioned Systems

Chapter 5. Solution of System of Linear Equations. Module No. 6. Solution of Inconsistent and Ill Conditioned Systems Numercal Analyss by Dr. Anta Pal Assstant Professor Department of Mathematcs Natonal Insttute of Technology Durgapur Durgapur-713209 emal: anta.bue@gmal.com 1 . Chapter 5 Soluton of System of Lnear Equatons

More information

Module 9. Lecture 6. Duality in Assignment Problems

Module 9. Lecture 6. Duality in Assignment Problems Module 9 1 Lecture 6 Dualty n Assgnment Problems In ths lecture we attempt to answer few other mportant questons posed n earler lecture for (AP) and see how some of them can be explaned through the concept

More information

and problem sheet 2

and problem sheet 2 -8 and 5-5 problem sheet Solutons to the followng seven exercses and optonal bonus problem are to be submtted through gradescope by :0PM on Wednesday th September 08. There are also some practce problems,

More information

On quasiperfect numbers

On quasiperfect numbers Notes on Number Theory and Dscrete Mathematcs Prnt ISSN 1310 5132, Onlne ISSN 2367 8275 Vol. 23, 2017, No. 3, 73 78 On quasperfect numbers V. Sva Rama Prasad 1 and C. Suntha 2 1 Nalla Malla Reddy Engneerng

More information

Formulas for the Determinant

Formulas for the Determinant page 224 224 CHAPTER 3 Determnants e t te t e 2t 38 A = e t 2te t e 2t e t te t 2e 2t 39 If 123 A = 345, 456 compute the matrx product A adj(a) What can you conclude about det(a)? For Problems 40 43, use

More information

REDUCTION MODULO p. We will prove the reduction modulo p theorem in the general form as given by exercise 4.12, p. 143, of [1].

REDUCTION MODULO p. We will prove the reduction modulo p theorem in the general form as given by exercise 4.12, p. 143, of [1]. REDUCTION MODULO p. IAN KIMING We wll prove the reducton modulo p theorem n the general form as gven by exercse 4.12, p. 143, of [1]. We consder an ellptc curve E defned over Q and gven by a Weerstraß

More information

Yong Joon Ryang. 1. Introduction Consider the multicommodity transportation problem with convex quadratic cost function. 1 2 (x x0 ) T Q(x x 0 )

Yong Joon Ryang. 1. Introduction Consider the multicommodity transportation problem with convex quadratic cost function. 1 2 (x x0 ) T Q(x x 0 ) Kangweon-Kyungk Math. Jour. 4 1996), No. 1, pp. 7 16 AN ITERATIVE ROW-ACTION METHOD FOR MULTICOMMODITY TRANSPORTATION PROBLEMS Yong Joon Ryang Abstract. The optmzaton problems wth quadratc constrants often

More information

MMA and GCMMA two methods for nonlinear optimization

MMA and GCMMA two methods for nonlinear optimization MMA and GCMMA two methods for nonlnear optmzaton Krster Svanberg Optmzaton and Systems Theory, KTH, Stockholm, Sweden. krlle@math.kth.se Ths note descrbes the algorthms used n the author s 2007 mplementatons

More information

Randić Energy and Randić Estrada Index of a Graph

Randić Energy and Randić Estrada Index of a Graph EUROPEAN JOURNAL OF PURE AND APPLIED MATHEMATICS Vol. 5, No., 202, 88-96 ISSN 307-5543 www.ejpam.com SPECIAL ISSUE FOR THE INTERNATIONAL CONFERENCE ON APPLIED ANALYSIS AND ALGEBRA 29 JUNE -02JULY 20, ISTANBUL

More information

Exercises. 18 Algorithms

Exercises. 18 Algorithms 18 Algorthms Exercses 0.1. In each of the followng stuatons, ndcate whether f = O(g), or f = Ω(g), or both (n whch case f = Θ(g)). f(n) g(n) (a) n 100 n 200 (b) n 1/2 n 2/3 (c) 100n + log n n + (log n)

More information

= = = (a) Use the MATLAB command rref to solve the system. (b) Let A be the coefficient matrix and B be the right-hand side of the system.

= = = (a) Use the MATLAB command rref to solve the system. (b) Let A be the coefficient matrix and B be the right-hand side of the system. Chapter Matlab Exercses Chapter Matlab Exercses. Consder the lnear system of Example n Secton.. x x x y z y y z (a) Use the MATLAB command rref to solve the system. (b) Let A be the coeffcent matrx and

More information

1 Matrix representations of canonical matrices

1 Matrix representations of canonical matrices 1 Matrx representatons of canoncal matrces 2-d rotaton around the orgn: ( ) cos θ sn θ R 0 = sn θ cos θ 3-d rotaton around the x-axs: R x = 1 0 0 0 cos θ sn θ 0 sn θ cos θ 3-d rotaton around the y-axs:

More information

Solutions to the 71st William Lowell Putnam Mathematical Competition Saturday, December 4, 2010

Solutions to the 71st William Lowell Putnam Mathematical Competition Saturday, December 4, 2010 Solutons to the 7st Wllam Lowell Putnam Mathematcal Competton Saturday, December 4, 2 Kran Kedlaya and Lenny Ng A The largest such k s n+ 2 n 2. For n even, ths value s acheved by the partton {,n},{2,n

More information

Perfect Competition and the Nash Bargaining Solution

Perfect Competition and the Nash Bargaining Solution Perfect Competton and the Nash Barganng Soluton Renhard John Department of Economcs Unversty of Bonn Adenauerallee 24-42 53113 Bonn, Germany emal: rohn@un-bonn.de May 2005 Abstract For a lnear exchange

More information

Common loop optimizations. Example to improve locality. Why Dependence Analysis. Data Dependence in Loops. Goal is to find best schedule:

Common loop optimizations. Example to improve locality. Why Dependence Analysis. Data Dependence in Loops. Goal is to find best schedule: 15-745 Lecture 6 Data Dependence n Loops Copyrght Seth Goldsten, 2008 Based on sldes from Allen&Kennedy Lecture 6 15-745 2005-8 1 Common loop optmzatons Hostng of loop-nvarant computatons pre-compute before

More information

5 The Rational Canonical Form

5 The Rational Canonical Form 5 The Ratonal Canoncal Form Here p s a monc rreducble factor of the mnmum polynomal m T and s not necessarly of degree one Let F p denote the feld constructed earler n the course, consstng of all matrces

More information

n ). This is tight for all admissible values of t, k and n. k t + + n t

n ). This is tight for all admissible values of t, k and n. k t + + n t MAXIMIZING THE NUMBER OF NONNEGATIVE SUBSETS NOGA ALON, HAROUT AYDINIAN, AND HAO HUANG Abstract. Gven a set of n real numbers, f the sum of elements of every subset of sze larger than k s negatve, what

More information

ρ some λ THE INVERSE POWER METHOD (or INVERSE ITERATION) , for , or (more usually) to

ρ some λ THE INVERSE POWER METHOD (or INVERSE ITERATION) , for , or (more usually) to THE INVERSE POWER METHOD (or INVERSE ITERATION) -- applcaton of the Power method to A some fxed constant ρ (whch s called a shft), x λ ρ If the egenpars of A are { ( λ, x ) } ( ), or (more usually) to,

More information

7. Products and matrix elements

7. Products and matrix elements 7. Products and matrx elements 1 7. Products and matrx elements Based on the propertes of group representatons, a number of useful results can be derved. Consder a vector space V wth an nner product ψ

More information

Lecture 12: Discrete Laplacian

Lecture 12: Discrete Laplacian Lecture 12: Dscrete Laplacan Scrbe: Tanye Lu Our goal s to come up wth a dscrete verson of Laplacan operator for trangulated surfaces, so that we can use t n practce to solve related problems We are mostly

More information

Supplement: Proofs and Technical Details for The Solution Path of the Generalized Lasso

Supplement: Proofs and Technical Details for The Solution Path of the Generalized Lasso Supplement: Proofs and Techncal Detals for The Soluton Path of the Generalzed Lasso Ryan J. Tbshran Jonathan Taylor In ths document we gve supplementary detals to the paper The Soluton Path of the Generalzed

More information

The lower and upper bounds on Perron root of nonnegative irreducible matrices

The lower and upper bounds on Perron root of nonnegative irreducible matrices Journal of Computatonal Appled Mathematcs 217 (2008) 259 267 wwwelsevercom/locate/cam The lower upper bounds on Perron root of nonnegatve rreducble matrces Guang-Xn Huang a,, Feng Yn b,keguo a a College

More information

LECTURE V. 1. More on the Chinese Remainder Theorem We begin by recalling this theorem, proven in the preceeding lecture.

LECTURE V. 1. More on the Chinese Remainder Theorem We begin by recalling this theorem, proven in the preceeding lecture. LECTURE V EDWIN SPARK 1. More on the Chnese Remander Theorem We begn by recallng ths theorem, proven n the preceedng lecture. Theorem 1.1 (Chnese Remander Theorem). Let R be a rng wth deals I 1, I 2,...,

More information

E Tail Inequalities. E.1 Markov s Inequality. Non-Lecture E: Tail Inequalities

E Tail Inequalities. E.1 Markov s Inequality. Non-Lecture E: Tail Inequalities Algorthms Non-Lecture E: Tal Inequaltes If you hold a cat by the tal you learn thngs you cannot learn any other way. Mar Twan E Tal Inequaltes The smple recursve structure of sp lsts made t relatvely easy

More information

More metrics on cartesian products

More metrics on cartesian products More metrcs on cartesan products If (X, d ) are metrc spaces for 1 n, then n Secton II4 of the lecture notes we defned three metrcs on X whose underlyng topologes are the product topology The purpose of

More information

28 Finitely Generated Abelian Groups

28 Finitely Generated Abelian Groups 8 Fntely Generated Abelan Groups In ths last paragraph of Chapter, we determne the structure of fntely generated abelan groups A complete classfcaton of such groups s gven Complete classfcaton theorems

More information

MATH 241B FUNCTIONAL ANALYSIS - NOTES EXAMPLES OF C ALGEBRAS

MATH 241B FUNCTIONAL ANALYSIS - NOTES EXAMPLES OF C ALGEBRAS MATH 241B FUNCTIONAL ANALYSIS - NOTES EXAMPLES OF C ALGEBRAS These are nformal notes whch cover some of the materal whch s not n the course book. The man purpose s to gve a number of nontrval examples

More information

Math 217 Fall 2013 Homework 2 Solutions

Math 217 Fall 2013 Homework 2 Solutions Math 17 Fall 013 Homework Solutons Due Thursday Sept. 6, 013 5pm Ths homework conssts of 6 problems of 5 ponts each. The total s 30. You need to fully justfy your answer prove that your functon ndeed has

More information

A CLASS OF RECURSIVE SETS. Florentin Smarandache University of New Mexico 200 College Road Gallup, NM 87301, USA

A CLASS OF RECURSIVE SETS. Florentin Smarandache University of New Mexico 200 College Road Gallup, NM 87301, USA A CLASS OF RECURSIVE SETS Florentn Smarandache Unversty of New Mexco 200 College Road Gallup, NM 87301, USA E-mal: smarand@unmedu In ths artcle one bulds a class of recursve sets, one establshes propertes

More information

On C 0 multi-contractions having a regular dilation

On C 0 multi-contractions having a regular dilation SUDIA MAHEMAICA 170 (3) (2005) On C 0 mult-contractons havng a regular dlaton by Dan Popovc (mşoara) Abstract. Commutng mult-contractons of class C 0 and havng a regular sometrc dlaton are studed. We prove

More information

NOTES FOR QUANTUM GROUPS, CRYSTAL BASES AND REALIZATION OF ŝl(n)-modules

NOTES FOR QUANTUM GROUPS, CRYSTAL BASES AND REALIZATION OF ŝl(n)-modules NOTES FOR QUANTUM GROUPS, CRYSTAL BASES AND REALIZATION OF ŝl(n)-modules EVAN WILSON Quantum groups Consder the Le algebra sl(n), whch s the Le algebra over C of n n trace matrces together wth the commutator

More information

Lecture 2: Gram-Schmidt Vectors and the LLL Algorithm

Lecture 2: Gram-Schmidt Vectors and the LLL Algorithm NYU, Fall 2016 Lattces Mn Course Lecture 2: Gram-Schmdt Vectors and the LLL Algorthm Lecturer: Noah Stephens-Davdowtz 2.1 The Shortest Vector Problem In our last lecture, we consdered short solutons to

More information

A p-adic PERRON-FROBENIUS THEOREM

A p-adic PERRON-FROBENIUS THEOREM A p-adic PERRON-FROBENIUS THEOREM ROBERT COSTA AND PATRICK DYNES Advsor: Clayton Petsche Oregon State Unversty Abstract We prove a result for square matrces over the p-adc numbers akn to the Perron-Frobenus

More information

HMMT February 2016 February 20, 2016

HMMT February 2016 February 20, 2016 HMMT February 016 February 0, 016 Combnatorcs 1. For postve ntegers n, let S n be the set of ntegers x such that n dstnct lnes, no three concurrent, can dvde a plane nto x regons (for example, S = {3,

More information

Determinants Containing Powers of Generalized Fibonacci Numbers

Determinants Containing Powers of Generalized Fibonacci Numbers 1 2 3 47 6 23 11 Journal of Integer Sequences, Vol 19 (2016), Artcle 1671 Determnants Contanng Powers of Generalzed Fbonacc Numbers Aram Tangboonduangjt and Thotsaporn Thanatpanonda Mahdol Unversty Internatonal

More information

COS 521: Advanced Algorithms Game Theory and Linear Programming

COS 521: Advanced Algorithms Game Theory and Linear Programming COS 521: Advanced Algorthms Game Theory and Lnear Programmng Moses Charkar February 27, 2013 In these notes, we ntroduce some basc concepts n game theory and lnear programmng (LP). We show a connecton

More information

FINITELY-GENERATED MODULES OVER A PRINCIPAL IDEAL DOMAIN

FINITELY-GENERATED MODULES OVER A PRINCIPAL IDEAL DOMAIN FINITELY-GENERTED MODULES OVER PRINCIPL IDEL DOMIN EMMNUEL KOWLSKI Throughout ths note, s a prncpal deal doman. We recall the classfcaton theorem: Theorem 1. Let M be a fntely-generated -module. (1) There

More information

Assortment Optimization under MNL

Assortment Optimization under MNL Assortment Optmzaton under MNL Haotan Song Aprl 30, 2017 1 Introducton The assortment optmzaton problem ams to fnd the revenue-maxmzng assortment of products to offer when the prces of products are fxed.

More information

11 Tail Inequalities Markov s Inequality. Lecture 11: Tail Inequalities [Fa 13]

11 Tail Inequalities Markov s Inequality. Lecture 11: Tail Inequalities [Fa 13] Algorthms Lecture 11: Tal Inequaltes [Fa 13] If you hold a cat by the tal you learn thngs you cannot learn any other way. Mark Twan 11 Tal Inequaltes The smple recursve structure of skp lsts made t relatvely

More information

Statistical Mechanics and Combinatorics : Lecture III

Statistical Mechanics and Combinatorics : Lecture III Statstcal Mechancs and Combnatorcs : Lecture III Dmer Model Dmer defntons Defnton A dmer coverng (perfect matchng) of a fnte graph s a set of edges whch covers every vertex exactly once, e every vertex

More information

ANSWERS. Problem 1. and the moment generating function (mgf) by. defined for any real t. Use this to show that E( U) var( U)

ANSWERS. Problem 1. and the moment generating function (mgf) by. defined for any real t. Use this to show that E( U) var( U) Econ 413 Exam 13 H ANSWERS Settet er nndelt 9 deloppgaver, A,B,C, som alle anbefales å telle lkt for å gøre det ltt lettere å stå. Svar er gtt . Unfortunately, there s a prntng error n the hnt of

More information

Problem Solving in Math (Math 43900) Fall 2013

Problem Solving in Math (Math 43900) Fall 2013 Problem Solvng n Math (Math 43900) Fall 2013 Week four (September 17) solutons Instructor: Davd Galvn 1. Let a and b be two nteger for whch a b s dvsble by 3. Prove that a 3 b 3 s dvsble by 9. Soluton:

More information

Self-complementing permutations of k-uniform hypergraphs

Self-complementing permutations of k-uniform hypergraphs Dscrete Mathematcs Theoretcal Computer Scence DMTCS vol. 11:1, 2009, 117 124 Self-complementng permutatons of k-unform hypergraphs Artur Szymańsk A. Paweł Wojda Faculty of Appled Mathematcs, AGH Unversty

More information

Week 2. This week, we covered operations on sets and cardinality.

Week 2. This week, we covered operations on sets and cardinality. Week 2 Ths week, we covered operatons on sets and cardnalty. Defnton 0.1 (Correspondence). A correspondence between two sets A and B s a set S contaned n A B = {(a, b) a A, b B}. A correspondence from

More information

ENUMERATING LEFT DISTRIBUTIVE GROUPOIDS. Jaroslav Ježek

ENUMERATING LEFT DISTRIBUTIVE GROUPOIDS. Jaroslav Ježek ENUMERATING LEFT DISTRIBUTIVE GROUPOIDS Jaroslav Ježek Abstract. Groupods satsfyng the equaton x(yz) = (xy)(xz) are called left dstrbutve, or LD-groupods. We gve an algorthm for ther enumeraton and prove

More information

Special Relativity and Riemannian Geometry. Department of Mathematical Sciences

Special Relativity and Riemannian Geometry. Department of Mathematical Sciences Tutoral Letter 06//018 Specal Relatvty and Reannan Geoetry APM3713 Seester Departent of Matheatcal Scences IMPORTANT INFORMATION: Ths tutoral letter contans the solutons to Assgnent 06. BAR CODE Learn

More information

Finding Dense Subgraphs in G(n, 1/2)

Finding Dense Subgraphs in G(n, 1/2) Fndng Dense Subgraphs n Gn, 1/ Atsh Das Sarma 1, Amt Deshpande, and Rav Kannan 1 Georga Insttute of Technology,atsh@cc.gatech.edu Mcrosoft Research-Bangalore,amtdesh,annan@mcrosoft.com Abstract. Fndng

More information

U.C. Berkeley CS294: Spectral Methods and Expanders Handout 8 Luca Trevisan February 17, 2016

U.C. Berkeley CS294: Spectral Methods and Expanders Handout 8 Luca Trevisan February 17, 2016 U.C. Berkeley CS94: Spectral Methods and Expanders Handout 8 Luca Trevsan February 7, 06 Lecture 8: Spectral Algorthms Wrap-up In whch we talk about even more generalzatons of Cheeger s nequaltes, and

More information

Mixed-integer vertex covers on bipartite graphs

Mixed-integer vertex covers on bipartite graphs Mxed-nteger vertex covers on bpartte graphs Mchele Confort, Bert Gerards, Gacomo Zambell November, 2006 Abstract Let A be the edge-node ncdence matrx of a bpartte graph G = (U, V ; E), I be a subset the

More information

3.1 Expectation of Functions of Several Random Variables. )' be a k-dimensional discrete or continuous random vector, with joint PMF p (, E X E X1 E X

3.1 Expectation of Functions of Several Random Variables. )' be a k-dimensional discrete or continuous random vector, with joint PMF p (, E X E X1 E X Statstcs 1: Probablty Theory II 37 3 EPECTATION OF SEVERAL RANDOM VARIABLES As n Probablty Theory I, the nterest n most stuatons les not on the actual dstrbuton of a random vector, but rather on a number

More information

Complex Numbers. x = B B 2 4AC 2A. or x = x = 2 ± 4 4 (1) (5) 2 (1)

Complex Numbers. x = B B 2 4AC 2A. or x = x = 2 ± 4 4 (1) (5) 2 (1) Complex Numbers If you have not yet encountered complex numbers, you wll soon do so n the process of solvng quadratc equatons. The general quadratc equaton Ax + Bx + C 0 has solutons x B + B 4AC A For

More information

C/CS/Phy191 Problem Set 3 Solutions Out: Oct 1, 2008., where ( 00. ), so the overall state of the system is ) ( ( ( ( 00 ± 11 ), Φ ± = 1

C/CS/Phy191 Problem Set 3 Solutions Out: Oct 1, 2008., where ( 00. ), so the overall state of the system is ) ( ( ( ( 00 ± 11 ), Φ ± = 1 C/CS/Phy9 Problem Set 3 Solutons Out: Oct, 8 Suppose you have two qubts n some arbtrary entangled state ψ You apply the teleportaton protocol to each of the qubts separately What s the resultng state obtaned

More information

On the size of quotient of two subsets of positive integers.

On the size of quotient of two subsets of positive integers. arxv:1706.04101v1 [math.nt] 13 Jun 2017 On the sze of quotent of two subsets of postve ntegers. Yur Shtenkov Abstract We obtan non-trval lower bound for the set A/A, where A s a subset of the nterval [1,

More information

The path of ants Dragos Crisan, Andrei Petridean, 11 th grade. Colegiul National "Emil Racovita", Cluj-Napoca

The path of ants Dragos Crisan, Andrei Petridean, 11 th grade. Colegiul National Emil Racovita, Cluj-Napoca Ths artcle s wrtten by students. It may nclude omssons and mperfectons, whch were dentfed and reported as mnutely as possble by our revewers n the edtoral notes. The path of ants 07-08 Students names and

More information

Fixed points of IA-endomorphisms of a free metabelian Lie algebra

Fixed points of IA-endomorphisms of a free metabelian Lie algebra Proc. Indan Acad. Sc. (Math. Sc.) Vol. 121, No. 4, November 2011, pp. 405 416. c Indan Academy of Scences Fxed ponts of IA-endomorphsms of a free metabelan Le algebra NAIME EKICI 1 and DEMET PARLAK SÖNMEZ

More information

Random Walks on Digraphs

Random Walks on Digraphs Random Walks on Dgraphs J. J. P. Veerman October 23, 27 Introducton Let V = {, n} be a vertex set and S a non-negatve row-stochastc matrx (.e. rows sum to ). V and S defne a dgraph G = G(V, S) and a drected

More information