Improving the discrepancy bound for sparse matrices: better approximations for sparse lattice approximation problems

A powerful technique to approximate certain sparse integer programs due to Beck & Fiala, shows that matrices A E {-l,O, 1),X, with no column having more than t nonzeroes, have discrepancy disc(A) less than 2t. An outstanding conjecture of Beck & Fiala is that this disc(A) here is O(d). This, if true, would be best-possible; any bound of o(t) would be very interesting. We make progress on this by showing that certain related discrepancy measures of A that are lower bounds on disc(A), are O(t3i4 log t) (i.e., o(t)). We also show that disc(A) = O(&logn), improving the Beck-Spencer bound of O(&log tlog n). These results also apply to the lattice approximation problem of Raghavan. We show improved upper bounds on the discrepancy of two well-studied families of sparse matrices: e permutations of [n], and rectangles containing n points in Rk. We show a discrepancy bound of O(&logn) for the former, improving on the previous-best O(Llogn) due to Bohus. This improves the bounds for the latter, for k = 2,3 and 4. We also present a simple connection between discrepancy and communication complexity.

[1]  László Lovász,et al.  Discrepancy of Set-systems and Matrices , 1986, Eur. J. Comb..

[2]  Géza Bohus,et al.  On the Discrepancy of 3 Permutations , 1990, Random Struct. Algorithms.

[3]  K. F. Roth.  Remark concerning integer sequences , 1964 .

[4]  A. A. Razborov.  The gap between the chromatic number of a graph and the rank of its adjacency matrix is superlinear , 1992, Discret. Math..

[5]  Noam Nisan,et al.  On rank vs. communication complexity , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.

[6]  Noga Alon,et al.  The Probabilistic Method , 2015, Fundamentals of Ramsey Theory.

[7]  József Beck,et al.  "Integer-making" theorems , 1981, Discret. Appl. Math..

[8]  Joel H. Spencer,et al.  Integral approximation sequences , 1984, Math. Program..

[9]  Joel Spencer.  Ten Lectures on the Probabilistic Method: Second Edition , 1994 .

[10]  Jiří Matoušek,et al.  Discrepancy in arithmetic progressions , 1996 .

[11]  Ran Raz,et al.  On the "log rank"-conjecture in communication complexity , 1993, Proceedings of 1993 IEEE 34th Annual Foundations of Computer Science.

[12]  József Beck,et al.  Roth’s estimate of the discrepancy of integer sequences is nearly sharp , 1981, Comb..

[13]  J. Spencer.  Six standard deviations suffice , 1985 .

[14]  David B. Shmoys,et al.  Efficient Parallel Algorithms for Edge Coloring Problems , 1987, J. Algorithms.

[15]  K. F. Roth.  On irregularities of distribution, II , 1976 .

[16]  Noga Alon,et al.  A counterexample to the rank-coloring conjecture , 1989, J. Graph Theory.