2023/09/25 by Oleg R. Musin, Musin, Oleg R.
Mathematics · #Combinatorics (math.CO) #FOS: Mathematics #Mathematical Approximation and Integration #Metric Geometry (math.MG) #Optimization and Control (math.OC)
paper · pdf · doi:10.48550/arxiv.2309.13854
openalex publication_date 2023/09/25 · openalex created_date 2023/09/27 · openalex updated_date 2026/07/28
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.