MCQMC 2018, July 1-6 2018, Rennes, France: Dispersion and Applications
Sprache des Titels:
The dispersion of a point set, which is the volume of the largest axis-parallel box in the unit cube that does not intersect the point set, is an alternative to the discrepancy as a measure for certain (uniform) Distribution properties. The computation of the dispersion, or even the best possible dispersion, in dimension two has a long
history in computational geometry and computational complexity theory. Given the prominence of the problem, it is quite surprising that, until recently, very little was known about the size of the largest empty box in higher dimensions. In the proposed special session we focus on recent developments in this area of research. Besides upper and lower bounds on the (minimal) dispersion that show, in particular, the surprising logarithmic dependence on the
dimension of the inverse dispersion, we want to deal with recently established connections of the dispersion to numerical approximation problems, like the approximation of rank-one tensors.