Skip to main content

All Questions

Filter by
Sorted by
Tagged with
4 votes
3 answers
347 views

Minimal data required to determine a convex polytope

Let $P\subset \Bbb R^d$ be a convex polytope. Suppose that I know its combinatorial type (aka. the face-lattice), the length $\ell_i$ of each edge, and the distance $r_i$ of each vertex from the ...
M. Winter's user avatar
  • 13.6k
19 votes
1 answer
928 views

Can every simple polytope be inscribed in a sphere?

It is known that not every convex polytope (even polyhedron, e.g. this one) can be made inscribed, that is, we cannot always move its vertices so that all vertices end up on a common sphere, and the ...
M. Winter's user avatar
  • 13.6k
8 votes
3 answers
390 views

Is there any edge- but not vertex-transitive polytope in $d\ge 4$ dimensions?

I consider convex polytopes $P\subset\Bbb R^d$. The polytope is called vertex- resp. edge-transitive, if any vertex resp. edge can be mapped to any other by a symmetry of the polytope. I am looking ...
M. Winter's user avatar
  • 13.6k
6 votes
1 answer
212 views

A polytope with congruent facets and an insphere that is not facet-transitive?

Is there a $d$-dimensional convex polytope (convex hull of finitely many points, not contained in a proper subspace), with $d\ge 4$ and the following properties? All facets are congruent, it has an ...
M. Winter's user avatar
  • 13.6k