Fetching the paper…
Reading the bibliography…
The best previous lower bounds for kissing numbers in dimensions 25 through 31 were constructed using a set $S$ with $|S| = 480$ of minimal vectors of the Leech Lattice, $\Lambda_{24}$, such that $\langle x, y \rangle \leq 1$ for any distinct $x, y \in S$.
Vladimir I. Levenstein, On bounds for packings in n n -dimensional Euclidian space , Soviet Math. Dokl. 20
1979
Earlier work this paper cites.
Andrew M. Odlyzko and Neil 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 26
1979
Earlier work this paper cites.
1983
Cited alongside, same era.
Frank Celler, Charles R. Leedham-Green, Scott H. Murray, Alice C. Niemeyer, and Eamonn A. O’Brien, Generating random elements of a finite group , Communications in Algebra 23
1995
Cited alongside, same era.
John H. Conway and Neil J. A. Sloane, Sphere packings, lattices and groups , third ed., Springer, 1999
1999
Later among the works it cites.
Henry Cohn, Yang Jiao, Abhinav Kumar, and Salvatore Torquato, Rigidity of spherical codes , Geometry & Topology 15
2011
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…