On the discrepancy of random low degree set systems

From MaRDI portal



Abstract: Motivated 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. In this setting, Ezra and Lovett showed an O((tlogt)1/2) discrepancy bound in the regime when nleqm and an O(1) bound when nggmt. In this paper, we give a tight O(sqrtt) bound for the entire range of n and m, under a mild assumption that t=Omega(loglogm)2. The result is based on two steps. 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(sqrtt). Second, we reduce the general case to that of nleqmlogO(1)m using LP duality and a careful counting argument.












This page was built for publication: On the discrepancy of random low degree set systems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5136929)