Stability of optimal spherical codes
Abstract
For many extremal configurations of points on a sphere, the linear programming approach can be used to show their optimality. In this paper we establish the general framework for showing stability of such configurations and use this framework to prove the stability of the two spherical codes formed by minimal vectors of the lattice E8 and of the Leech lattice.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.