Title: Covering properties of configurations optimal for discrete Chebyshev constants

Date: 11/07/2016

Time: 4:02 PM - 4:52 PM

Place: C517 Wells Hall

Speaker: Alexander Reznikov, Vanderbilt University

It is well known that, for a fixed integer N and as s goes to infinity, the optimal configurations for minimal discrete N-point s-Riesz energy on a compact set A converge to N-point configurations that solves the best-packing problem on A. We present a max-min problem that, in the limit, solves the best-covering problem, which is somewhat dual to best-packing. We will discuss other distributional properties of optimal configurations for this new problem, as well as applications to numerical integration and convex geometry.