Realizability of polytopes as a low rank matrix completion problem

DOI10.1007/S00454-014-9599-0zbMATH Open1310.52015arXiv1012.3905OpenAlexW3099380148MaRDI QIDQ741602FDOQ741602

Authors: Michael Gene Dobbins 

Publication date: 12 September 2014

Published in: Discrete \& Computational Geometry (Search for Journal in Brave)

Abstract: This article gives necessary and sufficient conditions for a relation to be the containment relation between the facets and vertices of a polytope. Also given here, are a set of matrices parameterizing the linear moduli space and another set parameterizing the projective moduli space of a combinatorial polytope.

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

Recommendations

• Realization spaces of 4-polytopes are universal
• scientific article; zbMATH DE number 4067739
• Realizations of regular polytopes
• The slack realization space of a polytope
• Combining realization space models of polytopes

zbMATH Keywords

matrix completionpolytoperealizabilitySteinitz's theorem

Mathematics Subject Classification ID

Lattice polytopes in convex geometry (including relations with commutative algebra and algebraic geometry) (52B20)

Cites Work

• Computational synthetic geometry
• Realization spaces of polytopes
• Title not available (Why is that?)
• Lectures on Polytopes
• Oriented Matroids
• Expressing combinatorial optimization problems by linear programs
• Title not available (Why is that?)
• Abstract Regular Polytopes
• Title not available (Why is that?)
• Extended formulations for polygons
• Convex Polytopes
• Extended formulations in combinatorial optimization
• THE PROBLEM OF DISCRIMINATING ALGORITHMICALLY THE STANDARD THREE-DIMENSIONAL SPHERE
• 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
• Bier spheres and posets
• A characterization of Gram matrices of polytopes
• Computing the face lattice of a polytope from its vertex-facet incidences
• Characterizing flag graphs and incuced subgraphs of Cartesian product graphs
• Title not available (Why is that?)

Cited In (4)

• Projectively unique polytopes and toric slack ideals
• Necessary Conditions for Geometric Realizability of Simplicial Complexes
• The Slack Realization Space of a Polytope
• Combining realization space models of polytopes

This page was built for publication: Realizability of polytopes as a low rank matrix completion problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q741602)