scientific article; zbMATH DE number 3913138
[For the entire collection see Zbl 0564.00011.] An arrangement of hyperplanes is a finite set of hyperplanes in real projective or Euclidean space, regarded as dissecting the space into cells (or faces) of various dimensions. The flats of the arrangement are the subspaces formed by intersecting the hyperplanes. In this paper the author discusses how by abstract methods of matroid theory one can find the extremal arrangements - those with the most or the fewest flats and cells given the number of hyperplanes and the dimension. The abstract approach to arrangements of hyperplanes has the advantage that its results generalize to similar topological structures.
- Simplicial cells in arrangements and mutations of oriented matroids
- Factored arrangements of hyperplanes
- Bouquets of geometric lattices: Some algebraic and topological aspects
- Probing the arrangement of hyperplanes
- Chambers of arrangements of hyperplanes and Arrow's impossibility theorem
- scientific article; zbMATH DE number 6387618 (Why is no real title available?)
- On a generalization of Zaslavsky's theorem for hyperplane arrangements
- scientific article; zbMATH DE number 1223435 (Why is no real title available?)
- Potentials of a family of arrangements of hyperplanes and elementary subarrangements
- The slimmest arrangements of hyperplanes. I: Geometric lattices and projective arrangements
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3689778)