Universal minima of discrete potentials for sharp spherical codes

  • Peter Boyvalenkov

    Bulgarian Academy of Sciences, Sofia, Bulgaria
  • Peter Dragnev

    Purdue University Fort Wayne, Fort Wayne, USA
  • Douglas Hardin

    Vanderbilt University, Nashville, USA
  • Edward Saff

    Vanderbilt University, Nashville, USA
  • Maya Stoyanova

    Sofia University “St. Kliment Ohridski”, Sofia, Bulgaria
Universal minima of discrete potentials for sharp spherical codes cover
Download PDF

A subscription is required to access this article.

Abstract

This article is devoted to the study of discrete potentials on the sphere in for sharp codes. We show that the potentials of most of the known sharp codes attain the universal lower bounds for polarization for spherical -designs previously derived by the authors, where “universal” is meant in the sense of applying to a large class of potentials that includes absolutely monotone functions of inner products. We also extend our universal bounds to -designs and the associated polynomial subspaces determined by the vanishing moments of spherical configurations, and thus obtain the minima for the icosahedron, the dodecahedron, and sharp codes coming from and the Leech lattice. For this purpose, we investigate quadrature formulas for certain subspaces of Gegenbauer polynomials which we call PULB subspaces, particularly those having basis Furthermore, for potentials with , we prove that the strong sharp codes and the antipodal sharp codes attain the universal bounds and their minima occur at points of the codes. The same phenomenon is established for the -cell when the potential satisfies , , and .

Cite this article

Peter Boyvalenkov, Peter Dragnev, Douglas Hardin, Edward Saff, Maya Stoyanova, Universal minima of discrete potentials for sharp spherical codes. Rev. Mat. Iberoam. (2024), published online first

DOI 10.4171/RMI/1509