论文信息 - The cubicald-polytopes with fewer than 2d+1 vertices - 字舞流文

The cubicald-polytopes with fewer than 2d+1 vertices

A cubical polytope is a convex polytope of which every facet is a combinatorial cube. We give here a complete enumeration of all the cubicald-polytopes with fewer than 2d+1 vertices, ford≥4.

Gerd Blind | Roswitha Blind | R. Blind | G. Blind

[1] R. Blind,et al. Convex polytopes without triangular faces , 1990 .

[2] R. Stanley. The number of faces of a simplicial convex polytope , 1980 .

[3] G. C. Shephard,et al. Convex Polytopes and the Upper Bound Conjecture , 1971 .

[4] Gerd Blind,et al. Gaps in the numbers of vertices of cubical polytopes, I , 1994, Discret. Comput. Geom..

[5] William Jockusch. The lower and upper bound problems for cubical polytopes , 1993, Discret. Comput. Geom..

[6] Carl W. Lee,et al. A Proof of the Sufficiency of McMullen's Conditions for f-Vectors of Simplicial Convex Polytopes , 1981, J. Comb. Theory A.