THE LOWER BOUND THEOREM FOR d-POLYTOPES WITH 2d+1 VERTICES

被引：1
|
作者：
Pineda-Villavicencio, Guillermo [1 ,2 ]
Yost, David [2 ]
机构：
[1] Deakin Univ, Sch Informat Technol, Geelong, Vic, Australia
[2] Federat Univ, Ballarat, Vic, Australia
来源：
SIAM JOURNAL ON DISCRETE MATHEMATICS | 2022年 / 36卷 / 04期
关键词：
polytope; f-vector; dual polytope; lower bound; MINIMUM NUMBER; FACETS;
D O I：
10.1137/21M144832X
中图分类号：
O29 [应用数学];
学科分类号：
070104 ;
摘要：
The problem of calculating exact lower bounds for the number of k-faces of dpolytopes with n vertices, for each value of k, and characterizing the minimizers has recently been solved for n not exceeding 2d. We establish the corresponding result for n = 2d+ 1; the nature of the lower bounds and the minimizing polytopes are quite different in this case. As a byproduct, we also characterize all d-polytopes with d + 3 vertices and only one or two edges more than the minimum.
引用
收藏
页码：2920 / 2941
页数：22
相关论文
共 29 条
123