Realizability of polytopes as a low rank matrix completion problem
From MaRDI portal
Publication:741602
DOI10.1007/s00454-014-9599-0zbMath1310.52015arXiv1012.3905OpenAlexW3099380148MaRDI QIDQ741602
Publication date: 12 September 2014
Published in: Discrete \& Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1012.3905
Related Items
Combining realization space models of polytopes ⋮ The Slack Realization Space of a Polytope ⋮ Projectively unique polytopes and toric slack ideals
Cites Work
- Extended formulations for polygons
- On the computational complexity and geometry of the first-order theory of the reals. I: Introduction. Preliminaries. The geometry of semi-algebraic sets. The decision problem for the existential theory of the reals
- Expressing combinatorial optimization problems by linear programs
- Computational synthetic geometry
- A characterization of Gram matrices of polytopes
- Computing the face lattice of a polytope from its vertex-facet incidences
- Bier spheres and posets
- Realization spaces of polytopes
- Characterizing flag graphs and incuced subgraphs of Cartesian product graphs
- THE PROBLEM OF DISCRIMINATING ALGORITHMICALLY THE STANDARD THREE-DIMENSIONAL SPHERE
- Lectures on Polytopes
- Convex Polytopes
- Abstract Regular Polytopes
- Oriented Matroids
- Extended formulations in combinatorial optimization
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
