f~(n 1/4) is the exact bound on the discrepancy. There are two reasons why our bound is interesting nevertheless: (i) it is purely combinatorial and, in particular, it requires no harmonic analysis; (ii) the construction is explicit where- as the previous one was existential.
Jan 1, 2001 · This general trace bound allows us to resolve discrepancy-type questions for which spectral methods had previously failed. Also, by using this ...
A lower bound is derived on the arithmetic complexity of off-line range searching for points and lines (for nonmonotone circuits) of Ω(nlog n/\kern -1ptlog ...
May 1, 2000 · A trace bound for the hereditary discrepancy · Authors: · Author Picture Bernard Chazelle. Department of Computer Science, Princeton University ...
Geometrically, it is the count of point/region incidences. Page 3. A Trace Bound for the Hereditary Discrepancy. 223. • Algebraically, tr M2 is the sum of the ...
Mar 14, 2023 · In their paper, Lovasz, Spencer, and Vesztergombi asked if hereditary discrepancy can also be bounded from above by a function of the hereditary ...
Our lower bound goes via an exponential lower bound on the discrepancy ... B. Chazelle and A. Lvov, A trace bound for the hereditary discrepancy, Discrete Comput.
A Trace Bound for the Hereditary Discrepancy. In Proc. 16th Annual Symposium on Computational Geometry, SCG '00, pages 64–69, 2000. 11. Kasper Green Larsen ...
it is clear that a lower bound on the hereditary discrepancy implies a similar ... A trace boundfor the hereditary discrepancy , P roc. 1 6 th Annual A C M S ...
