Nando Leijenhorst

most citedOptimality of spherical codes via exact semidefinite programming bounds

1 citations · 1 across the 3 of their papers we have counts for

collaborators

Showing math.MGShow all

2 papers · 1 filter

math.MG2024

Optimality and uniqueness of the $D_{4}$ root system

David de Laat, Nando M. Leijenhorst, Willem H. H. de Muinck Keizer

We prove that the $D_{4}$ root system (the set of vertices of the regular $24$ -cell) is the unique optimal kissing configuration in $R^{4}$ , and is an optimal spherical code. F…

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 $56$ points in $20$ dimensions, $50$ points i…

Optimality and uniqueness of the D4​ root system

Optimality of spherical codes via exact semidefinite programming bounds

Optimality and uniqueness of the $D_{4}$ root system