All Questions

The number of $k$-simplex elements in an $n$-simplex is counted by the binomial coefficient $\binom{n+1}{k+1}$. For example, the $3$-simplex is the tetrahedron, which has the following elements: $4$ ...

The problem of recognizing whether a simplicial face lattice is polytopal is sometimes called the Steinitz problem. Sturmfels and Bokowski advanced a set of methods in the late 80s to test whether ...