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

@article{Manecke2020SHypersimplicesPT, title={\$S\$-Hypersimplices, Pulling Triangulations, and Monotone paths}, author={Sebastian Manecke and Raman Sanyal and Jeonghoon So}, journal={Electron. J. Comb.}, year={2020}, volume={27}, pages={3} }

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

## 2 Citations

One-Dimensional Projections and Monotone Paths on Cross-Polytopes and Other Regular Polytopes

- Mathematics
- 2021

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

- Mathematics
- 2022

. We generalize the ﬂag 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…

## References

SHOWING 1-10 OF 25 REFERENCES

Alcoved Polytopes, I

- MathematicsDiscret. Comput. Geom.
- 2007

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

- MathematicsDiscret. Comput. Geom.
- 2018

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.

The Generalized Baues Problem

- Mathematics
- 1999

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…

Geometry of the Gass-Saaty parametric cost LP algorithm

- MathematicsDiscret. Comput. Geom.
- 1990

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.

Disjunctive Programming: Properties of the Convex Hull of Feasible Points

- MathematicsDiscret. Appl. Math.
- 1998