首页 | 本学科首页   官方微博 | 高级检索  
     检索      


On a problem of klee concerning convex polytopes
Authors:P McMullen
Institution:(1) Michigan State University, East Lansing;(2) Western Washington State College, Bellingham, Wa.
Abstract:A non-simpliciald-polytope is shown to have strictly fewerk-faces ((d−1)/2]≦kd−1) then some simpliciald-polytope with the same number of vertices; actual numerical bounds are given. This provides a strong affirmative answer to a problem of Klee.
Keywords:
本文献已被 SpringerLink 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号