Maximizing the number of nonnegative subsets
|
|
- Jemima Patterson
- 5 years ago
- Views:
Transcription
1 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 number of subsets of nonnegatve sum? In ths note we show that the answer s ( ( k 1 + ( k by establshng and applyng a weghted verson of Hall s Theorem. Ths settles a problem of Tsukerman. 1 Introducton Let {x 1,, x n } be a sequence of n real numbers whose sum s negatve. It s natural to ask the followng queston: What s the maxmum possble number of subsets of nonnegatve sum t can have? One can set x 1 = n 2 and x 2 = = x n = 1. Ths gves n =1 x = 1 < and 2 nonnegatve subsets, snce all the proper subsets contanng x 1, together wth the empty set, have a nonnegatve sum. It s also not hard to see that ths s best possble, snce for every subset A, ether A or ts complement {x 1,, x n }\A must have a negatve sum. Now a new queston arses: suppose t s known that every subset of sze larger than k has a negatve sum, what s the maxmum number of nonnegatve subsets? Ths queston was rased recently by Emmanuel Tsukerman [6]. The prevous problem s the specal case when k = n 1. A smlar constructon x 1 = k 1, x 2 = = x n = 1 yelds a lower bound ( ( k In ths note we prove that ths s also tght. Theorem 1.1. Suppose that every subset of {x 1,, x n } of sze larger than k has a negatve sum, then there are at most ( ( k subsets wth nonnegatve sums. One can further ask whether the extremal confguraton x 1 = k 1, x 2 = = x n = 1 s unque, n the sense that the famly F = {U : U x } s unque up to somorphsm. Note that when k = n 1, an alternatve constructon x 1 = n, x 2 =, x n = 1 also gves 2 nonnegatve subsets, whle the famly F t defnes s non-somorphc to the prevous one. More generally, for k = n 1 any sequence X = {x 1,..., x n } of n ntegers whose sum s 1 contans exactly 2 Sackler School of Mathematcs and Blavatnk School of Computer Scence, Tel Avv Unversty, Tel Avv 69978, Israel and Insttute for Advanced Study, Prnceton, New Jersey, 854, USA. Emal: nogaa@tau.ac.l. Research supported n part by an ERC Advanced grant, by a USA-Israel BSF grant, by an ISF grant, by the Israel I-Core program and by the Smony Fund. Insttute for Advanced Study, Prnceton, NJ 854 and DIMACS at Rutgers Unversty. Emal: huanghao@math.as.edu. Research supported n part by the IAS-DIMACS postdoctoral fellowshp. 1
2 nonnegatve subsets, as for any subset A of X, exactly one of the two sets A and X A has a nonnegatve sum. However, for every k < n 1, we can prove the unqueness by the followng result n whch the number of nonnegatve elements n the set s also taken nto account. Theorem 1.2. Let 1 t k < n be ntegers, and let X be a set of real numbers {x 1,, x n }, n whch there are exactly t nonnegatve numbers. Suppose that the sum of elements of every subset of sze greater than k s negatve, then the number of nonnegatve subsets s at most 2 t 1 ( ( n t k t + + ( n t + 1. Ths s tght for all admssble values of t, k and n. For every fxed k and n wth k < n 1, the expresson n Theorem 1.2 s strctly decreasng n t. Indeed, f 1 t < t + 1 k n, then, usng Pascal s dentty: ( ( ( ( n t n t n t 1 n t 1 2 t 1 ( t ( k t k t 1 ( ( ( ( ( ( n t n t n t 1 n t 1 n t 1 n t 1 = 2 t 1 [ + + 1] k t k t 1 k t 1 ( ( ( ( n t n t 1 n t n t 1 = 2 t 1 [ + 1] k t k t 1 ( n t 1 = 2 t 1 [ 1]. k t The last quantty s strctly postve for all t < k < n 1 (and s zero f k = n 1. Therefore, the above theorem mples Theorem 1.1 as a corollary and shows that t s tght for k < n 1 only when there s exactly one nonnegatve number. The bound s Theorem 1.2 s also tght by takng x 1 = k t, x 2 = = x t =, x t+1 = = x n = 1. In ths example, the sum of any k + 1 elements s negatve, and a subset s nonnegatve f and only f t s ether of the form x 1 S T, where S s an arbtrary subset of {x 2,, x t } and T s a subset of {x t+1,, x n } havng sze at most k t, or when t s a subset of {x 2,, x t }. The rest of ths short paper s organzed as follows. In Secton 2 we prove a Hall-type theorem and deduce from t the exstence of perfect matchngs n certan bpartte graphs. Ths enables us to obtan Theorem 1.2 as a corollary. In the last secton, we dscuss some open problems and further research drectons. 2 The Man result The followng lemma can be regarded as a strengthenng of the fundamental theorem of Hall [3]. Lemma 2.1. In a bpartte graph G wth two parts A and B, suppose there exst parttons A = A 1 A k and B = B 1 B l, such that for every [k], [l], n the nduced bpartte graph G[A, B ] all the vertces n A have equal degrees and all the vertces n B have equal degrees too. Defne an auxlary bpartte graph H on the same vertex set, and replace every nonempty G[A, B ] by a complete bpartte graph. Then G contans a perfect matchng f and only f H contans a perfect matchng. 2
3 Proof. The only f part s obvous snce G s a subgraph of H. In order to prove the f part, note frst that f H contans a perfect matchng, then k =1 A = l =1 B. We wll verfy that the graph G satsfes the condtons n Hall s Theorem: for any subset X A, ts neghborhood has sze N G (X X. Put Y = N G (X, and X = X A, Y = Y B, and defne two sequences of numbers {x }, {y } so that X = x A, Y = y B. Consder the pars (, such that G[A, B ] s nonempty. In ths nduced bpartte subgraph suppose every vertex n A has degree d 1, and every vertex n B has degree d 2. Double countng the number of edges gves d 1 A = d 2 B. On the other hand, we also have d 1 X d 2 Y, snce every vertex n X has exactly d 1 neghbors n Y, and every vertex n Y has at most d 2 neghbors n X. Combnng these two nequaltes, we have y x for every par (, such that G[A, B ] s nonempty. We clam that these nequaltes mply that Y X,.e. l B y =1 k A x. (1 =1 To prove the clam t suffces to fnd d, defned on every par (, wth nonempty G[A, B ], such that l k d, (y x = B y A x., =1 In other words, the condtons for Hall s Theorem would be satsfed f the followng system has a soluton: d, = B ; d, = A ; d, ; d, = f G[A, B ] =. (2 The standard way to prove that there s a soluton s by consderng an approprate flow problem. Construct a network wth a source s, a snk t, and vertces a 1,, a k and b 1,, b l. The source s s connected to every a wth capacty A, and every b s connected to the snk t wth capacty B. For every par (,, there s an edge from a to b. Its capacty s + f G[A, B ] s nonempty and otherwse. Then (2 s feasble f and only f there exsts a flow of value A = B. Now we consder an arbtrary cut n ths network: (s {a } U1 {b } U2, t {a } [k]\u1 {b } [l]\u2. Its capacty s fnte only when for every U 1, [l]\u 2, G[A, B ] s empty. Therefore n the auxlary graph H, f we take Z = U1 A, then the degree condton N H (Z Z mples that U 2 B U 1 A and thus the capacty of ths cut s equal to =1 A + B [k]\u 1 U 2 A + A = [k]\u 1 U 1 k A. =1 3
4 Therefore the mnmum cut n ths network has capacty at least k =1 A, and there s a cut of exactly ths capacty, namely the cut consstng of all edges emanatng from the source s. By the max-flow mn-cut theorem, we obtan a maxmum flow of the same sze and ths provdes us wth a soluton d, to (2, whch verfes the Hall s condton (1 for the graph G. Remark. Lemma 2.1 can also be reformulated n the followng way: gven G wth the propertes stated, defne the reduced auxlary graph H on the vertex set A B, where A = [k], B = [l], such that A s adacent to B f G[A, B ] s nonempty. If for every subset X A, N H (X B X A, then G has a perfect matchng. For the case of parttonng A and B nto sngletons, ths s exactly Hall s Theorem. Corollary 2.2. For m r + 1, let G be the bpartte graph wth two parts A and B, such that both parts consst of subsets of [m] of sze between 1 and r. S A s adacent to T B ff S T = and S + T r + 1. Then G has a perfect matchng. Proof. For 1 r, let A = B = ( [m],.e. all the -subsets of [m]. Let us consder the bpartte graph G[A, B ] nduced by A B. Note that when + r or + > m, G[A, B ] s empty, whle when r mn{2r, m}, every vertex n A has degree ( m and every vertex n B has degree ( m. Therefore by Lemma 2.1, t suffces to check that the reduced auxlary graph H satsfes the condtons n the above remark. We dscuss the followng two cases. Frst suppose m 2r, note that n the reduced graph H, A = B = [r], every vertex n A s adacent to the vertces {r + 1,, r} n B. The only nequaltes we need to verfy are: for every 1 t r, r =r+1 t B t =1 A. Note that r =r+1 t B = t =1 r t + t =1. The last nequalty holds because the functon ( m k s ncreasng n k when k m/2. Now we consder the case r + 1 m 2r 1. In ths case every vertex n A s adacent to vertces from r + 1 to mn{r, m }. More precsely, f 1 m r, then s adacent to {r + 1,..., r} n B, and f m r + 1 r, then s adacent to {r , m } n B. It suffces to verfy the condtons for X = {1,, t} when t r, and for X = {s,, t} when m r s t r. In the frst case N H (X = {r + 1 t,, r}, and the desred nequalty holds snce r =r+1 t = r =1 r t =1 r =1 r =t+1 = For the second case, N H (X = {r + 1 t,, m s}, and snce m r + 1, m s =r+1 t = Ths concludes the proof of the corollary. m r+t 1 =s t =s. t =1. 4
5 We are now ready to deduce Theorem 1.2 from Corollary 2.2. Proof. of Theorem 1.2: Wthout loss of generalty, we may assume that x 1 x 2 x n, and x x k+1 <. Suppose there are t k nonnegatve numbers,.e. x 1 x t and x t+1,, x n <. If t = 1, then every nonempty subset of nonnegatve sum must contan x 1, whch gves at most ( ( k nonnegatve subsets n total, as needed. Suppose t 2. We frst partton all the subsets of {1,, t} nto 2 t 1 pars (A, B, wth the property that A B = [t], A B = and 1 A. Ths can be done by parng every subset wth ts complement. For every, consder the bpartte graph G wth vertex set V,1 V,2 such that V,1 = {A S : S {t + 1,, n}, S k t} and V,2 = {B S : S {t + 1,, n}, S k t}. Note that f a nonempty subset wth ndex set U has a nonnegatve sum, then U {t+1,, n} k t, otherwse U {1,, t} gves a nonnegatve subset wth more than k elements. Therefore every nonnegatve subset s a vertex of one of the graphs G. Moreover, we can defne the edges of G n a way that A S s adacent to B T f and only f S, T {t + 1,, n}, S T = and S + T k t + 1. Note that by ths defnton, two adacent vertces cannot both correspond to nonnegatve subsets, otherwse S T {1,, t} gves a nonnegatve subset of sze larger than k. Applyng Corollary 2.2 wth m = n t, r = k t, we conclude that there s a matchng saturatng all the vertces n G except A and B. Therefore the number of nonnegatve subsets n G s at most ( ( n t k t + + n t + 1. Note that ths number remans the same for dfferent choces of (A, B, so the total number of nonnegatve subsets s at most 2 t 1 ( ( ( n t k t + + n t Concludng remarks A conecture of Manckam, Mklós, and Sngh (see [4], [5] asserts that for any ntegers n, k satsfyng n 4k, every set of n real numbers wth a nonnegatve sum has at least ( k 1 k-element subsets whose sum s also nonnegatve. The study of ths problem (see, e.g., [1] and the references theren reveals a tght connecton between questons about nonnegatve sums and problems n extremal fnte set theory. A connecton of the same flavor exsts for the problem studed n ths note, as explaned n what follows. The Erdős-Ko-Rado theorem [2] has the followng non-unform verson: for ntegers 1 k n, the maxmum sze of an ntersectng famly of subsets of szes up to k s equal to ( ( k 1 + k (. The extremal example s the famly of all the subsets of sze at most k contanng a fxed element. Ths result s a drect corollary of the unform Erdős-Ko-Rado theorem, together wth the obvous fact that each such famly cannot contan a set and ts complement. The followng strengthenng may also be true. Queston 3.1. Let k n 1, and let F be a famly consstng of subsets of sze at most k, where F. Suppose that for every two subsets A, B F, f A B =, then A + B k. Is t true that F ( ( k 1 + ( k 2 + +? A postve answer to ths queston wll provde an alternatve proof of Theorem 1.1. Ths can be seen by takng F = {F : = F {1,, n}, F x }. The famly F satsfes the condtons 5
6 n Queston 3.1 snce f A, B F, then A x, B x. If moreover A B =, then A B x and t follows that A B k. It s not too dffcult to show that the statement n the queston ndeed holds f k s small wth respect to n, the challenge s to decde whether or not t holds for all k n 1. Another ntrgung queston s the followng: can one fnd an explct perfect matchng for Corollary 2.2 wthout resortng to Hall s Theorem? When r s small or r = m 1, one can construct such perfect matchngs, but t seems that thngs get more complcated when r s closer to m/2. Acknowledgment We thank Emmanuel Tsukerman for tellng us about the problem consdered here, and Benny Sudakov for frutful dscussons, useful suggestons and helpful deas. References [1] N. Alon, H. Huang and B. Sudakov, Nonnegatve k-sums, fractonal covers, and probablty of small devatons, J. Combnatoral Theory, Ser. B 12 (212, [2] P. Erdős, C. Ko and R. Rado, Intersecton theorems for systems of fnte sets. Quart. J. Math. Oxford Ser., 12 (1961, [3] P. Hall, On representatves of subsets, J. London Math. Soc., 1 (1 (1935, [4] N. Manckam and D. Mklós, On the number of non-negatve partal sums of a non-negatve sum, Colloq. Math. Soc. Janos Bolya 52 (1987, [5] N. Manckam and N. M. Sngh, Frst dstrbuton nvarants and EKR theorems, J. Combnatoral Theory, Seres A 48 (1988, [6] E. Tsukerman, Prvate communcaton. 6
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 informationarxiv: 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 informationProblem 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 informationComplete 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 informationMATH 5707 HOMEWORK 4 SOLUTIONS 2. 2 i 2p i E(X i ) + E(Xi 2 ) ä i=1. i=1
MATH 5707 HOMEWORK 4 SOLUTIONS CİHAN BAHRAN 1. Let v 1,..., v n R m, all lengths v are not larger than 1. Let p 1,..., p n [0, 1] be arbtrary and set w = p 1 v 1 + + p n v n. Then there exst ε 1,..., ε
More informationMore 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 informationFirst 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 informationThe 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 informationVolume 18 Figure 1. Notation 1. Notation 2. Observation 1. Remark 1. Remark 2. Remark 3. Remark 4. Remark 5. Remark 6. Theorem A [2]. Theorem B [2].
Bulletn of Mathematcal Scences and Applcatons Submtted: 016-04-07 ISSN: 78-9634, Vol. 18, pp 1-10 Revsed: 016-09-08 do:10.1805/www.scpress.com/bmsa.18.1 Accepted: 016-10-13 017 ScPress Ltd., Swtzerland
More informationEdge Isoperimetric Inequalities
November 7, 2005 Ross M. Rchardson Edge Isopermetrc Inequaltes 1 Four Questons Recall that n the last lecture we looked at the problem of sopermetrc nequaltes n the hypercube, Q n. Our noton of boundary
More informationNP-Completeness : Proofs
NP-Completeness : Proofs Proof Methods A method to show a decson problem Π NP-complete s as follows. (1) Show Π NP. (2) Choose an NP-complete problem Π. (3) Show Π Π. A method to show an optmzaton problem
More informationprinceton univ. F 17 cos 521: Advanced Algorithm Design Lecture 7: LP Duality Lecturer: Matt Weinberg
prnceton unv. F 17 cos 521: Advanced Algorthm Desgn Lecture 7: LP Dualty Lecturer: Matt Wenberg Scrbe: LP Dualty s an extremely useful tool for analyzng structural propertes of lnear programs. Whle there
More informationGraph 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 informationFACTORIZATION 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 informationStanford University CS359G: Graph Partitioning and Expanders Handout 4 Luca Trevisan January 13, 2011
Stanford Unversty CS359G: Graph Parttonng and Expanders Handout 4 Luca Trevsan January 3, 0 Lecture 4 In whch we prove the dffcult drecton of Cheeger s nequalty. As n the past lectures, consder an undrected
More informationA Simple Research of Divisor Graphs
The 29th Workshop on Combnatoral Mathematcs and Computaton Theory A Smple Research o Dvsor Graphs Yu-png Tsao General Educaton Center Chna Unversty o Technology Tape Tawan yp-tsao@cuteedutw Tape Tawan
More informationThe Order Relation and Trace Inequalities for. Hermitian Operators
Internatonal Mathematcal Forum, Vol 3, 08, no, 507-57 HIKARI Ltd, wwwm-hkarcom https://doorg/0988/mf088055 The Order Relaton and Trace Inequaltes for Hermtan Operators Y Huang School of Informaton Scence
More informationPerfect 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 informationGeneral viscosity iterative method for a sequence of quasi-nonexpansive mappings
Avalable onlne at www.tjnsa.com J. Nonlnear Sc. Appl. 9 (2016), 5672 5682 Research Artcle General vscosty teratve method for a sequence of quas-nonexpansve mappngs Cuje Zhang, Ynan Wang College of Scence,
More informationfind (x): given element x, return the canonical element of the set containing x;
COS 43 Sprng, 009 Dsjont Set Unon Problem: Mantan a collecton of dsjont sets. Two operatons: fnd the set contanng a gven element; unte two sets nto one (destructvely). Approach: Canoncal element method:
More informationAffine 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 informationarxiv: v3 [cs.dm] 7 Jul 2012
Perfect matchng n -unform hypergraphs wth large vertex degree arxv:1101.580v [cs.dm] 7 Jul 01 Imdadullah Khan Department of Computer Scence College of Computng and Informaton Systems Umm Al-Qura Unversty
More informationTHE CHVÁTAL-ERDŐS CONDITION AND 2-FACTORS WITH A SPECIFIED NUMBER OF COMPONENTS
Dscussones Mathematcae Graph Theory 27 (2007) 401 407 THE CHVÁTAL-ERDŐS CONDITION AND 2-FACTORS WITH A SPECIFIED NUMBER OF COMPONENTS Guantao Chen Department of Mathematcs and Statstcs Georga State Unversty,
More informationAssortment 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 informationFinding 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 informationFINITELY-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 informationSelf-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 informationThe Minimum Universal Cost Flow in an Infeasible Flow Network
Journal of Scences, Islamc Republc of Iran 17(2): 175-180 (2006) Unversty of Tehran, ISSN 1016-1104 http://jscencesutacr The Mnmum Unversal Cost Flow n an Infeasble Flow Network H Saleh Fathabad * M Bagheran
More informationREAL ANALYSIS I HOMEWORK 1
REAL ANALYSIS I HOMEWORK CİHAN BAHRAN The questons are from Tao s text. Exercse 0.0.. If (x α ) α A s a collecton of numbers x α [0, + ] such that x α
More informationRandić 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 informationU.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 informationMath 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 informationA new construction of 3-separable matrices via an improved decoding of Macula s construction
Dscrete Optmzaton 5 008 700 704 Contents lsts avalable at ScenceDrect Dscrete Optmzaton journal homepage: wwwelsevercom/locate/dsopt A new constructon of 3-separable matrces va an mproved decodng of Macula
More informationAnti-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 informationBOUNDEDNESS OF THE RIESZ TRANSFORM WITH MATRIX A 2 WEIGHTS
BOUNDEDNESS OF THE IESZ TANSFOM WITH MATIX A WEIGHTS Introducton Let L = L ( n, be the functon space wth norm (ˆ f L = f(x C dx d < For a d d matrx valued functon W : wth W (x postve sem-defnte for all
More informationGeometry of Müntz Spaces
WDS'12 Proceedngs of Contrbuted Papers, Part I, 31 35, 212. ISBN 978-8-7378-224-5 MATFYZPRESS Geometry of Müntz Spaces P. Petráček Charles Unversty, Faculty of Mathematcs and Physcs, Prague, Czech Republc.
More informationThe L(2, 1)-Labeling on -Product of Graphs
Annals of Pure and Appled Mathematcs Vol 0, No, 05, 9-39 ISSN: 79-087X (P, 79-0888(onlne Publshed on 7 Aprl 05 wwwresearchmathscorg Annals of The L(, -Labelng on -Product of Graphs P Pradhan and Kamesh
More informationOn 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 informationExercise Solutions to Real Analysis
xercse Solutons to Real Analyss Note: References refer to H. L. Royden, Real Analyss xersze 1. Gven any set A any ɛ > 0, there s an open set O such that A O m O m A + ɛ. Soluton 1. If m A =, then there
More informationDistribution of subgraphs of random regular graphs
Dstrbuton of subgraphs of random regular graphs Zhcheng Gao Faculty of Busness Admnstraton Unversty of Macau Macau Chna zcgao@umac.mo N. C. Wormald Department of Combnatorcs and Optmzaton Unversty of Waterloo
More information2.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 informationDIFFERENTIAL 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 informationGenericity of Critical Types
Genercty of Crtcal Types Y-Chun Chen Alfredo D Tllo Eduardo Fangold Syang Xong September 2008 Abstract Ely and Pesk 2008 offers an nsghtful characterzaton of crtcal types: a type s crtcal f and only f
More informationRandom 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 informationTHE WEIGHTED WEAK TYPE INEQUALITY FOR THE STRONG MAXIMAL FUNCTION
THE WEIGHTED WEAK TYPE INEQUALITY FO THE STONG MAXIMAL FUNCTION THEMIS MITSIS Abstract. We prove the natural Fefferman-Sten weak type nequalty for the strong maxmal functon n the plane, under the assumpton
More informationCOS 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 informationLecture 4: November 17, Part 1 Single Buffer Management
Lecturer: Ad Rosén Algorthms for the anagement of Networs Fall 2003-2004 Lecture 4: November 7, 2003 Scrbe: Guy Grebla Part Sngle Buffer anagement In the prevous lecture we taled about the Combned Input
More informationRandom Partitions of Samples
Random Parttons of Samples Klaus Th. Hess Insttut für Mathematsche Stochastk Technsche Unverstät Dresden Abstract In the present paper we construct a decomposton of a sample nto a fnte number of subsamples
More informationCollege 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 informationLinear, affine, and convex sets and hulls In the sequel, unless otherwise specified, X will denote a real vector space.
Lnear, affne, and convex sets and hulls In the sequel, unless otherwse specfed, X wll denote a real vector space. Lnes and segments. Gven two ponts x, y X, we defne xy = {x + t(y x) : t R} = {(1 t)x +
More informationFinding Primitive Roots Pseudo-Deterministically
Electronc Colloquum on Computatonal Complexty, Report No 207 (205) Fndng Prmtve Roots Pseudo-Determnstcally Ofer Grossman December 22, 205 Abstract Pseudo-determnstc algorthms are randomzed search algorthms
More information3.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 informationYong 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 informationTHE 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 informationDiscrete Mathematics
Dscrete Mathematcs 30 (00) 48 488 Contents lsts avalable at ScenceDrect Dscrete Mathematcs journal homepage: www.elsever.com/locate/dsc The number of C 3 -free vertces on 3-partte tournaments Ana Paulna
More informationHMMT 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 informationPerron 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= 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 informationLecture 4. Instructor: Haipeng Luo
Lecture 4 Instructor: Hapeng Luo In the followng lectures, we focus on the expert problem and study more adaptve algorthms. Although Hedge s proven to be worst-case optmal, one may wonder how well t would
More informationMATH 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 informationAppendix B. Criterion of Riemann-Stieltjes Integrability
Appendx B. Crteron of Remann-Steltes Integrablty Ths note s complementary to [R, Ch. 6] and [T, Sec. 3.5]. The man result of ths note s Theorem B.3, whch provdes the necessary and suffcent condtons for
More informationn α 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 informationIntroductory Cardinality Theory Alan Kaylor Cline
Introductory Cardnalty Theory lan Kaylor Clne lthough by name the theory of set cardnalty may seem to be an offshoot of combnatorcs, the central nterest s actually nfnte sets. Combnatorcs deals wth fnte
More informationUNIQUE FACTORIZATION OF COMPOSITIVE HEREDITARY GRAPH PROPERTIES
UNIQUE FACTORIZATION OF COMPOSITIVE HEREDITARY GRAPH PROPERTIES IZAK BROERE AND EWA DRGAS-BURCHARDT Abstract. A graph property s any class of graphs that s closed under somorphsms. A graph property P s
More informationk(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 informationChapter 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 informationCaps and Colouring Steiner Triple Systems
Desgns, Codes and Cryptography, 13, 51 55 (1998) c 1998 Kluwer Academc Publshers, Boston. Manufactured n The Netherlands. Caps and Colourng Stener Trple Systems AIDEN BRUEN* Department of Mathematcs, Unversty
More informationAnother converse of Jensen s inequality
Another converse of Jensen s nequalty Slavko Smc Abstract. We gve the best possble global bounds for a form of dscrete Jensen s nequalty. By some examples ts frutfulness s shown. 1. Introducton Throughout
More informationErrors 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 informationCSCE 790S Background Results
CSCE 790S Background Results Stephen A. Fenner September 8, 011 Abstract These results are background to the course CSCE 790S/CSCE 790B, Quantum Computaton and Informaton (Sprng 007 and Fall 011). Each
More informationThe internal structure of natural numbers and one method for the definition of large prime numbers
The nternal structure of natural numbers and one method for the defnton of large prme numbers Emmanul Manousos APM Insttute for the Advancement of Physcs and Mathematcs 3 Poulou str. 53 Athens Greece Abstract
More informationSUCCESSIVE MINIMA AND LATTICE POINTS (AFTER HENK, GILLET AND SOULÉ) M(B) := # ( B Z N)
SUCCESSIVE MINIMA AND LATTICE POINTS (AFTER HENK, GILLET AND SOULÉ) S.BOUCKSOM Abstract. The goal of ths note s to present a remarably smple proof, due to Hen, of a result prevously obtaned by Gllet-Soulé,
More informationMAT 578 Functional Analysis
MAT 578 Functonal Analyss John Qugg Fall 2008 Locally convex spaces revsed September 6, 2008 Ths secton establshes the fundamental propertes of locally convex spaces. Acknowledgment: although I wrote these
More informationOperations Research Letters. Simpler analysis of LP extreme points for traveling salesman and survivable network design problems
Operatons Research Letters 38 (010) 156 160 Contents lsts avalable at ScenceDrect Operatons Research Letters journal homepage: www.elsever.com/locate/orl Smpler analyss of LP extreme ponts for travelng
More informationThe Multiple Classical Linear Regression Model (CLRM): Specification and Assumptions. 1. Introduction
ECONOMICS 5* -- NOTE (Summary) ECON 5* -- NOTE The Multple Classcal Lnear Regresson Model (CLRM): Specfcaton and Assumptons. Introducton CLRM stands for the Classcal Lnear Regresson Model. The CLRM s also
More informationA CHARACTERIZATION OF ADDITIVE DERIVATIONS ON VON NEUMANN ALGEBRAS
Journal of Mathematcal Scences: Advances and Applcatons Volume 25, 2014, Pages 1-12 A CHARACTERIZATION OF ADDITIVE DERIVATIONS ON VON NEUMANN ALGEBRAS JIA JI, WEN ZHANG and XIAOFEI QI Department of Mathematcs
More informationStanford University CS254: Computational Complexity Notes 7 Luca Trevisan January 29, Notes for Lecture 7
Stanford Unversty CS54: Computatonal Complexty Notes 7 Luca Trevsan January 9, 014 Notes for Lecture 7 1 Approxmate Countng wt an N oracle We complete te proof of te followng result: Teorem 1 For every
More informationFixed 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 informationAPPENDIX 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 informationSupplement: 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 informationGames of Threats. Elon Kohlberg Abraham Neyman. Working Paper
Games of Threats Elon Kohlberg Abraham Neyman Workng Paper 18-023 Games of Threats Elon Kohlberg Harvard Busness School Abraham Neyman The Hebrew Unversty of Jerusalem Workng Paper 18-023 Copyrght 2017
More information5 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 informationEvery planar graph is 4-colourable a proof without computer
Peter Dörre Department of Informatcs and Natural Scences Fachhochschule Südwestfalen (Unversty of Appled Scences) Frauenstuhlweg 31, D-58644 Iserlohn, Germany Emal: doerre(at)fh-swf.de Mathematcs Subject
More informationComputing Correlated Equilibria in Multi-Player Games
Computng Correlated Equlbra n Mult-Player Games Chrstos H. Papadmtrou Presented by Zhanxang Huang December 7th, 2005 1 The Author Dr. Chrstos H. Papadmtrou CS professor at UC Berkley (taught at Harvard,
More informationSmarandache-Zero Divisors in Group Rings
Smarandache-Zero Dvsors n Group Rngs W.B. Vasantha and Moon K. Chetry Department of Mathematcs I.I.T Madras, Chenna The study of zero-dvsors n group rngs had become nterestng problem snce 1940 wth the
More informationCommunication Complexity 16:198: February Lecture 4. x ij y ij
Communcaton Complexty 16:198:671 09 February 2010 Lecture 4 Lecturer: Troy Lee Scrbe: Rajat Mttal 1 Homework problem : Trbes We wll solve the thrd queston n the homework. The goal s to show that the nondetermnstc
More informationTAIL BOUNDS FOR SUMS OF GEOMETRIC AND EXPONENTIAL VARIABLES
TAIL BOUNDS FOR SUMS OF GEOMETRIC AND EXPONENTIAL VARIABLES SVANTE JANSON Abstract. We gve explct bounds for the tal probabltes for sums of ndependent geometrc or exponental varables, possbly wth dfferent
More informationCOMPLEX NUMBERS AND QUADRATIC EQUATIONS
COMPLEX NUMBERS AND QUADRATIC EQUATIONS INTRODUCTION We know that x 0 for all x R e the square of a real number (whether postve, negatve or ero) s non-negatve Hence the equatons x, x, x + 7 0 etc are not
More informationThis article appeared in a journal published by Elsevier. The attached copy is furnished to the author for internal non-commercial research and
Ths artcle appeared n a journal publshed by Elsever. The attached copy s furnshed to the author for nternal non-commercal research and educaton use, ncludng for nstructon at the authors nsttuton and sharng
More information20. Mon, Oct. 13 What we have done so far corresponds roughly to Chapters 2 & 3 of Lee. Now we turn to Chapter 4. The first idea is connectedness.
20. Mon, Oct. 13 What we have done so far corresponds roughly to Chapters 2 & 3 of Lee. Now we turn to Chapter 4. The frst dea s connectedness. Essentally, we want to say that a space cannot be decomposed
More informationA combinatorial proof of multiple angle formulas involving Fibonacci and Lucas numbers
Notes on Number Theory and Dscrete Mathematcs ISSN 1310 5132 Vol. 20, 2014, No. 5, 35 39 A combnatoral proof of multple angle formulas nvolvng Fbonacc and Lucas numbers Fernando Córes 1 and Dego Marques
More informationEigenvalues of Random Graphs
Spectral Graph Theory Lecture 2 Egenvalues of Random Graphs Danel A. Spelman November 4, 202 2. Introducton In ths lecture, we consder a random graph on n vertces n whch each edge s chosen to be n the
More informationarxiv: v1 [quant-ph] 6 Sep 2007
An Explct Constructon of Quantum Expanders Avraham Ben-Aroya Oded Schwartz Amnon Ta-Shma arxv:0709.0911v1 [quant-ph] 6 Sep 2007 Abstract Quantum expanders are a natural generalzaton of classcal expanders.
More informationGoogle PageRank with Stochastic Matrix
Google PageRank wth Stochastc Matrx Md. Sharq, Puranjt Sanyal, Samk Mtra (M.Sc. Applcatons of Mathematcs) Dscrete Tme Markov Chan Let S be a countable set (usually S s a subset of Z or Z d or R or R d
More informationSTEINHAUS PROPERTY IN BANACH LATTICES
DEPARTMENT OF MATHEMATICS TECHNICAL REPORT STEINHAUS PROPERTY IN BANACH LATTICES DAMIAN KUBIAK AND DAVID TIDWELL SPRING 2015 No. 2015-1 TENNESSEE TECHNOLOGICAL UNIVERSITY Cookevlle, TN 38505 STEINHAUS
More informationSpectral Graph Theory and its Applications September 16, Lecture 5
Spectral Graph Theory and ts Applcatons September 16, 2004 Lecturer: Danel A. Spelman Lecture 5 5.1 Introducton In ths lecture, we wll prove the followng theorem: Theorem 5.1.1. Let G be a planar graph
More informationExact k-wise intersection theorems
Exact k-wse ntersecton theorems Tbor Szabó V. H. Vu Abstract A typcal problem n extremal combnatorcs s the followng. Gven a large number n and a set L, fnd the maxmum cardnalty of a famly of subsets of
More informationA combinatorial problem associated with nonograms
A combnatoral problem assocated wth nonograms Jessca Benton Ron Snow Nolan Wallach March 21, 2005 1 Introducton. Ths work was motvated by a queston posed by the second named author to the frst named author
More informationRefined Coding Bounds for Network Error Correction
Refned Codng Bounds for Network Error Correcton Shenghao Yang Department of Informaton Engneerng The Chnese Unversty of Hong Kong Shatn, N.T., Hong Kong shyang5@e.cuhk.edu.hk Raymond W. Yeung Department
More informationCase A. P k = Ni ( 2L i k 1 ) + (# big cells) 10d 2 P k.
THE CELLULAR METHOD In ths lecture, we ntroduce the cellular method as an approach to ncdence geometry theorems lke the Szemeréd-Trotter theorem. The method was ntroduced n the paper Combnatoral complexty
More information