From Wikipedia, the free encyclopedia
In geometry, when two sets of points in a two-dimensional graph can be completely separated by a single line, they are said to be linearly separable. In general, two groups are linearly separable in n-dimensional space if they can be separated by an n − 1 dimensional hyperplane.
Number of linearly separable Boolean hypercubes in each dimension[1] (sequence A000609 in OEIS)
| Dimension |
Linearly Separable Boolean Hypercubes |
| 2 |
14 |
| 3 |
104 |
| 4 |
1882 |
| 5 |
94572 |
| 6 |
15028134 |
| 7 |
8378070864 |
| 8 |
17561539552946 |
| 9 |
144130531453121108 |
- ^ Gruzling, Nicolle (2006). "Linear separability of the vertices of an n-dimensional hypercube. M.Sc Thesis". . University of Northern British Columbia
