Alexander Reznikov


Speaker: Alexander Reznikov
Title: Covering Properties of Various Discrete Configurations
Affiliation: Vanderbilt University
Date: Wednesday, December 14, 2016
Place and Time: Room 101, Love Building, 3:35-4:30 pm
Refreshments: Room 204, Love Building, 3:00 pm

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.