Separable partitions
From MaRDI portal
Publication:1283783
DOI10.1016/S0166-218X(98)00142-5zbMath0926.05011OpenAlexW2911447274MaRDI QIDQ1283783
Publication date: 2 November 1999
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0166-218x(98)00142-5
VC-dimensionextremal problemshyperplane arrangementspoint configurationsmoment curveseparable partitionsDavenport-Schinzel sequences
Matroids in convex geometry (realizations in the context of convex polytopes, convexity in combinatorial structures, etc.) (52B40) Arrangements of points, flats, hyperplanes (aspects of discrete geometry) (52C35) Combinatorial aspects of matroids and geometric lattices (05B35)
Related Items
Counting disjoint 2-partitions for points in the plane ⋮ The mean-partition problem ⋮ The Hilbert zonotope and a polynomial time algorithm for universal Gröbner bases. ⋮ On finding global optima for the hinge fitting problem. ⋮ On the number of separable partitions ⋮ Sphere-separable partitions of multi-parameter elements ⋮ Are there more almost separable partitions than separable partitions? ⋮ Cutting corners ⋮ Computing a Nonnegative Matrix Factorization---Provably ⋮ Linear-shaped partition problems ⋮ Vertex characterization of partition polytopes of bipartitions and of planar point sets
Cites Work
- Covering convex sets with non-overlapping polygons
- A quantitative Steinitz' theorem
- On the density of families of sets
- Geometric clusterings
- Lectures on Polytopes
- A Polynomial Time Algorithm for Shaped Partition Problems
- A Combinatorial Problem Connected with Differential Equations
- The number of partitions of a set of N points in k dimensions induced by hyperplanes
- Some properties of Davenport-Schinzel sequences
- On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities
- A Sequence of Polyhedra Having Intersections of Specified Dimensions
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
