Separating-line conjecture for two point sets in the Cartesian plane
Statement
Let and be two sets of points in the Cartesian plane. Assume that no two line segments determined by four distinct points, with exactly two points from one set, intersect unless the endpoints of one segment belong to different sets. Let and be the two disjoint regions into which a line divides the plane, excluding points on the line. Separating-line conjecture. There exists at least one line such that and ; no line segment joining two points of the same set meets ; and every line segment joining points from different sets meets . This conjecture is introduced as a geometric foundation for the proposed binary-classification algorithm; the source provides no resolution or proof status beyond presenting it as a conjecture.
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.