THE CUBICAL D-POLYTOPES WITH FEWER THAN 2(D+1) VERTICES

Authors
Citation
G. Blind et R. Blind, THE CUBICAL D-POLYTOPES WITH FEWER THAN 2(D+1) VERTICES, Discrete & computational geometry, 13(3-4), 1995, pp. 321-345
Citations number
10
Categorie Soggetti
Computer Sciences, Special Topics","Mathematics, General","Computer Science Theory & Methods",Mathematics
ISSN journal
01795376
Volume
13
Issue
3-4
Year of publication
1995
Pages
321 - 345
Database
ISI
SICI code
0179-5376(1995)13:3-4<321:TCDWFT>2.0.ZU;2-5
Abstract
A cubical polytope is a convex polytope of which every facet is a comb inatorial cube. We give here a complete enumeration of all the cubical d-polytopes with fewer than 2(d+1) vertices, for d greater than or eq ual to 4.