Convex and discrete geometry Definition
Neighborly polytope
Builds on Convex polytopeVertex of a polytopeFace of a convex set
Definition
Let be a convex polytope of dimension , and let be an integer. is -neighborly if for every set of vertices of , the convex hull of is a face of . is neighborly if it is -neighborly.
Remarks
Every polytope is -neighborly, so in dimensions and every polytope is neighborly. A -neighborly polytope is one whose graph is complete: every two vertices are joined by an edge. If is -neighborly for some , then is a simplex.
Example: the cyclic polytope for is -neighborly. For , write . The affine function satisfies . It vanishes only at the vertices with parameters and , so these two vertices span an edge.
Non-example: the -cube is not neighborly, since the opposite vertices and are not joined by an edge.
Reading path
To understand this page from the ground up, read these 4 pages in order. The foundations come first.
Show the path as a graph
- no evidence level
- Convex polytope concept
- Face of a convex set concept
- Vertex of a polytope concept
- Neighborly polytope definition
Further reading
About this page
| Tag | TN1X6FNT87 |
|---|---|
| URI | m2://TN1X6FNT87 |
| Kind | definition |
| Writing | W0 stub |
| MSC | 52B05, 52B11, 52B12 |
| Defines | Neighborly polytope |
| Uses | Convex polytope, Vertex of a polytope, Face of a convex set |
Markdown · JSON · Edit on GitHub
What this page needs for W1
- an inventory row: the row of the inventory that the node accounts for (0 of 1)
- a source with a locator (0 of 1)
The writing levels say how complete the text of a page is. They do not measure its truth.
What links here
No page links to this page yet.