Optimal configurations of points arise in many contexts, for example classical ground states for interacting particle systems, Euclidean packings of convex bodies, as well as minimal discrete and continuous energy problems for general kernels. Relevant questions in this area include the understanding of asymptotic optimal configurations, of lattice and periodic configurations, the development of algorithmic constructions of near optimal configurations, and the application of methods in convex optimization such as linear and semidefinite programming.
Cite this article
Christine Bachoc, Peter Grabner, Edward B. Saff, Achill Schürmann, Optimal and Near Optimal Configurations on Lattices and Manifolds. Oberwolfach Rep. 9 (2012), no. 3, pp. 2429–2492DOI 10.4171/OWR/2012/40