Mono-monostatic polyhedra with uniform point masses have at least 8 vertices
S\'andor Boz\'oki, G\'abor Domokos, Fl\'ori\'an Kov\'acs and, Krisztina Reg\H{o}s

TL;DR
This paper introduces an algorithm that improves the lower bound on the number of vertices for mono-monostatic polyhedra with uniform point masses, establishing that such polyhedra must have at least 8 vertices.
Contribution
The authors develop an algorithm that increases the known lower bound for vertices in mono-monostatic 0-skeletons from 5 to 8, advancing understanding of these geometric structures.
Findings
Lower bound for vertices in mono-monostatic 0-skeletons is now 8.
The algorithm is less effective for mono-stability cases.
The work relates to monostatic properties of higher-dimensional simplices.
Abstract
The monostatic property of convex polyhedra (i.e. the property of having just one stable or unstable static equilibrium point) has been in the focus of research ever since Conway and Guy published the proof of the existence of the first such object, followed by the constructions of Bezdek and Reshetov. These examples establish as the respective \emph{upper bounds} for the minimal number of faces and vertices for a homogeneous mono-stable polyhedron. By proving that no mono-stable homogeneous tetrahedron existed, Conway and Guy established for the same problem the lower bounds for the number of faces and vertices as and the same lower bounds were also established for the mono-unstable case. It is also clear that the bounds also apply for convex, homogeneous point sets with unit masses at each point (also called polyhedral 0-skeletons) and…
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.
Taxonomy
TopicsAdvanced Graph Theory Research · Point processes and geometric inequalities · Computational Geometry and Mesh Generation
