In polyhedral combinatorics, the hypersimplex Δ d , k {\displaystyle \Delta _{d,k}} is a convex polytope that generalizes the simplex. It is determined by two integers d {\displaystyle d} and k {\displaystyle k} , and is defined as the convex hull of the d {\displaystyle d} -dimensional vectors whose coefficients consist of k {\displaystyle k} ones and d − k {\displaystyle d-k} zeros.
In polyhedral combinatorics, the hypersimplex Δ d , k {\displaystyle \Delta _{d,k}} is a convex polytope that generalizes the simplex. It is determined by two integers d {\displaystyle d} and k {\displaystyle k} , and is defined as the convex hull of the d {\displaystyle d} -dimensional vectors whose coefficients consist of k {\displaystyle k} ones and d − k {\displaystyle d-k} zeros.
Source: Wikipedia "Hypersimplex" · CC BY-SA 4.0
Share this article: X · Bluesky