Papers
Topics
Authors
Recent
Search
2000 character limit reached

Centrally symmetric polytopes with many faces

Published 2 Jun 2011 in math.MG and math.CO | (1106.0449v3)

Abstract: We present explicit constructions of centrally symmetric polytopes with many faces: first, we construct a d-dimensional centrally symmetric polytope P with about (1.316)d vertices such that every pair of non-antipodal vertices of P spans an edge of P, second, for an integer k>1, we construct a d-dimensional centrally symmetric polytope P of an arbitrarily high dimension d and with an arbitrarily large number N of vertices such that for some 0 < delta_k < 1 at least (1-delta_kd) {N choose k} k-subsets of the set of vertices span faces of P, and third, for an integer k>1 and a>0, we construct a centrally symmetric polytope Q with an arbitrary large number N of vertices and of dimension d=k{1+o(1)} such that least (1 - k{-a}){N choose k} k-subsets of the set of vertices span faces of Q.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.