On the discrepancy of random low degree set systems

  title={On the discrepancy of random low degree set systems},
  author={N. Bansal and Raghu Meka},
htmlabstractMotivated by the celebrated Beck-Fiala conjecture, we consider the random setting where there are n elements and m sets and each element lies in t randomly chosen sets. [...] Key Method First, applying the partial coloring method to the case when n=mlogO(1)m and using the properties of the random set system we show that the overall discrepancy incurred is at most O(√t). Second, we reduce the general case to that of n≤mlogO(1)m using LP duality and a careful counting argument.Expand
Balancing Gaussian vectors in high dimension
Improved Algorithms for Combinatorial Discrepancy
On the discrepancy of random matrices with many columns
A spectral bound on hypergraph discrepancy


A Fourier-Analytic Approach for the Discrepancy of Random Set Systems
Six standard deviations suffice
Constructive Discrepancy Minimization by Walking on the Edges
An Algorithm for Komlós Conjecture Matching Banaszczyk's Bound
On the Beck-Fiala Conjecture for Random Set Systems
Discrepancy of Set-systems and Matrices
Deterministic Discrepancy Minimization via the Multiplicative Weight Update Method
Geometric Discrepancy: An Illustrated Guide
"Integer-making" theorems
A Panorama of Discrepancy Theory