Jerrard–Wetzel–Yuan conjecture on convex polyhedra
Jerrard–Wetzel–Yuan conjecture on convex polyhedra
Let be a convex polyhedron, meaning the convex hull of a finite set of points in in convex position. A polyhedron is Rupert if there exist and such that
where drops the -coordinate and 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
Sign in to submit a solution.
No solutions have been posted yet.