Math 2.0

Convex and discrete geometry Definition

Neighborly polytope

Builds on Convex polytopeVertex of a polytopeFace of a convex set

Definition

Let PP be a convex polytope of dimension dd, and let k≥1k \ge 1 be an integer. PP is kk-neighborly if for every set SS of kk vertices of PP, the convex hull of SS is a face of PP. PP is neighborly if it is ⌊d/2⌋\floor{d/2}-neighborly.

Remarks

Every polytope is 11-neighborly, so in dimensions 22 and 33 every polytope is neighborly. A 22-neighborly polytope is one whose graph is complete: every two vertices are joined by an edge. If PP is kk-neighborly for some k>⌊d/2⌋k > \floor{d/2}, then PP is a simplex.

Example: the cyclic polytope C(n,4)C(n, 4) for n≥5n \ge 5 is 22-neighborly. For i<ji < j, write p(t)=(t−ti)2(t−tj)2=a0+a1t+⋯+a4t4p(t) = (t - t_i)^2 (t - t_j)^2 = a_0 + a_1 t + \dots + a_4 t^4. The affine function ℓ(y)=a0+a1y1+⋯+a4y4\ell(y) = a_0 + a_1 y_1 + \dots + a_4 y_4 satisfies ℓ(x(t))=p(t)≥0\ell(x(t)) = p(t) \ge 0. It vanishes only at the vertices with parameters tit_i and tjt_j, so these two vertices span an edge.

Non-example: the 44-cube [0,1]4[0,1]^4 is not neighborly, since the opposite vertices 00 and (1,1,1,1)(1,1,1,1) 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
Each page uses the pages above it. The colour of the bar on a box shows how strong the evidence is, and the box also gives it as text. The list has the same pages.
  • no evidence level
  1. Convex polytope concept
  2. Face of a convex set concept
  3. Vertex of a polytope concept
  4. Neighborly polytope definition

Further reading

  1. Web https://en.wikipedia.org/wiki/Neighborly_polytope
About this page
TagTN1X6FNT87
URIm2://TN1X6FNT87
Kinddefinition
WritingW0 stub
MSC52B05, 52B11, 52B12
DefinesNeighborly polytope
UsesConvex 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.