Search Results
Abstract
A polytope in a finite-dimensional normed space is subequilateral if the length in the norm of each of its edges equals its diameter. Subequilateral polytopes occur in the study of two unrelated subjects: surface energy minimizing cones and edge-antipodal polytopes. We show that the number of vertices of a subequilateral polytope in any d-dimensional normed space is bounded above by (d / 2 + 1) d for any d ≥ 2. The same upper bound then follows for the number of vertices of the edge-antipodal polytopes introduced by I. Talata [19]. This is a constructive improvement to the result of A. Pr (to appear) that for each dimension d there exists an upper bound f(d) for the number of vertices of an edge-antipodal d-polytopes. We also show that in d-dimensional Euclidean space the only subequilateral polytopes are equilateral simplices.
Abstract
A convex d-polytope in ℝ d is called edge-antipodal if any two vertices that determine an edge of the polytope lie on distinct parallel supporting hyperplanes of the polytope. We introduce a program for investigating such polytopes, and examine those that are simple.
Abstract
A convex body K in ℝ d is said to be reduced if the minimum width of each convex body properly contained in K is strictly smaller than the minimum width of K. We study the question of Lassak on the existence of reduced polytopes of dimension larger than two. We show that a pyramid of dimension larger than two with equal numbers of facets and vertices is not reduced. This generalizes the main result from [8].