Kissing numbers, sphere packings, and some unexpected proofs

103 citations recorded by the source corpus.

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

Convex Optimization & Euclidean Distance Geometry (2004, methodology): “316-322] [41] [58] [88] [89] [187] [202] [207] [248] [249] [273] [276] Course enrollment for Spring quarter 2005 at Stanford was 170 students.”
The sphere packing problem in dimension 24 (2016, methodology): “nique was successfully applied to obtain upper bounds in a wide range of discrete optimization problems such as error-correcting codes [7], equal weight quadrature formulas [8], spherical codes [13], [16]. In exceptional cases linear programming bounds are optimal [5]. However, in general situation ”
The sphere packing problem in dimension 8The sphere packing problem in dimension 8 (2016, methodology): “This technique was successfully applied to obtain upper bounds in a wide range of discrete optimization problems such as error-correcting codes [7], equal weight quadrature formulas [8], and spherical codes [13], [16].”