The number of partitions of a set of N points in k dimensions induced by hyperplanes
From MaRDI portal
Publication:5534247
DOI10.1017/S0013091500011925zbMath0153.32802MaRDI QIDQ5534247
Publication date: 1967
Published in: Proceedings of the Edinburgh Mathematical Society (Search for Journal in Brave)
05A18: Partitions of sets
Related Items
Combinatorial integral geometry, metrics, and zonoids, Random polytopes in the d-dimensional cube, Some special Vapnik-Chervonenkis classes, A synopsis of combinatorial integral geometry, Separable partitions, On finding global optima for the hinge fitting problem., Vertex characterization of partition polytopes of bipartitions and of planar point sets, Counting disjoint 2-partitions for points in the plane, The use of edge-directions and linear programming to enumerate vertices, A generalization of a formula of Steiner
Cites Work