Jerrard–Wetzel–Yuan conjecture on convex polyhedra
Statement
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.
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.