The number of partitions of a set of N points in k dimensions induced by hyperplanes

DOI10.1017/S0013091500011925zbMath0153.32802OpenAlexW2101837070MaRDI QIDQ5534247

E. F. Harding

Publication date: 1967

Published in: Proceedings of the Edinburgh Mathematical Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/s0013091500011925

zbMATH Keywords

hyperplanespartition of sets

Mathematics Subject Classification ID

Partitions of sets (05A18)

Related Items (19)

Random polytopes in the d-dimensional cube ⋮ Counting disjoint 2-partitions for points in the plane ⋮ Bracket words: A generalisation of Sturmian words arising from generalised polynomials ⋮ Typed topology and its application to data sets ⋮ Some special Vapnik-Chervonenkis classes ⋮ A synopsis of combinatorial integral geometry ⋮ Random polytopes and the wet part for arbitrary probability distributions ⋮ On finding global optima for the hinge fitting problem. ⋮ On the number of separable partitions ⋮ The use of edge-directions and linear programming to enumerate vertices ⋮ Algorithms for Radon partitions with tolerance ⋮ Are there more almost separable partitions than separable partitions? ⋮ Combinatorial integral geometry, metrics, and zonoids ⋮ Computing a Nonnegative Matrix Factorization---Provably ⋮ Traces of hypergraphs ⋮ Shatter Functions with Polynomial Growth Rates ⋮ Separable partitions ⋮ Vertex characterization of partition polytopes of bipartitions and of planar point sets ⋮ A generalization of a formula of Steiner

Cites Work

• Partitions ofN-Space by Hyperplanes
• A Problem of Regions
• Partition of Space
• The Polygonal Regions into which a Plane is Divided by n Straight Lines
• Distribution of Points in n-Space

This page was built for publication: The number of partitions of a set of N points in k dimensions induced by hyperplanes