Mathematics – Combinatorics
Scientific paper
2008-07-28
The Electronic Journal of Combinatorics 15 (2008), #R95
Mathematics
Combinatorics
20 pages, 6 figures
Scientific paper
We construct explicit $\delta$-bracketing covers with minimal cardinality for the set system of (anchored) rectangles in the two dimensional unit cube. More precisely, the cardinality of these $\delta$-bracketing covers are bounded from above by $\delta^{-2} + o(\delta^{-2})$. A lower bound for the cardinality of arbitrary $\delta$-bracketing covers for $d$-dimensional anchored boxes from [M. Gnewuch, Bracketing numbers for axis-parallel boxes and applications to geometric discrepancy, J. Complexity 24 (2008) 154-172] implies the lower bound $\delta^{-2}+O(\delta^{-1})$ in dimension $d=2$, showing that our constructed covers are (essentially) optimal. We study also other $\delta$-bracketing covers for the set system of rectangles, deduce the coefficient of the most significant term $\delta^{-2}$ in the asymptotic expansion of their cardinality, and compute their cardinality for explicit values of $\delta$.
No associations
LandOfFree
Construction of Minimal Bracketing Covers for Rectangles does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Construction of Minimal Bracketing Covers for Rectangles, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Construction of Minimal Bracketing Covers for Rectangles will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-313225