The following pages link to David de Laat (Q344891):
Displaying 15 items.
- Matrices with high completely positive semidefinite rank (Q344893) (← links)
- Bounds on entanglement dimensions and quantum graph parameters via noncommutative polynomial optimization (Q1650765) (← links)
- \(k\)-point semidefinite programming bounds for equiangular lines (Q2149560) (← links)
- Pair correlation estimates for the zeros of the zeta function via semidefinite programming (Q2288078) (← links)
- Lower bounds on matrix factorization ranks via noncommutative polynomial optimization (Q2329041) (← links)
- A semidefinite programming hierarchy for packing problems in discrete geometry (Q2349135) (← links)
- High-dimensional sphere packing and the modular bootstrap (Q2660222) (← links)
- Fourier Analysis on Finite Groups and the Lovász ϑ-Number of Cayley Graphs (Q2875531) (← links)
- A Breakthrough in Sphere Packing: The Search for Magic Functions (Q2988061) (← links)
- Exact Semidefinite Programming Bounds for Packing Problems (Q4989941) (← links)
- Primes in arithmetic progressions and semidefinite programming (Q4999476) (← links)
- Moment methods in energy minimization: New bounds for Riesz minimal energy problems (Q5217870) (← links)
- Upper bounds for packings of spheres of several radii (Q5496785) (← links)
- Optimality and uniqueness of the D_4 root system (Q6532545) (← links)
- Solving clustered low-rank semidefinite programs arising from polynomial optimization (Q6645951) (← links)
