Mathematical Programming Bounds for Kissing Numbers - Archive ouverte HAL Accéder directement au contenu
Chapitre D'ouvrage Année : 2017

Mathematical Programming Bounds for Kissing Numbers

Résumé

We give a short review of existing mathematical programming based bounds for kissing numbers. The kissing number in K dimensions is the maximum number of unit balls arranged around a central unit ball in such a way that the intersection of the interiors of any pair of balls in the configuration is empty. It is a cornerstone of the theory of spherical codes, a good way to find n equally spaced points on the surface of a hypersphere, and the object of a diatribe between Isaac
Fichier principal
Vignette du fichier
knp17.pdf (225.69 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-02105289 , version 1 (20-04-2019)

Identifiants

  • HAL Id : hal-02105289 , version 1

Citer

Leo Liberti. Mathematical Programming Bounds for Kissing Numbers. Optimization and Decision Science: Methodologies and Applications (AIRO/ODS17), pp.213-222, 2017. ⟨hal-02105289⟩
22 Consultations
174 Téléchargements

Partager

Gmail Facebook X LinkedIn More