The complexity of cells in three-dimensional arrangements (Q1078804): Difference between revisions

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.