An Upper Bound of the Minimal Dispersion via Delta Covers
Computational Geometry
2017-10-03 v3 Numerical Analysis
Abstract
For a point set of elements in the -dimensional unit cube and a class of test sets we are interested in the largest volume of a test set which does not contain any point. For all natural numbers , and under the assumption of a -cover with cardinality we prove that there is a point set, such that the largest volume of such a test set without any point is bounded by . For axis-parallel boxes on the unit cube this leads to a volume of at most and on the torus to .
Cite
@article{arxiv.1701.06430,
title = {An Upper Bound of the Minimal Dispersion via Delta Covers},
author = {Daniel Rudolf},
journal= {arXiv preprint arXiv:1701.06430},
year = {2017}
}
Comments
10 pages, accepted in Ian Sloan's 80th birthday festschrift