David de Laat

Orcid: 0000-0002-5178-1906

According to our database1, David de Laat authored at least 10 papers between 2014 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Solving clustered low-rank semidefinite programs arising from polynomial optimization.
Math. Program. Comput., September, 2024

Optimality of spherical codes via exact semidefinite programming bounds.
CoRR, 2024

2022
k-Point semidefinite programming bounds for equiangular lines.
Math. Program., 2022

2021
Exact Semidefinite Programming Bounds for Packing Problems.
SIAM J. Optim., 2021

Primes in arithmetic progressions and semidefinite programming.
Math. Comput., 2021

2019
Lower Bounds on Matrix Factorization Ranks via Noncommutative Polynomial Optimization.
Found. Comput. Math., 2019

Pair correlation for Dedekind zeta functions of abelian extensions.
CoRR, 2019

2018
Bounds on entanglement dimensions and quantum graph parameters via noncommutative polynomial optimization.
Math. Program., 2018

2015
A semidefinite programming hierarchy for packing problems in discrete geometry.
Math. Program., 2015

2014
Fourier Analysis on Finite Groups and the Lovász ϑ-Number of Cayley Graphs.
Exp. Math., 2014


  Loading...