Seminar: David de Laat (TU Delft)
- https://wsc.project.cwi.nl/dutch-optimization-seminar/events/seminar-david-de-laat-tu-delft
- Seminar: David de Laat (TU Delft)
- 2021-01-28T16:00:00+01:00
- 2021-01-28T17:00:00+01:00
- When Jan 28, 2021 from 04:00 PM to 05:00 PM (Europe/Amsterdam / UTC100)
-
Add event to calendar
iCal
Speaker: David de Laat (TU Delft)
Title: Sphere packing and semidefinite programming
Zoom link:
https://cwi-nl.zoom.us/j/84909645595?pwd=b1M4QnNKVzNMdmNSVFNaZUJmR1kvUT09
(Meeting ID: 849 0964 5595, Passcode: 772448)
Abstract:
In this talk I will discuss how semidefinite programming can be used to
compute bounds in discrete geometry. First I will focus on compact problems
such as the spherical code problem, which asks for the largest number of
points on a unit sphere such that the inner product between any pair of
disctinct points is at most some given constant. Then I will discuss the
(noncompact) sphere packing problem, explain how this connects to problems
in analytic number theory and the conformal bootstrap program, and discuss
how semidefinite programming can be used to obtain improved bounds.
compute bounds in discrete geometry. First I will focus on compact problems
such as the spherical code problem, which asks for the largest number of
points on a unit sphere such that the inner product between any pair of
disctinct points is at most some given constant. Then I will discuss the
(noncompact) sphere packing problem, explain how this connects to problems
in analytic number theory and the conformal bootstrap program, and discuss
how semidefinite programming can be used to obtain improved bounds.
Video:
Slides: