Realizability of polytopes as a low rank matrix completion problem (Q741602)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Realizability of polytopes as a low rank matrix completion problem |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| 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
0.7487354874610901
0 references
0.7327221035957336
0 references
0.7323405742645264
0 references
0.7298004031181335
0 references
