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

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
Import240304020342 (talk | contribs)
Set profile property.
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank

Revision as of 02:07, 5 March 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
    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

    Identifiers