Nando Leijenhorst

36.HB 04.240

Mekelweg 4

Delft, the Netherlands

I am a PhD candidate at the Discrete Mathematics and Optimization group at Delft University of Technology.

Currently I am interested in applying semidefinite programming and polynomial optimization techniques to problems in discrete geometry, such as the kissing number problem and the sphere packing problem.

selected publications

Preprint

Optimality and uniqueness of the D_4 root system

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

Apr 2024

arXiv Bib

@unpublished{dLLdMK24,
  title = {Optimality and uniqueness of the D_4 root system},
  author = {{de Laat}, David and Leijenhorst, Nando and {de Muinck Keizer}, Willem H. H.},
  publisher = {arXiv},
  month = apr,
  year = {2024},
  keywords = {Mathematics - Metric Geometry}
}

Preprint

Optimality of spherical codes via exact semidefinite programming bounds

Henry Cohn, David de Laat, and Nando Leijenhorst

Mar 2024

arXiv Bib

@unpublished{CdLL24,
  author = {Cohn, Henry and {de Laat}, David and Leijenhorst, Nando},
  publisher = {arXiv},
  month = mar,
  year = {2024},
  keywords = {Mathematics - Metric Geometry}
}