On the discrepancy for boxes and polytopes
From MaRDI portal
Publication:1295740
DOI10.1007/S006050050044zbMATH Open0923.11112OpenAlexW2061408994MaRDI QIDQ1295740FDOQ1295740
Authors: Jiří Matoušek
Publication date: 28 June 1999
Published in: Monatshefte für Mathematik (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s006050050044
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
asymptotic boundirregularities of distributionLebesgue-measure discrepancypartial coloring[https://portal.mardi4nfdi.de/w/index.php?title=+Special%3ASearch&search=Tusn%EF%BF%BD%EF%BF%BDdy%27s+problem&go=Go Tusn��dy's problem]
Cited In (9)
- The discrepancy of a needle on a checkerboard. II.
- An elementary approach to lower bounds in geometric discrepancy
- The discrepancy of boxes in higher dimension
- Balanced two-colorings of finite sets in the cube
- Efficient algorithms for discrepancy minimization in convex sets
- On the \(L_2\)-discrepancy for anchored boxes
- TIGHTER BOUNDS FOR THE DISCREPANCY OF BOXES AND POLYTOPES
- Coloring \(t\)-dimensional \(m\)-boxes
- New results on the coarseness of bicolored point sets
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)