BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Talks.cam//talks.cam.ac.uk//
X-WR-CALNAME:Talks.cam
BEGIN:VEVENT
SUMMARY:Three-point bounds for sphere packing - David de Laat (Delft)
DTSTART:20211020T130000Z
DTEND:20211020T140000Z
UID:TALK163093@talks.cam.ac.uk
CONTACT:Hamza Fawzi
DESCRIPTION:The sphere packing problems asks for the densest packing of Eu
 clidean space by congruent balls that do not intersect in their interiors.
  The Cohn-Elkies linear programming bound can be used to obtain upper boun
 ds on the optimal density and has been used by Viazovska and others to sho
 w the E_8 root lattice and Leech lattice configurations in dimensions 8 an
 d 24 are optimal. In other dimensions (except for dimensions 1 and 2) the 
 linear programming bound is not expected to be sharp and currently only sm
 all improvements on this bound are known. In this talk I will discuss new 
 three-point bounds for sphere packing and lattice sphere packing that we u
 se to obtain larger improvements.\n\nJoint work with Henry Cohn and Andrew
  Salmon\n\n*Join Zoom Meeting*\nhttps://maths-cam-ac-uk.zoom.us/j/98523135
 167?pwd=U01ldkI1Vnk5OHpYeEo3UXJJUE1ZZz09\n\nMeeting ID: 985 2313 5167\nPas
 scode: 3aHUXI5F
LOCATION:Virtual (Zoom details under abstract)
END:VEVENT
END:VCALENDAR