当前位置:
X-MOL 学术
›
Discret. Comput. Geom.
›
论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
Complexity Yardsticks for f-Vectors of Polytopes and Spheres
Discrete & Computational Geometry ( IF 0.8 ) Pub Date : 2019-10-10 , DOI: 10.1007/s00454-019-00138-2 Eran Nevo
Discrete & Computational Geometry ( IF 0.8 ) Pub Date : 2019-10-10 , DOI: 10.1007/s00454-019-00138-2 Eran Nevo
We consider geometric and computational measures of complexity for sets of integer vectors, asking for a qualitative difference between $f$-vectors of simplicial and general $d$-polytopes, as well as flag $f$-vectors of $d$-polytopes and regular CW $(d-1)$-spheres, for $d\ge 4$.
中文翻译:
多面体和球体 f 向量的复杂度标准
我们考虑整数向量集的复杂性的几何和计算度量,要求 $f$-vectors of simplicial 和一般 $d$-polytopes 以及标志 $f$-vectors of $d$-polytopes 之间存在质的差异和常规 CW $(d-1)$-spheres,$d\ge 4$。
更新日期:2019-10-10
中文翻译:
多面体和球体 f 向量的复杂度标准
我们考虑整数向量集的复杂性的几何和计算度量,要求 $f$-vectors of simplicial 和一般 $d$-polytopes 以及标志 $f$-vectors of $d$-polytopes 之间存在质的差异和常规 CW $(d-1)$-spheres,$d\ge 4$。