On the Beck-Fiala Conjecture for Random Set Systems

preprint2015arXivOpen access

Abstract

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

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.