Department of Mathematics

Analysis and PDE

  •  Alexander Reznikov, Vanderbilt University
  •  Covering properties of configurations optimal for discrete Chebyshev constants
  •  11/07/2016
  •  4:02 PM - 4:52 PM
  •  C517 Wells Hall

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.



Department of Mathematics
Michigan State University
619 Red Cedar Road
C212 Wells Hall
East Lansing, MI 48824

Phone: (517) 353-0844
Fax: (517) 432-1562

College of Natural Science