[go: up one dir, main page]
Follow
Nando Leijenhorst
Title
Cited by
Cited by
Year
Solving clustered low-rank semidefinite programs arising from polynomial optimization
N Leijenhorst, D de Laat
Mathematical Programming Computation 16 (3), 503-534, 2024
222024
Optimality and uniqueness of the root system
D de Laat, NM Leijenhorst, WHH Keizer
arXiv preprint arXiv:2404.18794, 2024
92024
Optimality of spherical codes via exact semidefinite programming bounds
H Cohn, D de Laat, N Leijenhorst
arXiv preprint arXiv:2403.16874, 2024
72024
Multiplicity of nontrivial zeros of primitive 𝐿-functions via higher-level correlations
F Gonçalves, D De Laat, N Leijenhorst
Mathematics of Computation 94 (354), 2041-2058, 2025
32025
On the computation of three and four-point bounds in discrete geometry and analytic number theory
NM Leijenhorst
2025
Data for" Optimality of spherical codes via exact semidefinite programming bounds"
H Cohn, D de Laat, N Leijenhorst
2024
The system can't perform the operation now. Try again later.
Articles 1–6