The number of partitions of a set of N points in k dimensions induced by hyperplanes
- 1 December 1967
- journal article
- research article
- Published by Cambridge University Press (CUP) in Proceedings of the Edinburgh Mathematical Society
- Vol. 15 (4) , 285-289
- https://doi.org/10.1017/s0013091500011925
Abstract
1. An arbitrary (k– 1)-dimensional hyperplane disconnects K-dimensional Euclidean space Ek into two disjoint half-spaces. If a set of N points in general position in Ek is given [nok +1 in a (k–1)-plane, no k in a (k–2)-plane, and so on], then the set is partitione into two subsets by the hyperplane, a point belonging to one or the other subset according to which half-space it belongs to; for this purpose the half-spaces are considered as an unordered pair.Keywords
This publication has 10 references indexed in Scilit:
- Partitions ofN-Space by HyperplanesSIAM Journal on Applied Mathematics, 1966
- A Method for Cluster AnalysisBiometrics, 1965
- A Problem of RegionsThe American Mathematical Monthly, 1945
- A Problem of RegionsThe American Mathematical Monthly, 1945
- Partition of SpaceThe American Mathematical Monthly, 1943
- Partition of SpaceThe American Mathematical Monthly, 1943
- Distribution of Points in n-SpaceThe American Mathematical Monthly, 1943
- Distribution of Points in n-SpaceThe American Mathematical Monthly, 1943
- The Polygonal Regions into which a Plane is Divided by n Straight LinesThe American Mathematical Monthly, 1941
- The Polygonal Regions into which a Plane is Divided by n Straight LinesThe American Mathematical Monthly, 1941