The complexity of cells in three-dimensional arrangements (Q1078804)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 3960412
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The complexity of cells in three-dimensional arrangements |
scientific article; zbMATH DE number 3960412 |
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
0.8447855710983276
0 references
0.8316552042961121
0 references
0.8301331996917725
0 references
0.8297023773193359
0 references
