← All problems

The universal Rupert conjecture for convex polyhedra

5 years old · traced to

A convex polyhedron is a polyhedron in R⁡3\operatorname{\mathbb{R}}^3 whose faces are convex polygons. Such a polyhedron has Rupert's property if a hole can be cut into it through which a congruent copy of the polyhedron can pass. Universal Rupert conjecture. Every convex polyhedron has Rupert's property. This is a longstanding open problem motivated by the fact that all five Platonic solids and all but three of the Archimedean solids are known to be Rupert.

References
  1. Jakob Steininger and Sergey Yurkevich, “An algorithmic approach to Rupert's problem”, arXiv:2112.13754 (2023).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.