Sufficiency of simplex inequalities
From MaRDI portal
Elementary problems in Euclidean geometries (51M04) Geometric constructions in real or complex geometry (51M15) Inequalities and extremum problems in real or complex geometry (51M16) Length, area and volume in real or complex geometry (51M25) Inequalities and extremum problems involving convexity in convex geometry (52A40) (n)-dimensional polytopes (52B11)
Abstract: Let z_0,...,z_n be the (n-1)-dimensional volumes of facets of an n-simplex. Then we have the simplex inequalities: z_p < z_0+...+check{z}_p+...+z_n (0 =< p =< n), generalizations of triangle inequalities. Conversely, suppose that numbers z_0,...,z_n > 0 satisfy these inequalities. Does there exist an n-simplex the volumes of whose facets are them? Kakeya solved this problem affirmatively in the case n = 3 and conjectured that the assertion is affirmative also for all n >= 4. We prove that his conjecture is affirmative. To do this, we define three kinds of spaces of loops associated to n-simplices and study relations among them systematically. In particular, we show that the space of edge loops corresponds to the space of facet loops bijectively under a certain condition of positivity.
Recommendations
Cited in
(7)- The median triangle theorem as an entrance to certain issues in higher-dimensional geometry
- Recovering a circumscriptible tetrahedron from its face areas
- Characterization of simplices via the Bezout inequality for mixed volumes
- scientific article; zbMATH DE number 1159584 (Why is no real title available?)
- Anothern-Dimensional Generalization of Pompeiu’s Theorem
- Pompeiu-like theorems for the medians of a simplex
- The existence of triangles, tetrahedra, and higher-dimensional simplices with prescribed exradii
This page was built for publication: Sufficiency of simplex inequalities
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2790206)