![cover image](https://wikiwandv2-19431.kxcdn.com/_next/image?url=https://upload.wikimedia.org/wikipedia/commons/thumb/3/38/2D-simplex.svg/640px-2D-simplex.svg.png&w=640&q=50)
Hypersimplex
From Wikipedia, the free encyclopedia
In polyhedral combinatorics, the hypersimplex is a convex polytope that generalizes the simplex. It is determined by two integers
and
, and is defined as the convex hull of the
-dimensional vectors whose coefficients consist of
ones and
zeros. Equivalently,
can be obtained by slicing the
-dimensional unit hypercube
with the hyperplane of equation
and, for this reason, it is a
-dimensional polytope when
.[1]