科研之友
微信
新浪微博
Facebook
分享链接
摘要
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.
- 出版日期2010-12
