Realizability of polytopes as a low rank matrix completion problem (Q741602): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Oriented Matroids / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bier spheres and posets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational synthetic geometry / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extended formulations in combinatorial optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4692885 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A characterization of Gram matrices of polytopes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extended formulations for polygons / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex Polytopes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing the face lattice of a polytope from its vertex-facet incidences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Abstract Regular Polytopes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3116051 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterizing flag graphs and incuced subgraphs of Cartesian product graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: 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 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Realization spaces of polytopes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3339668 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3225387 / rank
 
Normal rank
Property / cites work
 
Property / cites work: THE PROBLEM OF DISCRIMINATING ALGORITHMICALLY THE STANDARD THREE-DIMENSIONAL SPHERE / rank
 
Normal rank
Property / cites work
 
Property / cites work: Expressing combinatorial optimization problems by linear programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lectures on Polytopes / rank
 
Normal rank

Latest revision as of 00:42, 9 July 2024

scientific article
Language Label Description Also known as
English
Realizability of polytopes as a low rank matrix completion problem
scientific article

    Statements

    Realizability of polytopes as a low rank matrix completion problem (English)
    0 references
    12 September 2014
    0 references
    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).
    0 references
    polytope
    0 references
    realizability
    0 references
    Steinitz's theorem
    0 references
    matrix completion
    0 references

    Identifiers