A theorem on the average number of subfaces in arrangements and oriented matroids (Q685218)

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.