arXiv Analytics

Sign in

arXiv:1101.0410 [math.CO]AbstractReferencesReviewsResources

Equivalence Classes of Full-Dimensional 0/1-Polytopes with Many Vertices

William Y. C. Chen, Peter L. Guo

Published 2011-01-02Version 1

Let $Q_n$ denote the $n$-dimensional hypercube with the vertex set $V_n=\{0,1}^n$. A 0/1-polytope of $Q_n$ is a convex hull of a subset of $V_n$. This paper is concerned with the enumeration of equivalence classes of full-dimensional 0/1-polytopes under the symmetries of the hypercube. With the aid of a computer program, Aichholzer completed the enumeration of equivalence classes of full-dimensional 0/1-polytopes for $Q_4$, $Q_5$, and those of $Q_6$ up to 12 vertices. In this paper, we present a method to compute the number of equivalence classes of full-dimensional 0/1-polytopes of $Q_n$ with more than $2^{n-3}$ vertices. As an application, we finish the counting of equivalence classes of full-dimensional 0/1-polytopes of $Q_6$ with more than 12 vertices.

Comments: 34 pages, 1 figure
Categories: math.CO, math.MG
Subjects: 05A15, 52A20, 52B12, 05C25
Related articles: Most relevant | Search more
arXiv:1106.5480 [math.CO] (Published 2011-06-27, updated 2013-03-21)
Enumeration of Graded (3+1)-Avoiding Posets
arXiv:math/9804119 [math.CO] (Published 1998-04-24, updated 1999-01-28)
Enumeration of m-ary cacti
arXiv:math/9904150 [math.CO] (Published 1999-04-27, updated 1999-04-28)
Enumeration of Matchings: Problems and Progress