This page is an entry in an

Encyclopedia of Combinatorial Polytope Sequences



Back to big table.

Hypercube

(0, 6, 0, 0)

• Cubes C [wiki]
• Order polytope O(P) for P the poset with no relations on n elements (antichain with n elements). [citeseer](R.Stanley)
• Chain polytope C(P) for P the poset with no relations on n elements (antichain with n elements). [citeseer](R.Stanley)
• Lipschitz polytope L(P) for P an antichain.[Sanyal and Stump]
• Lipschitz polytope L(P) for P a chain.
• Stanley-Pitman polytopes [arxiv] (Postnikov, Reiner, Williams)
• Acyclotopes, or graphical zonotopes, for graphs that are forests. [ Zaslavsky],[Postnikov]
• Voronoi cells of cographical lattice for tree graphs (primary parallelohedra, primary parallelotopes) [F. Vallentin]
• Brillouin zone (Wigner-Seitz cell of reciprocal space) for Simple Cubic lattice in 3d [wiki]
• Poset associahedra for cross-stack posets [arxiv]
• Quotientopes P , whose upper ideal of shards contains only the basic shards. [Pilaud, Santos]

• Dimensions:
0, 1, 2, 3, ... n
• Number of Vertices in nth polytope:
1, 2, 4, 8, 16, ... 2^n [ OEIS A000079 ]
• Number of Facets (start at n=0):
0, 2, 4, 6, 8 ... 2*n [ OEIS A004277]
• f-vectors:
1, 2, 1, 4, 4, 1, 8, 12, 6, 1, 16, ... [ OEIS A038207]
top    index