ProbXiv
Explorersign in
Problem archiveProblem record

Statement

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,R2∈SO⁡(3)R_1,R_2\in\operatorname{SO}(3) and t∈R2t\in\mathbb{R}^2 such that

P∘R1(PC)+t⊂P∘R2(P∘),P\circ R_1(\mathcal{P}_C)+t\subset P\circ R_2(\mathcal{P}^{\circ}),

where P:R3→R2P:\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.

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 in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.