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

Essentially, linearly separable points are just those corners that can be cut off with just one slice as marked out by a hyperplane.

E.g. for a cube, the following 4 points (red) are not linearly separable - no single cut by a plane (tilted at whatever angle) across the cube can slice off exactly these 4 points:

enter image description here

So this begs the question: given $n$ points on an $m$-dimensional hypercube, how can I tell if these $n$ points are linearly separable?

share|cite|improve this question
@AsalBeagDubh - thanks, sounds like that might be what I want, but what is $p_i - p_0$? – mchen Jun 5 '13 at 15:40
Sorry, I deleted my comment because I think I misread the question. $p_i-p_0$ just means the vector pointing from the point $p_0$ to the point $p_i$. – user64687 Jun 5 '13 at 17:03
related… – leonbloy Jun 9 '13 at 18:34
up vote 2 down vote accepted

This is a crucial problem in machine learning, much studied since the 60'sand there is no easy characterisation or criterion - nor even efficient algorithms. See eg this and this, , and references, or google for "Threshold Logic".

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.