Lower bounds for the number of hyperplanes separating two finite sets of points

DOI10.1134/S0081543815050119zbMath1327.52041MaRDI QIDQ492284

K. S. Kobylkin

Publication date: 20 August 2015

Published in: Proceedings of the Steklov Institute of Mathematics (Search for Journal in Brave)

zbMATH Keywords

Boolean function\(k\)-polyhedral separabilitycombinatorial discrepancymonochromatic island

Mathematics Subject Classification ID

Arrangements of points, flats, hyperplanes (aspects of discrete geometry) (52C35) Combinatorial complexity of geometric structures (52C45)

Related Items (1)

Directed Projection Graph of N-Dimensional Hypercube and Subhypercube Decomposition of Balanced Linearly Separable Boolean Functions

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Sequential and parallel algorithms for finding a maximum convex polygon
• Algorithms for weak and wide separation of sets
• On the complexity of polyhedral separability
• Sylvester's question: The probability that \(n\) points are in convex position
• Separation and approximation of polyhedral objects
• A note on Sylvester’s four-point problem
• On Approximating the Depth and Related Problems
• Power Diagrams: Properties, Algorithms and Applications
• Probability Inequalities for Sums of Bounded Random Variables
• Geometric discrepancy. An illustrated guide

This page was built for publication: Lower bounds for the number of hyperplanes separating two finite sets of points