Public lecture: Unpackable Shapes and the Reinhardt Problem

Add to your list(s) Download to your calendar using vCal

• Thomas Hales (University of Pittsburgh)
• Wednesday 23 August 2023, 16:00-17:00
• External.

If you have a question about this talk, please contact nobody.

PMVW01 - 5th International Conference on Packing Problems: Packing and patterns in granular mechanics

Some convex disks are more easily packed than others. Squares, triangles, and parallelograms are highly packable in the plane.  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.  No matter how arranged, a circle packing fills less than 91 percent of the plane.  The Reinhardt problem is to determine the most unpackable centrally symmetric convex disk.  This problem has an amazingly rich structure.

This talk is part of the Isaac Newton Institute Seminar Series series.

This talk is included in these lists:

• All CMS events
• External
• Featured lists
• INI info aggregator
• Isaac Newton Institute Seminar Series
• School of Physical Sciences
• bld31

Note that ex-directory lists are not shown.