Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. Join them; it only takes a minute:

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

From this answer, we know that $n$ planes will partition $\mathbb{R}^m$ into a maximum of $N_{m,n} = \sum_{k = 0}^{m} \binom{n}{k}$ regions. Now we ask the reverse: given any $N_{m,n}$ points in general position in $\mathbb{R}^m$ do there always exist $n$ hyperplanes that will separate these points?

E.g. with $N_{2,3} = 7$ points in $\mathbb{R}^2$, the hypothesis is that there always exist $n = 3$ lines that completely separate any $7$ points.

enter image description here

share|cite|improve this question
if 7 points are colinear then you need 6 lines to separate them... – Dan Rust Jun 3 '13 at 23:24
Whoops - thanks guys. Fixed question – mchen Jun 3 '13 at 23:31
up vote 2 down vote accepted

How about a regular heptagon? Each line has to separate the points into a group of three and a group of four. Two lines will give one isolated point and two pairs. But I can't find a third line to split all three pairs.

share|cite|improve this answer

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.