Colloquium: "Covering Properties of Various Discrete Configurations"

Abstract: We will discuss the problem of covering a compact set by a minimal number of balls of the given radius. This problem is known to be somewhat dual to the famous best-packing problem. In particular, we will compare covering properties of random i.i.d. points, of points that solve the minimal energy problem and of points that solve the less studied maximal discrete polarization (discrete Chebyshev constant) problem.

Teat @ 3:45 in Cupples I, Room 200

Host: Brett Wick