Mark Braverman, Ph.D.Professor, Department of Computer Science, Princeton University
Simons Foundation Presidential Lectures are free public colloquia centered on four main themes: Biology, Physics, Mathematics and Computer Science, and Neuroscience and Autism Science. These curated, high-level scientific talks feature leading scientists and mathematicians and are intended to foster discourse and drive discovery among the broader NYC-area research community. We invite anyone interested in the topic to join us for this weekly lecture series.
A shape can tile space if we can take infinitely many copies of the shape and shift them around to cover every point without overlapping. For example, squares and hexagons can tile a plane, but circles can’t. Questions linger, though. What is the smallest surface area a tile may have? Does the answer change if we require the tiles to be symmetric?
In this lecture, Mark Braverman 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 context of combining computationally difficult problems to make them even harder. Braverman will elucidate these connections and present results on the minimum surface area problem.