Generic first-order rigidity conjecture for combinatorial types of convex polytopes

About 1 year old · traced to

Let P\mathcal P be the combinatorial type of a convex polytope of dimension d≥3d\geq 3. Generic first-order rigidity conjecture. If P\mathcal P is the combinatorial type of a convex polytope of dimension d≥3d\geq 3, then P\mathcal P is generically (first-order) rigid. This is the precise formulation of generic rigidity used in the paper. The conjecture is proved for d=3d=3, whereas it remains open for d≥4d\geq 4.

References

Primary source

Matthias Himmelmann, Bernd Schulze and Martin Winter, “Rigidity of polytopes with edge length and coplanarity constraints”, arXiv:2505.00874 (2026).

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.