 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.