Recommendations
- Tighter bounds for the discrepancy of boxes and polytopes
- The discrepancy of boxes in higher dimension
- On the discrepancy of combinatorial rectangles
- Combinatorial discrepancy for boxes via the \(\gamma_2\) norm
- On the \(L_2\)-discrepancy for anchored boxes
- On the discrepancy of convex plane sets
- Inner and outer approximations of polytopes using boxes.
- Discrepancy with respect to convex polygons
- On combinatorial rectangles with minimum \(\infty \)-discrepancy
Cited in
(11)- Efficient algorithms for discrepancy minimization in convex sets
- The discrepancy of boxes in higher dimension
- Balanced two-colorings of finite sets in the cube
- Tusnády's problem, the transference principle, and non-uniform QMC sampling
- Coloring \(t\)-dimensional \(m\)-boxes
- On the \(L_2\)-discrepancy for anchored boxes
- An elementary approach to lower bounds in geometric discrepancy
- New results on the coarseness of bicolored point sets
- Combinatorial discrepancy for boxes via the \(\gamma_2\) norm
- Tighter bounds for the discrepancy of boxes and polytopes
- The discrepancy of a needle on a checkerboard. II.
This page was built for publication: On the discrepancy for boxes and polytopes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1295740)