7 citations · 13 across the 3 of their papers we have counts for
Showing math.MGShow all
3 papers · 1 filter
math.MG2024★ 1 cited
Optimality of spherical codes via exact semidefinite programming bounds
Henry Cohn, David de Laat, Nando Leijenhorst
We show that the spectral embeddings of all known triangle-free strongly regular graphs are optimal spherical codes (the new cases are points in dimensions, points i…
math.MG2022★ 7 cited
Three-point bounds for sphere packing
Henry Cohn, David de Laat, Andrew Salmon
We define three-point bounds for sphere packing that refine the linear programming bound, and we compute these bounds numerically using semidefinite programming by choosing a trunc…
math.MG2016★ 5 cited
A Breakthrough in Sphere Packing: The Search for Magic Functions
David de Laat, Frank Vallentin
This paper is an exposition, written for the Nieuw Archief voor Wiskunde, about the two recent breakthrough results in the theory of sphere packings. It includes an interview with…