$S$-Hypersimplices, Pulling Triangulations, and Monotone paths

  title={\$S\$-Hypersimplices, Pulling Triangulations, and Monotone paths},
  author={Sebastian Manecke and Raman Sanyal and Jeonghoon So},
  journal={Electron. J. Comb.},
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… 

Figures from this paper

One-Dimensional Projections and Monotone Paths on Cross-Polytopes and Other Regular Polytopes
Projections of regular convex polytopes have been studied for a long time (see work by Coxeter, Petrie, Schläfli, others). One-dimensional linear projections may not appear interesting at first
Flag Polymatroids
. We generalize the flag matroids of Gelfand et al. to polymatroids by studying the geometry of Edmonds’ greedy algorithm. The greedy paths on polymatroid polytopes are precisely the monotone paths


Alcoved Polytopes, I
The aim of this paper is to study alcoved polytopes, which are poly topes arising from affine Coxeter arrangements, and to give a combinatorial formula for volumes of thesepolytopes.
Extension Complexity and Realization Spaces of Hypersimplices
This work investigates the projective realization spaces of hypersimplices and their (refined) rectangle covering numbers and determines the extension complexity of all hypers Implices as well as of certain classes of combinatorial hypersimplice.
Zonotopes whose cellular strings are all coherent
The Generalized Baues Problem
We survey the generalized Baues problem of Billera and Sturmfels. The problem is one of discrete geometry and topology, and asks about the topology of the set of subdivisions of a certain kind of a
On Regular Polytopes
Lipschitz polytopes of posets and permutation statistics
Homology representations arising from the half cube
Geometry of the Gass-Saaty parametric cost LP algorithm
It is shown here that even without any “lexicography,” cycling is impossible unless the two objective functions are related in a very special way to each other or to the constraints defining the feasible regionP.
Parity Polytopes and Binarization
Disjunctive Programming: Properties of the Convex Hull of Feasible Points
  • E. Balas
  • Mathematics
    Discret. Appl. Math.
  • 1998