Math 2.0

Convex and discrete geometry Polytopes and polyhedra Concept

Gale diagram

Summary

The Gale diagram, or Gale transform, turns nn points spanning ℝd\R^d into nn vectors in ℝn−d−1\R^{n-d-1}. The new vectors encode the affine dependences of the old points. The faces of the convex hull of the points can be read off from them. Suppose a convex polytope has only a few more vertices than its dimension. Then its Gale diagram lives in a very low dimension and can be drawn. This makes Gale diagrams a main tool for classifying such polytopes and for building polytopes with unexpected properties.

Further reading

  1. Web https://en.wikipedia.org/wiki/Gale_diagram
About this page
TagKFCXGKK288
URIm2://KFCXGKK288
Kindconcept
WritingW0 stub
MSC52B35, 52B11
Same as

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

Definitions