On the discrepancy of random low degree set systems
RANDOM STRUCTURES & ALGORITHMS, pp. 695.0-705.0, 2020.
Motivated by the celebrated Beck-Fiala conjecture, we consider the random setting where there arenelements andmsets and each element lies intrandomly chosen sets. In this setting, Ezra and Lovett showed anO((tlogt)1/2)discrepancy bound whenn <= mand anO(1) bound whenn >> m(t). In this paper, we give a tightO(t)bound for the entire range o...More
Full Text (Upload PDF)
PPT (Upload PPT)