Math 2.0

Convex and discrete geometry Polytopes and polyhedra Concept

Hyperplane arrangement

Summary

A hyperplane arrangement is a finite set of hyperplanes in a vector space or affine space. Over the real numbers the hyperplanes cut the space into convex pieces called regions. One studies how many regions there are and how they fit together. The combinatorics of an arrangement is captured by its intersection poset, the partially ordered set of all nonempty intersections of its hyperplanes. Arrangements connect polytopes, matroids, root systems and the topology of complements of hypersurfaces.

Where this leads

1 page builds on this one.

Further reading

  1. Web https://en.wikipedia.org/wiki/Arrangement_of_hyperplanes
About this page
TagN602W0WAVT
URIm2://N602W0WAVT
Kindconcept
WritingW0 stub
MSC52C35, 05B35, 32S22
Same as

Markdown · JSON · Edit on GitHub

What this page needs for W1

  • 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

Results about this

Used by