The complexity of the envelope of line and plane arrangements

arXiv0709.3425MaRDI QIDQ6206875FDOQ6206875

Authors: David Bremner, Antoine Deza, Feng Xie 

Publication date: 21 September 2007

Abstract: A facet of an hyperplane arrangement is called external if it belongs to exactly one bounded cell. The set of all external facets forms the envelope of the arrangement. The number of external facets of a simple arrangement defined by $n$ hyperplanes in dimension $d$ is hypothesized to be at least $dn-2choosed-1$. In this note we show that, for simple arrangements of 4 lines or more, the minimum number of external facets is equal to $2(n-1)$, and for simple arrangements of 5 planes or more, the minimum number of external facets is between $fracn(n-2)+63$ and $(n-4)(2n-3)+5$.

Mathematics Subject Classification ID

Arrangements of points, flats, hyperplanes (aspects of discrete geometry) (52C35) Planar arrangements of lines and pseudolines (aspects of discrete geometry) (52C30)

This page was built for publication: The complexity of the envelope of line and plane arrangements

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6206875)