## Abstract

Let A be the incidence matrix of a set system with m sets and n points, m ≤ n, and let t = tr M, where M = A^{T} A. Finally, let σ = tr M^{2} be the sum of squares of the elements of M. We prove that the hereditary discrepancy of the set system is at least 1/4 c^{nσ/t2} √t/n, with c = 1/324. This general trace bound allows us to resolve discrepancy-type questions for which spectral methods had previously failed. Also, by using this result in conjunction with the spectral lemma for linear circuits, we derive new complexity bounds for range searching. • We show that the (red-blue) discrepancy of the set system formed by n points and n lines in the plane is Ω(n^{1/6}) in the worst case and always^{1} Õ(n^{1/6}). • We give a simple explicit construction of n points and n halfplanes with hereditary discrepancy Ω̃(n^{1/4}). • We show that in any dimension d = Ω(log n/log log n), there is a set system of n points and n axis-parallel boxes in R^{d} with discrepancy n^{Ω(1/log log n)}. • Applying these discrepancy results together with a new variation of the spectral lemma, we derive a lower bound of Ω(n log n) on the arithmetic complexity of off-line range searching for points and lines (for nonmonotone circuits). We also prove a lower bound of Ω(n log n/log log n) on the complexity of orthogonal range searching in any dimension Ω(log n/log log n).

Original language | English (US) |
---|---|

Pages (from-to) | 221-231 |

Number of pages | 11 |

Journal | Discrete and Computational Geometry |

Volume | 26 |

Issue number | 2 |

DOIs | |

State | Published - Sep 2001 |

## All Science Journal Classification (ASJC) codes

- Theoretical Computer Science
- Geometry and Topology
- Discrete Mathematics and Combinatorics
- Computational Theory and Mathematics