A Lower Bound Technique for Triangulations of Simplotopes
From MaRDI portal
Publication:4601211
DOI10.1137/140972020zbMath1381.52022arXiv0910.1134OpenAlexW2962890073MaRDI QIDQ4601211
Francis Edward Su, Tyler Seacrest
Publication date: 12 January 2018
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0910.1134
Combinatorial properties of polytopes and polyhedra (number of faces, shortest paths, etc.) (52B05) (n)-dimensional polytopes (52B11) Special polytopes (linear programming, centrally symmetric, etc.) (52B12)
Related Items (2)
Tractable Relaxations of Composite Functions ⋮ The discrete yet ubiquitous theorems of Carathéodory, Helly, Sperner, Tucker, and Tverberg
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Dyck path triangulations and extendability
- A simple and relatively efficient triangulation of the n-cube
- Triangulations. Structures for algorithms and applications
- Graphs of transportation polytopes
- A triangulation of the n-cube
- Minimal triangulation of the 4-cube
- The computation of fixed points and applications
- The geometry of products of minors
- Asymptotically efficient triangulations of the \(d\)-cube
- Simplexity of the cube
- A lower bound for the simplexity of the \(n\)-cube via hyperbolic volumes
- Flag arrangements and triangulations of products of simplices
- Lower bounds for simplicial covers and triangulations of cubes
- Rental Harmony: Sperner's Lemma in Fair Division
- Combinatorial Theorems on the Simplotope that Generalize Results on the Simplex and Cube
- On the Computation of Fixed Points in the Product Space of Unit Simplices and an Application to Noncooperative N Person Games
- A Simplicial Algorithm for Computing Robust Stationary Points of a Continuous Function on the Unit Simplex
- A point set whose space of triangulations is disconnected
This page was built for publication: A Lower Bound Technique for Triangulations of Simplotopes
