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
Domaines
Recherche opérationnelle [math.OC]
Origine : Fichiers produits par l'(les) auteur(s)
Loading...