New upper bounds for kissing numbers from semidefinite programming-Reference-Cited by-同舟云学术

New upper bounds for kissing numbers from semidefinite programming

Published:2007-11-29 Issue:3 Volume:21 Page:909-924
ISSN:0894-0347
Container-title:Journal of the American Mathematical Society
language:en
Short-container-title:J. Amer. Math. Soc.

Author:

Bachoc Christine,Vallentin Frank

Abstract

Recently A. Schrijver derived new upper bounds for binary codes using semidefinite programming. In this paper we adapt this approach to codes on the unit sphere and we compute new upper bounds for the kissing number in several dimensions. In particular our computations give the (known) values for the cases n = 3 , 4 , 8 , 24 n = 3, 4, 8, 24 .

Publisher

American Mathematical Society (AMS)

Subject

Applied Mathematics,General Mathematics

Link

http://www.ams.org/jams/2008-21-03/S0894-0347-07-00589-9/S0894-0347-07-00589-9.pdf

Reference24 articles.

1. Encyclopedia of Mathematics and its Applications;Andrews, George E.,1999

2. CSDP, a C library for semidefinite programming;Borchers, Brian;Optim. Methods Softw.,1999

3. Uniqueness of certain spherical codes;Bannai, Eiichi;Canadian J. Math.,1981

4. Arrangements of 13 points on a sphere;Böröczky, Károly,2003

5. Arrangements of 14, 15, 16 and 17 points on a sphere;Böröczky, K.;Studia Sci. Math. Hungar.,2003

Cited by 84 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Solving clustered low-rank semidefinite programs arising from polynomial optimization;Mathematical Programming Computation;2024-09-06

2. Optimizers of three-point energies and nearly orthogonal sets;Proceedings of the American Mathematical Society;2024-07-31

3. Mutually unbiased bases: polynomial optimization and symmetry;Quantum;2024-04-30

4. The Problem of Thirteen Balls;Birkhäuser Advanced Texts Basler Lehrbücher;2024

5. Spherical designs and modular forms of the $$D_4$$ lattice;Research in Number Theory;2023-11-01