The slimmest arrangements of hyperplanes: II. Basepointed geometric lattices and Euclidean arrangements
From MaRDI portal
Publication:3941970
DOI10.1112/S0025579300010226zbMath0483.51012MaRDI QIDQ3941970
Publication date: 1981
Published in: Mathematika (Search for Journal in Brave)
Polyhedra and polytopes; regular figures, division of spaces (51M20) Combinatorial aspects of matroids and geometric lattices (05B35)
Related Items (2)
Cites Work
- Arrangements of planes in space
- A lower bound on the number of cells in arrangements of hyperplanes
- Connected matroids with the smallest Whitney numbers
- Projectivities in realtively complemented lattices
- Whitney Number Inequalities for Geometric Lattices
- The Slimmest Geometric Lattices
- A higher invariant for matroids
- [https://portal.mardi4nfdi.de/wiki/Publication:5731810 On the foundations of combinatorial theory I. Theory of M�bius Functions]
This page was built for publication: The slimmest arrangements of hyperplanes: II. Basepointed geometric lattices and Euclidean arrangements