Jerrard–Wetzel–Yuan conjecture on convex polyhedra

From papers

Let P\mathcal{P} be a convex polyhedron, meaning the convex hull of a finite set of points in R3\mathbb{R}^3 in convex position. A polyhedron is Rupert if there exist R1,R2SO(3)R_1,R_2\in\operatorname{SO}(3) and tR2t\in\mathbb{R}^2 such that

PR1(PC)+tPR2(P),P\circ R_1(\mathcal{P}_C)+t\subset P\circ R_2(\mathcal{P}^{\circ}),

where P:R3R2P:\mathbb{R}^3\to\mathbb{R}^2 drops the xx-coordinate and PC\mathcal{P}_C denotes the set of vertices of the cube. Jerrard–Wetzel–Yuan conjecture. Every convex polyhedron is Rupert. The conjecture was stated hesitantly, and the later construction of the Noperthedron shows that the claim is false: a convex polyhedron exists that is not Rupert.

Progress summary

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

Sources & referencesView supporting material

Primary source

Tony Zeng, “A stellated tetrahedron that is probably not Rupert”, arXiv:2604.26531 (2026).

Solutions 0

No solutions have been posted yet.