Rigidity of polytopes with edge length and coplanarity constraints
Matthias Himmelmann, Bernd Schulze, Martin Winter
TL;DR
The paper studies rigidity of polytopes under fixed edge lengths and face planarity constraints, showing the regular cube is flexible under this notion and introducing a notion of generic realizations. It proves that 3D polyhedra are generically rigid, using a contraction-sequence strategy together with Tutte embeddings and the Maxwell-Cremona correspondence, and it develops a framework to define genericity on irreducible components via Zariski convexity. The work connects to classical results on rigidity (Cauchy, Dehn, Gluck) and extends them to general combinatorial types, while outlining a program for higher dimensions, second-order rigidity, and edge-length perturbations. It also raises numerous open questions about the extent of flexibility in non-convex or non-Euclidean settings and the role of affine transformations in polytope rigidity. Overall, the paper provides a rigorous 3D confirmation of generic rigidity for polytopes and lays out a robust toolkit for exploring rigidity in broader geometric contexts.
Abstract
We investigate a novel setting for polytope rigidity, where a flex must preserve edge lengths and the planarity of faces, but is allowed to change the shapes of faces. For instance, the regular cube is flexible in this notion. We present techniques for constructing flexible polytopes and find that flexibility seems to be an exceptional property. Based on this observation, we introduce a notion of generic realizations for polytopes and conjecture that convex polytopes are generically rigid in dimension $d\geq 3$. We prove this conjecture in dimension $d=3$. Motivated by our findings we also pose several questions that are intended to inspire future research into this notion of polytope rigidity.
