Discrete Energy on Rectifiable Sets pp 193-260 | Cite as
Linear Programming Bounds and Universal Optimality on the Sphere
Chapter
First Online:
- 1.6k Downloads
Abstract
This chapter is primarily devoted to linear programming methods for determining bounds and exact solutions for Riesz minimal energy, best-packing, and kissing number problems on the sphere \(S^d\subset \mathbb R^{d+1}\).
Copyright information
© Springer Science+Business Media, LLC, part of Springer Nature 2019