Realizability of polytopes as a low rank matrix completion problem

DOI10.1007/S00454-014-9599-0MaRDI QIDQ741602zbMATH OpenOpenAlexFDO

Authors Michael Gene Dobbins

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

zbMATH Keywords

matrix completionpolytoperealizabilitySteinitz's theorem

Mathematics Subject Classification ID

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

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.

Review text

In this article, the author studies the following question: which relations are incidence relations between facets and vertices of some polytopes? The author gives necessary and sufficient conditions for that. In addition, similar conditions are studied for the case of geometric spaces (spherical and hyperbolic).

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

Cites work

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

Cited in

(5)

• General non-realizability certificates for spheres with linear programming
• Projectively unique polytopes and toric slack ideals
• Combining realization space models of polytopes
• Necessary Conditions for Geometric Realizability of Simplicial Complexes
• The slack realization space of a polytope

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)