论文信息 - Polytopes with few vertices and few facets - 字舞流文

Polytopes with few vertices and few facets

In this note we prove that the number of combinatorial types of $d$-polytopes with $d+1+\alpha$ vertices and $d+1+\beta$ facets is bounded by a constant independent of $d$.

[1] Daniel A. Marcus. Minimal positive 2-spanning sets of vectors , 1981 .

[2] Ronald F. Wotzlaw,et al. A Lost Counterexample and a Problem on Illuminated Polytopes , 2009, Am. Math. Mon..

[3] Daniel A. Marcus. Gale diagrams of convex polytopes and positive spanning sets of vectors , 1984, Discret. Appl. Math..

[4] Arnau Padrol,et al. Many Neighborly Polytopes and Oriented Matroids , 2012, Discret. Comput. Geom..

[5] P. Mani. Inner illumination of convex polytopes , 1974 .

[6] G. C. Shephard,et al. Convex Polytopes , 1969, The Mathematical Gazette.

[7] Ronald F. Wotzlaw. Incidence Graphs and Unneighborly Polytopes , 2009 .

[8] Gil Kalai,et al. Some Aspects of the Combinatorial Theory of Convex Polytopes , 1994 .

[9] Éric Fusy. Counting d-Polytopes with d+3 Vertices , 2006, Electron. J. Comb..

[10] G. Ziegler,et al. Basic properties of convex polytopes , 1997 .

[11] Ido Shemer. Neighborly polytopes , 1982 .