$S$-Hypersimplices, Pulling Triangulations, and Monotone paths
The Electronic Journal of Combinatorics2020Vol. 27(3)
Citations Over Time
Abstract
An $S$-hypersimplex for $S \subseteq \{0,1, \dots,d\}$ is the convex hull of all $0/1$-vectors of length $d$ with coordinate sum in $S$. These polytopes generalize the classical hypersimplices as well as cubes, crosspolytopes, and halfcubes. In this paper we study faces and dissections of $S$-hypersimplices. Moreover, we show that monotone path polytopes of $S$-hypersimplices yield all types of multipermutahedra. In analogy to cubes, we also show that the number of simplices in a pulling triangulation of a halfcube is independent of the pulling order.
Related Papers
- → Incremental Convex Hull Algorithms Are Not Output Sensitive(1999)33 cited
- → A Continuous Analogue of the Upper Bound Theorem(2001)32 cited
- → $S$-Hypersimplices, Pulling Triangulations, and Monotone paths(2020)4 cited
- → Interior points of the convex hull of few points in $$\mathbb{E}^d $$(1991)1 cited
- Deletion-Induced Triangulations(2015)