A theorem on the average number of subfaces in arrangements and oriented matroids
DOI10.1007/BF01266616zbMATH Open0780.52014MaRDI QIDQ685218FDOQ685218
Authors: Komei Fukuda, Akihisa Tamura, Takeshi Tokuyama
Publication date: 30 September 1993
Published in: Geometriae Dedicata (Search for Journal in Brave)
Recommendations
Matroids in convex geometry (realizations in the context of convex polytopes, convexity in combinatorial structures, etc.) (52B40) Combinatorial aspects of matroids and geometric lattices (05B35) Arrangements of points, flats, hyperplanes (aspects of discrete geometry) (52C35)
Cites Work
- Title not available (Why is that?)
- Constructing Arrangements of Lines and Hyperplanes with Applications
- On the Zone Theorem for Hyperplane Arrangements
- Convexity in oriented matroids
- Lawrence Polytopes
- Orientability of matroids
- Combinatorial face enumeration in arrangements and oriented matroids
- Bounding the number of \(k\)-faces in arrangements of hyperplanes
- Linear programming duality: an introduction to oriented matroids
- Tessellations generated by hyperplanes
Cited In (5)
This page was built for publication: A theorem on the average number of subfaces in arrangements and oriented matroids
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q685218)