Fetching the paper…
Reading the bibliography…
The kissing number of $\mathbb{R}^n$ is the maximum number of pairwise-nonoverlapping unit spheres that can simultaneously touch a central unit sphere.
K. Schütte and B.L. van der Waerden, Das Problem der dreizehn Kugeln, Mathematische Annalen
1953
Earlier work this paper cites.
G. Szegö, Orthogonal Polynomials
1975
Earlier work this paper cites.
P. Delsarte, J.M. Goethals, and J.J. Seidel, Spherical codes and designs, Geometriae Dedicata
1977
Earlier work this paper cites.
J.-P. Serre, Linear representations of finite groups
1977
Earlier work this paper cites.
V.I. Levenshtein, On bounds for packings in n n -dimensional Euclidean space, Doklady Akademii Nauk SSSR
1979
Earlier work this paper cites.
A.M. Odlyzko and N.J.A. Sloane, New bounds on the number of unit spheres that can touch a unit sphere in n n dimensions, Journal of Combinatorial Theory, Series A
1979
Earlier work this paper cites.
E. Bannai and N.J.A. Sloane, Uniqueness of certain spherical codes, Canadian Journal of Mathematics
1981
Earlier work this paper cites.
J.H. Conway and N.J.A. Sloane, Sphere Packings, Lattices, and Groups
1988
Cited alongside, same era.
V.A. Zinoviev and T. Ericson, New lower bounds for contact numbers in small dimensions, Problems of Information Transmission
1999
Cited alongside, same era.
W. Fulton and J. Harris, Representation Theory: A First Course
2004
Cited alongside, same era.
K. Gatermann and P.A. Parrilo, Symmetry groups, semidefinite programs, and sums of squares, Journal of Pure and Applied Algebra
2004
Cited alongside, same era.
N. Revol and F. Rouillier, Motivations for an arbitrary precision interval arithmetic and the MPFI library, Reliable Computing
2005
Cited alongside, same era.
C. Bachoc and F. Vallentin, New upper bounds for kissing numbers from semidefinite programming, Journal of the American Mathematical Society
O.R. Musin, The kissing number in four dimensions, Annals of Mathematics
2008
Later among the works it cites.
B. Sturmfels, Algorithms in Invariant Theory
2008
Later among the works it cites.
H.D. Mittelmann and F. Vallentin, High-accuracy semidefinite programming bounds for kissing numbers, Experimental Mathematics
2010
Later among the works it cites.
M. Nakata, A numerical evaluation of highly accurate multiple-precision arithmetic version of semidefinite programming solver: SDPA-GMP,-QD and-DD, in: 2010 IEEE International Symposium on Computer-Aided Control System Design
2010
Later among the works it cites.
C. Bachoc, D.C. Gijswijt, A. Schrijver, and F. Vallentin, Invariant semidefinite programs, in: Handbook on semidefinite, conic, and polynomial optimization
2012
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
2008
Cited alongside, same era.
2015
Later among the works it cites.