BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//CERN//INDICO//EN
BEGIN:VEVENT
SUMMARY:SF Lecture: Tiling Space and Making Hard Problems Harder
DTSTART;VALUE=DATE-TIME:20210514T210000Z
DTEND;VALUE=DATE-TIME:20210514T221500Z
DTSTAMP;VALUE=DATE-TIME:20211026T125000Z
UID:indico-event-2440@indico.flatironinstitute.org
CONTACT:lectures@simonsfoundation.org
DESCRIPTION:Registration link:\nhttps://www.eventbrite.com/e/tiling-space-
and-making-hard-problems-harder-registration-152924293679\n\nA shape can t
ile space if we can take infinitely many copies of the shape and shift the
m around to cover every point without overlapping. For example\, squares a
nd hexagons can tile a plane\, but circles canâ€™t. Questions linger\, tho
ugh. What is the smallest surface area a tile may have? Does the answer ch
ange if we require the tiles to be symmetric?\n\nIn this lecture\, Mark Br
averman will discuss the question of minimizing the surface area of tiles\
, a problem that dates back to the 19th century. The question turns out to
have surprising connections to computational complexity theory in the con
text of combining computationally difficult problems to make them even har
der. Braverman will elucidate these connections and present results on the
minimum surface area problem.\n\nSpeaker Bio:\n\nBravermanÂ is a professo
r at Princeton University. He works primarily on building new connections
between theoretical computer science and other disciplines\, including inf
ormation theory\, game theory\, dynamical systems\, analysis and geometry.
He received a 2016 European Mathematical Society Prize and a 2019 NSF Ala
n T. Waterman Award.\n\nWEBINAR SCHEDULE:\n4:45 - 5:00 PM ET Webinar waiti
ng room opens\n5:00 - 6:15 PM ET Talk + Q&A\n\nRegistration is required fo
r this free event.\n\nFurther instructions and access to join the webinar
will be sent to all registrants upon sign up.\nhttps://indico.flatironinst
itute.org/event/2440/
LOCATION:Zoom
URL:https://indico.flatironinstitute.org/event/2440/
END:VEVENT
END:VCALENDAR