BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Talks.cam//talks.cam.ac.uk//
X-WR-CALNAME:Talks.cam
BEGIN:VEVENT
SUMMARY:Public lecture: Unpackable Shapes and the Reinhardt Problem - Thom
 as Hales (University of Pittsburgh)
DTSTART:20230823T150000Z
DTEND:20230823T160000Z
UID:TALK202630@talks.cam.ac.uk
DESCRIPTION:Some convex disks are more easily packed than others. Squares\
 , triangles\, and parallelograms are highly packable in the plane.&nbsp\; 
 In fact\, each of these shapes is perfectly packable in the sense that it 
 tiles the plane. On the other hand\, the circle is relatively unpackable.&
 nbsp\; No matter how arranged\, a circle packing fills less than 91 percen
 t of the plane.&nbsp\; The Reinhardt problem is to determine the most unpa
 ckable centrally symmetric convex disk.&nbsp\; This problem has an amazing
 ly rich structure.
LOCATION:External
END:VEVENT
END:VCALENDAR