Fourier Analysis on Finite Groups and the Lovász ϑ-Number of Cayley Graphs. - Evan DeCorte; David de Laat; Frank Vallentin (Exp. Math., 2014)

A semidefinite programming hierarchy for packing problems in discrete geometry. - David de Laat; Frank Vallentin (Math. Program., 2015)

Bounds on entanglement dimensions and quantum graph parameters via noncommutative polynomial optimization. - Sander Gribling; David de Laat; Monique Laurent (Math. Program., 2018)

Pair correlation for Dedekind zeta functions of abelian extensions. - David de Laat; Larry Rolen; Zack Tripp; Ian Wagner (CoRR, 2019)

Lower Bounds on Matrix Factorization Ranks via Noncommutative Polynomial Optimization. - Sander Gribling; David de Laat; Monique Laurent (Found. Comput. Math., 2019)

Primes in arithmetic progressions and semidefinite programming. - Andrés Chirre; Valdir José Pereira Júnior; David de Laat (Math. Comput., 2021)

Exact Semidefinite Programming Bounds for Packing Problems. - Maria Dostert; David de Laat; Philippe Moustrou (SIAM J. Optim., 2021)

k-Point semidefinite programming bounds for equiangular lines. - David de Laat; Fabrício Caluza Machado; Fernando Mário de Oliveira Filho; Frank Vallentin (Math. Program., 2022)

Optimality of spherical codes via exact semidefinite programming bounds. - Henry Cohn; David de Laat; Nando Leijenhorst (CoRR, 2024)

Multiplicity of nontrivial zeros of primitive 𝐿-functions via higher-level correlations. - Felipe Gonçalves; David de Laat; Nando Leijenhorst (Math. Comput., 2024)

Solving clustered low-rank semidefinite programs arising from polynomial optimization. - Nando Leijenhorst; David de Laat (Math. Program. Comput., 2024)