Paper detail

On the Beck-Fiala Conjecture for Random Set Systems

Motivated by the Beck-Fiala conjecture, we study discrepancy bounds for random sparse set systems. Concretely, these are set systems $(X,Σ)$, where each element $x \in X$ lies in $t$ randomly selected sets of $Σ$, where $t$ is an integer parameter. We provide new bounds in two regimes of parameters. We show that when $|Σ| \ge |X|$ the hereditary discrepancy of $(X,Σ)$ is with high probability $O(\sqrt{t \log t})$; and when $|X| \gg |Σ|^t$ the hereditary discrepancy of $(X,Σ)$ is with high probability $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.

preprint2015arXivOpen access

Signal facts

What is known right now

Open access2 authors1 topic

Next steps

Decide what to do with this paper

Use like or dislike for the fast social read. The more specific scholarly feedback stays available below when needed.

Log in to curate

Reading frame

Keep the important context close to the paper

Keep the important signals around this paper in one place: votes, save state, collection context, reviews and the metadata you need before deciding what to do next.

Institutions

Add specific reaction

Move through the context

Research map

Open full explorer

Move through nearby people, institutions, topics and adjacent work without leaving the paper page.

Building this map preview

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

Structured reviews

0 review(s)

ContributeLeave structured feedbackUse the review template when you have a concrete strength, concern or method question.Open review form

No structured reviews yet. High-signal critique starts here.

Work discussion

0 comment(s)

DiscussAdd a high-signal commentKeep quick notes, caveats and replication pointers separate from formal reviews.Open comment form

No discussion yet. The first strong comment sets the tone.