A theorem on the average number of subfaces in arrangements and oriented matroids (Q685218): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 00:58, 5 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A theorem on the average number of subfaces in arrangements and oriented matroids |
scientific article |
Statements
A theorem on the average number of subfaces in arrangements and oriented matroids (English)
0 references
30 September 1993
0 references
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.
0 references
arrangements of hyperplanes
0 references
convex polytopes
0 references
oriented matroids
0 references
