This page is an entry in an

Encyclopedia of Combinatorial Polytope Sequences


Back to big table.

Simplex

(4, 0, 0, 0)
  • Simplices Δ [wiki]

    • • Order polytope O(P) for P the linear order on {1,...,n}. [citeseer](R.Stanley)
    • Chain polytope C(P) for P the linear order on {1,...,n}. [citeseer](R.Stanley)
    • Poset associahedra for antichain [arxiv]
    • Vertex cover polytope of the complete graph VC(K_n) [wiki]
    • edgeless-graph-associahedra [arxiv] (S. Devadoss)
    • (n+1)-cycle-graph graphic matroid polytopes [wiki]
    • Uniform matroid U^n_(n+1) polytope [wiki]     		• Dimensions:
    0, 1, 2, 3, ... n
    • Number of Vertices in nth polytope:
    1, 2, 3, 4, 5, ... n+1 [ OEIS A000027 ]
    • Numbers of facets in dimension n (starting at n=0):
    0, 2, 3, 4, 5, ... n+1 [ OEIS A000027 ]
    • f-vectors:
    1, 2, 1, 3, 3, 1, 4, 6, 4, 1, 5, 10, 10, 5, 1, ... [ OEIS A135278]
    top    index