Abstract:
Prince Rupert's problem asks which solids can pass through a hole cut in a
congruent copy of themselves. This curious question dates back to the 17th
century and recently it has been conjectured that all convex polyhedra in
3D satisfy this property. In this talk we present a counter example to this
conjecture, the Noperthedron, which is the first convex polyhedron that is
not Rupert. Moreover, we share our framework for deciding Rupert's
property, based on geometric projections, optimization, and certified
computation. We also recall our 2021 results proving that all Platonic
solids and many Archimedean, Catalan, Johnson solids are Rupert. We
outline the ideas behind the global and local theorems used in the proof of
the counter example and discuss its computational verification.
On Rupert’s problem
28.01.2026 15:15 - 16:30
Organiser:
A. Mellit, J. L. Romero, R. Bot
Location: