S-hypersimplices, pulling triangulations, and monotone paths
From MaRDI portal
(Redirected from Publication:783072)
Combinatorial properties of polytopes and polyhedra (number of faces, shortest paths, etc.) (52B05) Special polytopes (linear programming, centrally symmetric, etc.) (52B12) Lattice polytopes in convex geometry (including relations with commutative algebra and algebraic geometry) (52B20) Polyhedra and polytopes; regular figures, division of spaces (51M20)
Abstract: An -hypersimplex for is the convex hull of all -vectors of length with coordinate sum in . These polytopes generalize the classical hypersimplices as well as cubes, crosspolytopes, and halfcubes. In this paper we study faces and dissections of -hypersimplices. Moreover, we show that monotone path polytopes of -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.
Recommendations
Cites work
- scientific article; zbMATH DE number 3559582 (Why is no real title available?)
- scientific article; zbMATH DE number 848091 (Why is no real title available?)
- scientific article; zbMATH DE number 1405498 (Why is no real title available?)
- scientific article; zbMATH DE number 6437647 (Why is no real title available?)
- scientific article; zbMATH DE number 2196280 (Why is no real title available?)
- scientific article; zbMATH DE number 3048077 (Why is no real title available?)
- Alcoved polytopes. I.
- Cellular Strings on Polytopes
- Compressed polytopes and statistical disclosure limitation
- Disjunctive programming: Properties of the convex hull of feasible points
- Extension complexity and realization spaces of hypersimplices
- Fiber polytopes
- Geometry of the Gass-Saaty parametric cost LP algorithm
- Homology representations arising from the half cube
- Homology representations arising from the half cube. II
- Lipschitz polytopes of posets and permutation statistics
- ORBITOPES
- Parity polytopes and binarization
- The simplex method. A probabilistic analysis
- Triangulations. Structures for algorithms and applications
Cited in
(6)
This page was built for publication: \(S\)-hypersimplices, pulling triangulations, and monotone paths
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q783072)