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


On Polytopes that are Simple at the Edges
Authors:V A Timorin
Institution:(1) V. A. Steklov Mathematical Institute, University of Toronto, Canada
Abstract:We study some combinatorial properties of polytopes that are simple at the edges. We give an elementary geometric proof of an analog of the hard Lefschetz theorem for the polytopes for which the distance between any two nonsimple vertices is sufficiently large. This implies that the h-vector of such polytopes satisfies the relations 
$$h_{\left {{d \mathord{\left/ {\vphantom {d 2}} \right. \kern-\nulldelimiterspace} 2}} \right]} \geqslant h_{\left {{d \mathord{\left/ {\vphantom {d 2}} \right. \kern-\nulldelimiterspace} 2}} \right] + 1} \geqslant \cdot \cdot \cdot \geqslant h_d = 1$$
, where d is the dimension of the polytope, which proves a special case of Stanley's conjecture.
Keywords:
本文献已被 SpringerLink 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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