The complexity of the envelope of line and plane arrangements

Details The complexity of the envelope of line and plane arrangements The complexity of the envelope of line and plane arrangements

2007-09-21

arxiv.org/abs/0709.3425v2

Mathematics

Metric Geometry

7 pages, 5 figures

Scientific paper

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$.

Affiliated with

Also associated with

No associations

Rating

The complexity of the envelope of line and plane arrangements does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with The complexity of the envelope of line and plane arrangements, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The complexity of the envelope of line and plane arrangements will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-256786