Semidefinite programming bounds for distance distribution of spherical codes
Optimization and Control
2023-10-03 v2 Combinatorics
Metric Geometry
Abstract
We present an extension of known semidefinite and linear programming upper bounds for spherical codes. We apply the main result for the distance distribution of a spherical code and show that this method can work effectively In particular, we get a shorter solution to the kissing number problem in dimension 4.
Cite
@article{arxiv.2309.13854,
title = {Semidefinite programming bounds for distance distribution of spherical codes},
author = {Oleg R. Musin},
journal= {arXiv preprint arXiv:2309.13854},
year = {2023}
}
Comments
14 pages, 1 figure. arXiv admin note: substantial text overlap with arXiv:1903.05767