English

On the Beck-Fiala Conjecture for Random Set Systems

Combinatorics 2015-11-03 v1

Abstract

Motivated by the Beck-Fiala conjecture, we study discrepancy bounds for random sparse set systems. Concretely, these are set systems (X,Σ)(X,\Sigma), where each element xXx \in X lies in tt randomly selected sets of Σ\Sigma, where tt is an integer parameter. We provide new bounds in two regimes of parameters. We show that when ΣX|\Sigma| \ge |X| the hereditary discrepancy of (X,Σ)(X,\Sigma) is with high probability O(tlogt)O(\sqrt{t \log t}); and when XΣt|X| \gg |\Sigma|^t the hereditary discrepancy of (X,Σ)(X,\Sigma) is with high probability O(1)O(1). The first bound combines the Lov{\'a}sz Local Lemma with a new argument based on partial matchings; the second follows from an analysis of the lattice spanned by sparse vectors.

Keywords

Cite

@article{arxiv.1511.00583,
  title  = {On the Beck-Fiala Conjecture for Random Set Systems},
  author = {Esther Ezra and Shachar Lovett},
  journal= {arXiv preprint arXiv:1511.00583},
  year   = {2015}
}
R2 v1 2026-06-22T11:34:53.804Z