Realizability of Polytopes as a Low Rank Matrix Completion Problem
Combinatorics
2014-12-02 v3
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.
Keywords
Cite
@article{arxiv.1012.3905,
title = {Realizability of Polytopes as a Low Rank Matrix Completion Problem},
author = {Michael Gene Dobbins},
journal= {arXiv preprint arXiv:1012.3905},
year = {2014}
}