The complexity of the envelope of line and plane arrangements
| dc.creator | Bremner, David | |
| dc.creator | Deza, Antoine | |
| dc.creator | Xie, Feng | |
| dc.date | 2007-09-21 | |
| dc.date | 2007-09-22 | |
| dc.date.accessioned | 2026-07-07T08:31:30Z | |
| dc.date.available | 2026-07-07T08:31:30Z | |
| dc.description | 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 $d{n-2 \choose d-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 $\frac{n(n-2)+6}{3}$ and $(n-4)(2n-3)+5$. | |
| dc.description | 7 pages, 5 figures | |
| dc.identifier | https://arxiv.org/abs/0709.3425 | |
| dc.identifier | http://arxiv.org/abs/0709.3425 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/138517 | |
| dc.subject | Metric Geometry | |
| dc.subject | 52C35 (Primary); 52C30 (Secondary) | |
| dc.title | The complexity of the envelope of line and plane arrangements | |
| dc.type | text |