تقرير
The smallest mono-unstable, homogeneous convex polyhedron has at least 7 vertices
| العنوان: | The smallest mono-unstable, homogeneous convex polyhedron has at least 7 vertices |
|---|---|
| المؤلفون: | Bozóki, Sándor, Domokos, Gábor, Papp, Dávid, Regős, Krisztina |
| سنة النشر: | 2024 |
| المجموعة: | Mathematics |
| مصطلحات موضوعية: | Mathematics - Metric Geometry, 52B10 (Primary) 90C22, 37C20, 52A38 (Secondary) |
| الوصف: | We prove that every homogeneous convex polyhedron with only one unstable equilibrium (known as a mono-unstable convex polyhedron) has at least $7$ vertices. Although it has been long known that no mono-unstable tetrahedra exist, and mono-unstable polyhedra with as few as $18$ vertices and faces have been constructed, this is the first nontrivial lower bound on the number of vertices for a mono-unstable polyhedron. There are two main ingredients in the proof. We first establish two types of relationships, both expressible as (non-convex) quadratic inequalities, that the coordinates of the vertices of a mono-unstable convex polyhedron must satisfy, taking into account the combinatorial structure of the polyhedron. Then we use numerical semidefinite optimization algorithms to compute easily and independently verifiable, rigorous certificates that the resulting systems of quadratic inequalities (5943 in total) are indeed inconsistent in each case. Comment: Submitted for publication |
| نوع الوثيقة: | Working Paper |
| URL الوصول: | http://arxiv.org/abs/2401.17906 |
| رقم الأكسشن: | edsarx.2401.17906 |
| قاعدة البيانات: | arXiv |
| الوصف غير متاح. |