A net is a subset of [0,1]d containing the expected number of points in every large dyadic subcube. Nets are one of the central objects in discrepancy theory, with numerous applications in numerical algorithms. In this talk, I will discuss a construction of sets that instead contain approximately correct number of points in every large dyadic subcube, and how these can be used to construct sets in ℝd without large convex holes.
Based on joint works with Ting-Wei Chao and Ron Holzman.
This video is part of the Webinar in Additive Combinatorics series, and this is their YouTube channel.
