250 research outputs found
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 ,
where each element lies in randomly selected sets of ,
where is an integer parameter. We provide new bounds in two regimes of
parameters. We show that when the hereditary discrepancy of
is with high probability ; and when the hereditary discrepancy of is with high probability
. 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
Bounds for approximate discrete tomography solutions
In earlier papers we have developed an algebraic theory of discrete
tomography. In those papers the structure of the functions
and having given line sums in certain directions have
been analyzed. Here was a block in with sides parallel to
the axes. In the present paper we assume that there is noise in the
measurements and (only) that is an arbitrary or convex finite set in
. We derive generalizations of earlier results. Furthermore we
apply a method of Beck and Fiala to obtain results of he following type: if the
line sums in directions of a function are known, then
there exists a function such that its line sums differ by at
most from the corresponding line sums of .Comment: 16 page
On the discrepancy of random low degree set systems
Motivated by the celebrated Beck-Fiala conjecture, we consider the random
setting where there are elements and sets and each element lies in
randomly chosen sets. In this setting, Ezra and Lovett showed an discrepancy bound in the regime when and an bound
when .
In this paper, we give a tight bound for the entire range of
and , under a mild assumption that . The
result is based on two steps. First, applying the partial coloring method to
the case when and using the properties of the random set
system we show that the overall discrepancy incurred is at most .
Second, we reduce the general case to that of using LP
duality and a careful counting argument
An Algorithm for Koml\'os Conjecture Matching Banaszczyk's bound
We consider the problem of finding a low discrepancy coloring for sparse set
systems where each element lies in at most t sets. We give an efficient
algorithm that finds a coloring with discrepancy O((t log n)^{1/2}), matching
the best known non-constructive bound for the problem due to Banaszczyk. The
previous algorithms only achieved an O(t^{1/2} log n) bound. The result also
extends to the more general Koml\'{o}s setting and gives an algorithmic
O(log^{1/2} n) bound
On a generalization of iterated and randomized rounding
We give a general method for rounding linear programs that combines the
commonly used iterated rounding and randomized rounding techniques. In
particular, we show that whenever iterated rounding can be applied to a problem
with some slack, there is a randomized procedure that returns an integral
solution that satisfies the guarantees of iterated rounding and also has
concentration properties. We use this to give new results for several classic
problems where iterated rounding has been useful
- …