The number of partitions of a set of N points in k dimensions induced by hyperplanes
From MaRDI portal
Publication:5534247
Recommendations
Cites work
Cited in
(21)- 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.
- Partitioning points by parallel planes
- Vertex characterization of partition polytopes of bipartitions and of planar point sets
- Are there more almost separable partitions than separable partitions?
- Random polytopes and the wet part for arbitrary probability distributions
- Counting disjoint 2-partitions for points in the plane
- The use of edge-directions and linear programming to enumerate vertices
- Computing a nonnegative matrix factorization -- provably
- A generalization of a formula of Steiner
- On the number of separable partitions
- Traces of hypergraphs
- Shatter functions with polynomial growth rates
- Combinatorial integral geometry, metrics, and zonoids
- Algorithms for Radon partitions with tolerance
- Bracket words: A generalisation of Sturmian words arising from generalised polynomials
- Typed topology and its application to data sets
- Merging two cultures: deep and statistical learning
This page was built for publication: The number of partitions of a set of N points in k dimensions induced by hyperplanes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5534247)