S-hypersimplices, pulling triangulations, and monotone paths

DOI10.37236/8457zbMATH Open1444.51004arXiv1812.07491OpenAlexW3045508281MaRDI QIDQ783072FDOQ783072

Authors: Sebastian Manecke, Raman Sanyal, Jeonghoon So 

Publication date: 30 July 2020

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Abstract: An $S$-hypersimplex for $Ssubseteq0,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.

Full work available at URL: https://arxiv.org/abs/1812.07491

File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

Recommendations

• Extension complexity and realization spaces of hypersimplices
• \(r\)-stable hypersimplices
• Alcoved polytopes. I.
• Ehrhart \(h^{\ast }\)-vectors of hypersimplices
• The face vector of a half-open hypersimplex

zbMATH Keywords

dissectionsfaces\(S\)-hypersimplexmonotone path polytopes

Mathematics Subject Classification ID

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)

Cites Work

• Alcoved polytopes. I.
• Title not available (Why is that?)
• Title not available (Why is that?)
• Triangulations. Structures for algorithms and applications
• Title not available (Why is that?)
• Title not available (Why is that?)
• Disjunctive programming: Properties of the convex hull of feasible points
• Fiber polytopes
• The simplex method. A probabilistic analysis
• Compressed polytopes and statistical disclosure limitation
• Title not available (Why is that?)
• Cellular Strings on Polytopes
• Title not available (Why is that?)
• ORBITOPES
• Lipschitz polytopes of posets and permutation statistics
• Extension complexity and realization spaces of hypersimplices
• Geometry of the Gass-Saaty parametric cost LP algorithm
• Homology representations arising from the half cube. II
• Parity polytopes and binarization
• Homology representations arising from the half cube

Cited In (6)

• \(r\)-stable hypersimplices
• The face vector of a half-open hypersimplex
• Underlying flag polymatroids
• The Polyhedral Geometry of Pivot Rules and Monotone Paths
• An effective solution to convex 1-body \(N\)-representability
• Monotone paths on cross-polytopes

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)