论文信息 - Upper bounds for configurations and polytopes inRd

Upper bounds for configurations and polytopes inRd

We give a new upper bound onnd(d+1)n on the number of realizable order types of simple configurations ofn points inRd, and ofn2d2n on the number of realizable combinatorial types of simple configurations. It follows as a corollary of the first result that there are no more thannd(d+1)n combinatorially distinct labeled simplicial polytopes inRd withn vertices, which improves the best previous upper bound ofncnd/2.

Richard Pollack | Jacob E. Goodman | R. Pollack | J. Goodman

[1] V. Klee. On the Number of Vertices of a Convex Polytope , 1964, Canadian Journal of Mathematics.

[2] J. Milnor. On the Betti numbers of real varieties , 1964 .

[3] T. Zaslavsky. Facing Up to Arrangements: Face-Count Formulas for Partitions of Space by Hyperplanes , 1975 .

[4] Michel Las Vergnas,et al. Orientability of matroids , 1978, J. Comb. Theory, Ser. B.

[5] Richard Pollack,et al. On the Combinatorial Classification of Nondegenerate Configurations in the Plane , 1980, J. Comb. Theory, Ser. A.

[6] Ido Shemer. Neighborly polytopes , 1982 .

[7] J. Michael Steele,et al. Lower Bounds for Algebraic Decision Trees , 1982, J. Algorithms.

[8] RICHARD P. STANLEY,et al. On the Number of Reduced Decompositions of Elements of Coxeter Groups , 1984, Eur. J. Comb..

[9] Richard Pollack,et al. Semispaces of Configurations, Cell Complexes of Arrangements , 1984, J. Comb. Theory, Ser. A.

[10] Paul H. Edelman,et al. Combinatorial Correspondences for Young Tableaux, Balanced Tableaux and Maxima l Chains in the Weak Bruhat Order of Sn , 1985 .