Simple 0/1-polytopes (Q1964656): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Anti-Hadamard matrices, coin weighing, threshold gates, and indecomposable hypergraphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Extremal properties of \(0/1\)-polytopes / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The Hirsch conjecture is true for (0,1)-polytopes / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3351113 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Lectures on Polytopes / rank | |||
Normal rank | |||
Latest revision as of 12:02, 29 May 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Simple 0/1-polytopes |
scientific article |
Statements
Simple 0/1-polytopes (English)
0 references
4 January 2001
0 references
A polytope is said to be a 0/1-polytope if it has only vertices with 0/1-coordinates. A \(d\)-dimensional polytope is said to be simple if every of its vertices lies in \(d\)-facets. The authors show that the set of all simple 0/1-polytopes is very small. More precisely, they prove that every simple 0/1-polytope is the cartesian product of some 0/1-simplices.
0 references
0/1-polytope
0 references
cartesian product of 0/1-simplices
0 references
star-partition
0 references
hypercube
0 references
