Advertisement

Linear Programming Bounds and Universal Optimality on the Sphere

  • Sergiy V. BorodachovEmail author
  • Douglas P. Hardin
  • Edward B. Saff
Chapter
  • 1.6k Downloads
Part of the Springer Monographs in Mathematics book series (SMM)

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

Authors and Affiliations

  • Sergiy V. Borodachov
    • 1
    Email author
  • Douglas P. Hardin
    • 2
  • Edward B. Saff
    • 2
  1. 1.Department of MathematicsTowson UniversityTowsonUSA
  2. 2.Center for Constructive Approximation, Department of MathematicsVanderbilt UniversityNashvilleUSA

Personalised recommendations