Publication details
EQUIPARTITE POLYTOPES
| Authors | |
|---|---|
| Year of publication | 2010 |
| Type | Article in Periodical |
| Magazine / Source | Israel Journal of Mathematics |
| Citation | |
| Doi | http://dx.doi.org/10.1007/s11856-010-0080-3 |
| Description | A polytope P with 2n vertices is called equipartite if for any partition of its vertex set into two equal- size sets V(1) and V(2), there is an isometry of the polytope P that maps V(1) onto V(2). We prove that an equipartite polytope in R(d) can have at most 2d+2 vertices. We show that this bound is sharp and identify all known equipartite polytopes in R(d). We conjecture that the list is complete. |