BEGIN:VCALENDAR
VERSION:2.0
PRODID:researchseminars.org
CALSCALE:GREGORIAN
X-WR-CALNAME:researchseminars.org
BEGIN:VEVENT
SUMMARY:Forrest Thurman
DTSTART:20201120T184000Z
DTEND:20201120T194000Z
DTSTAMP:20260423T004757Z
UID:Pizza/11
DESCRIPTION:Title: <a href="https://researchseminars.org/talk/Pizza/11/">T
 he Kissing Number Problem\, Spherical Codes\, and Designs</a>\nby Forrest 
 Thurman as part of Pizza Seminar\n\n\nAbstract\nWhat's the maximum number 
 of unit spheres that can touch or "kiss" a given unit sphere without any o
 f them overlapping? This problem is currently only solved in dimensions 1\
 ,2\,3\,4\,8\,and 24. We will cover the (surprisingly simple) proof in dime
 nsions 8 and 24 and what's so special about the optimal configuration in t
 hese dimensions that makes the proof possible.\n
LOCATION:https://researchseminars.org/talk/Pizza/11/
END:VEVENT
END:VCALENDAR