BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//talks.cam.ac.uk//v3//EN
BEGIN:VTIMEZONE
TZID:Europe/London
BEGIN:DAYLIGHT
TZOFFSETFROM:+0000
TZOFFSETTO:+0100
TZNAME:BST
DTSTART:19700329T010000
RRULE:FREQ=YEARLY;BYMONTH=3;BYDAY=-1SU
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:+0100
TZOFFSETTO:+0000
TZNAME:GMT
DTSTART:19701025T020000
RRULE:FREQ=YEARLY;BYMONTH=10;BYDAY=-1SU
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
CATEGORIES:Isaac Newton Institute Seminar Series
SUMMARY:Public lecture: Unpackable Shapes and the Reinhard
 t Problem - Thomas Hales (University of Pittsburgh
 )
DTSTART;TZID=Europe/London:20230823T160000
DTEND;TZID=Europe/London:20230823T170000
UID:TALK202630AThttp://talks.cam.ac.uk
URL:http://talks.cam.ac.uk/talk/index/202630
DESCRIPTION:Some convex disks are more easily packed than othe
 rs. Squares\, triangles\, and parallelograms are h
 ighly packable in the plane.&nbsp\; In fact\, each
  of these shapes is perfectly packable in the sens
 e 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 9
 1 percent of the plane.&nbsp\; The Reinhardt probl
 em is to determine the most unpackable centrally s
 ymmetric convex disk.&nbsp\; This problem has an a
 mazingly rich structure.
LOCATION:External
CONTACT:
END:VEVENT
END:VCALENDAR