A survey of recet results on the dispersion of point sets

Description

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 this talk we will give a survey about recent developments.

Period	29 Nov 2018
Event title	RICAM Special semester on multivariate algorithms and their foundations in number theory, October-December, 2018
Event type	Conference
Location	AustriaShow on map