Hypersimplex


In polyhedral combinatorics, a hypersimplex, Δd,k, is a convex polytope that generalizes the simplex. It is determined by two parameters d and k, and is defined as the convex hull of the d-dimensional vectors whose coefficients consist of k ones and d − k zeros. It forms a (d − 1)-dimensional polytope, because all of these vectors lie in a single (d − 1)-dimensional hyperplane.