3
$\begingroup$

Each convex polytope $P$ has a combinatorial type, its so-called face lattice. This lattice is just the poset of all faces of $P$ ordered by inclusion. Given one realization of such a combinatorial type, one can easily get many others. Just apply an arbitrary projective map to the given realization and the image will be combinatorially equivalent.

Now it would be very nice if one could realize every combinatorial type with vertices on the sphere. Unfortunately, this is not possible. For example, consider the octahedron with pyramids stacked on each facet -- this cannot have all vertices on the sphere (and still be convex).

So my questions is:

Is there a convex body in $\mathbb{R}^d$ such that every possible combinatorial type of a $d$-dimensional convex polytope can be realized with vertices on its surface?

  • 0
    I don't understand. Am octahedron with a pyramid glued to each facet is not a convex polytope, is it? In what sense is it a possible combinatorial type of a convex polytope?2012-06-08
  • 0
    @GerryMyerson: Consider a facet $F$ of the octahedron $O$. Let $x$ be a point outside $O$ but very close to the centroid of $F$. Taking the convex hull of $\{x\} \cup P$ yields a polytope that is an octahedron with a pyramid stacked on top of $F$. Repeat this construction for every facet of $O$. This yields a convex polytope of the kind I meant.2012-06-08
  • 0
    Thanks - I was imagining regular tetrahedral pyramids, but you keep things convex by making them much flatter. So now what I don't see is why the vertices can't all be on a sphere.2012-06-08
  • 0
    @GerryMyerson: That the extended octahedron I described above cannot be realized with all vertices on the sphere follows from an article by Steinitz [Über isoperimetrische Probleme bei konvexen Polyedern, J. reine angew. Math., 159 (1928), pp 133-143]. One also might be able to prove it directly by elementary geometry, but in the moment I don't see how. If you want more details just google "inscribable polytopes". Also Grünbaum's Convex Polytopes has a little bit on this topic.2012-06-08
  • 0
    I'll check out those references when I can, but for now, what's wrong with this: Put a point at the North Pole, and one at the South Pole, and four points on the equator, and join each Pole to each equatorial point, and draw the Equator. That's your octahedron, and it divides the globe into 8 regions. Put a point in each region, and join it to the three vertices of its region. It seems to me that gives you the extended octahedron, with all vertices on the sphere.2012-06-09
  • 0
    @GerryMyerson That wouldn't be convex anymore. One can imagine the new points placed with that construction would create an inscribed cube, whose edges are outside the original octahedron.2012-09-24
  • 0
    @Gerry: I stumbled over the same problem as you did and could not believe the claim. The point is that Gregor supposes straight edges in Euclidean space, but you suppose straight edges on the sphere (= great arcs).2013-01-25
  • 0
    @Hans, thanks. I think I was supposing straight edges in Euclidean space, I was just misjudging what they looked like.2013-01-25
  • 0
    I just came across An Uninscribable 4-Regular Polyhedron at http://www.ics.uci.edu/~eppstein/junkyard/uninscribable/2013-02-11

1 Answers 1

2

I asked this question on MathOverflow and Sergei Ivanov gave an answer in the affirmative. See here for his beautiful argument.