The complexity of cells in three-dimensional arrangements (Q1078804): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 00:35, 31 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The complexity of cells in three-dimensional arrangements |
scientific article |
Statements
The complexity of cells in three-dimensional arrangements (English)
0 references
1986
0 references
A finite set H of planes in 3-space \(E^ 3\) dissects \(E^ 3\) into a cell complex called arrangement A(H). The number of two-dimensional facets bounding a cell c is denoted by deg (c). Then estimates and asymptotic bounds are given for the maximum of \(\sum_{c}\deg (c)\) ranging over families of cells of the arrangement with fixed cardinality.
0 references
three-dimensional arrangements
0 references
