Almost uniform distribution in the cube and a problem of Erdős

What is the "most uniformly distributed" set in [0,1]^d? Historically, this question has been motivated both by applications to numerical algorithms and by diophantine approximation problems in number theory. In this talk, I will tell about new constructions of well-distributed points in the cube, and their link to an old problem of Erdős about points in convex position. The talk is aimed at the general audience.

Bio
http://www.borisbukh.org/