The set of flexible nondegenerate polyhedra of a prescribed combinatorial structure is not always algebraic
Victor Alexandrov

TL;DR
The paper demonstrates that the set of flexible nondegenerate polyhedra with a given combinatorial structure is not always algebraic by constructing specific examples of nonflexible polyhedra as limits of flexible ones.
Contribution
It provides explicit examples showing that the collection of flexible polyhedra with a fixed combinatorial type is not necessarily an algebraic set.
Findings
Constructed nondegenerate nonflexible polyhedra as limits of flexible ones
Showed the non-algebraic nature of the set of flexible polyhedra
Provided counterexamples to previous assumptions about algebraic sets of polyhedra
Abstract
We construct some example of a closed nondegenerate nonflexible polyhedron in Euclidean 3-space that is the limit of a sequence of nondegenerate flexible polyhedra each of which is combinatorially equivalent to . This implies that the set of flexible nondegenerate polyhedra combinatorially equivalent to is not algebraic.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
