BEGIN:VCALENDAR
VERSION:2.0
PRODID:researchseminars.org
CALSCALE:GREGORIAN
X-WR-CALNAME:researchseminars.org
BEGIN:VEVENT
SUMMARY:Matthew Jenssen (KCL)
DTSTART:20260327T153000Z
DTEND:20260327T163000Z
DTSTAMP:20260427T052836Z
UID:TCSCombBham/5
DESCRIPTION:Title: <a href="https://researchseminars.org/talk/TCSCombBham/
 5/">Perspectives on Sphere Packing</a>\nby Matthew Jenssen (KCL) as part o
 f TCS + Combinatorics Joint Seminar Birmingham\n\nLecture held in Poynting
  small lecture theatre.\n\nAbstract\nThe classical sphere packing problem 
 asks: what is the densest possible arrangement of identical\, non-overlapp
 ing spheres in Euclidean space? Over the past century\, sphere packings ha
 ve been intensely studied by mathematicians\, physicists and computer scie
 ntists alike. The interaction between these perspectives has been remarkab
 ly fruitful\, yielding new insights into the nature of packings and many r
 elated problems. In this talk I will survey these viewpoints\, discuss rec
 ent advances\, and highlight connections to combinatorics and algorithms a
 long the way.\n
LOCATION:https://researchseminars.org/talk/TCSCombBham/5/
END:VEVENT
END:VCALENDAR