Semidefinite optimization in discrepancy theory

Recently, there have been several new developments in discrepancy theory based on connections to semidefinite programming. This connection has been useful in several ways. It gives efficient polynomial time algorithms for several problems for which only non-constructive results were previously known. It also leads to several new structural results in discrepancy itself, such as tightness of the so-called determinant lower bound, improved bounds on the discrepancy of the union of set systems and so on. We will give a brief survey of these results, focussing on the main ideas and the techniques involved.

[1]  J. Matousek,et al.  The determinant bound for discrepancy is almost tight , 2011, 1101.0767.

[2]  Aleksandar Nikolov,et al.  Tight hardness results for minimizing discrepancy , 2011, SODA '11.

[3]  László Lovász,et al.  Discrepancy of Set-systems and Matrices , 1986, Eur. J. Comb..

[4]  József Beck,et al.  "Integer-making" theorems , 1981, Discret. Appl. Math..

[5]  W. Banaszczyk.  Balancing vectors and Gaussian measures of n -dimensional convex bodies , 1998 .

[6]  Noga Alon,et al.  The Probabilistic Method, Second Edition , 2004 .

[7]  Dömötör Pálvölgyi,et al.  Indecomposable Coverings with Concave Polygons , 2010, Discret. Comput. Geom..

[8]  Bernd Grtner,et al.  Approximation Algorithms and Semidefinite Programming , 2012 .

[9]  Aleksandar Nikolov,et al.  A counterexample to Beck's conjecture on the discrepancy of three permutations , 2011, ArXiv.

[10]  Thomas Rothvoß,et al.  The entropy rounding method in approximation algorithms , 2011, SODA.

[11]  Martin Helm,et al.  A note on the Beck-Fiala Theorem , 1997, Comb..

[12]  Noga Alon,et al.  The Probabilistic Method , 2015, Fundamentals of Ramsey Theory.

[13]  J. Matousek,et al.  Geometric Discrepancy: An Illustrated Guide , 2009 .

[14]  Robin A. Moser.  A constructive proof of the Lovász local lemma , 2008, STOC '09.

[15]  Robert F. Tichy,et al.  Sequences, Discrepancies and Applications , 1997 .

[16]  J. Spencer.  Six standard deviations suffice , 1985 .

[17]  Bernard Chazelle,et al.  The discrepancy method - randomness and complexity , 2000 .

[18]  Aravind Srinivasan,et al.  Improving the discrepancy bound for sparse matrices: better approximations for sparse lattice approximation problems , 1997, SODA '97.

[19]  Jirí Matousek,et al.  Discrepancy After Adding A Single Set , 2005, Comb..

[20]  József Beck,et al.  Roth’s estimate of the discrepancy of integer sequences is nearly sharp , 1981, Comb..

[21]  Joel H. Spencer,et al.  Deterministic Discrepancy Minimization , 2011, ESA.

[22]  Friedrich Eisenbrand,et al.  Bin packing via discrepancy of permutations , 2010, SODA '11.

[23]  Penny E. Haxell,et al.  A condition for matchability in hypergraphs , 1995, Graphs Comb..

[24]  Nikhil Bansal,et al.  Constructive Algorithms for Discrepancy Minimization , 2010, 2010 IEEE 51st Annual Symposium on Foundations of Computer Science.

[25]  Stephen P. Boyd,et al.  Semidefinite Programming , 1996, SIAM Rev..

[26]  Benjamin Doerr.  Linear And Hereditary Discrepancy , 2000, Comb. Probab. Comput..

[27]  Jirí Matousek.  An Lp Version of the Beck-Fiala Conjecture , 1998, Eur. J. Comb..