A theorem on the average number of subfaces in arrangements and oriented matroids
From MaRDI portal
(Redirected from Publication:685218)
It is known that for simple arrangements in the \(d\)-dimensional Euclidean space \(R^ d\), the average number of \(j\)-dimensional subfaces of a \(k\)- dimensional face is less than \(2^{k-j}{k\choose j}\). In this paper, we show that this is also true for all arrangements in \(R^ d\) and for all oriented matroids, and we give combinatorial proofs.
Recommendations
Cites work
- Bounding the number of k-faces in arrangements of hyperplanes
- Combinatorial face enumeration in arrangements and oriented matroids
- Constructing Arrangements of Lines and Hyperplanes with Applications
- Convexity in oriented matroids
- scientific article; zbMATH DE number 4032498 (Why is no real title available?)
- Lawrence Polytopes
- Linear programming duality: an introduction to oriented matroids
- On the Zone Theorem for Hyperplane Arrangements
- Orientability of 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)