The Kissing Number Problem, Spherical Codes, and Designs (series unlisted)

Abstract: What's the maximum number of unit spheres that can touch or "kiss" a given unit sphere without any of 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 dimensions 8 and 24 and what's so special about the optimal configuration in these dimensions that makes the proof possible.

Mathematics

Audience: general audience

Pizza Seminar