ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let X0X_{0} and X1X_{1} 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 AA and BB be the two disjoint regions into which a line l1l_{1} divides the plane, excluding points on the line. Separating-line conjecture. There exists at least one line l1l_{1} such that X0⊂AX_{0} \subset A and X1⊂BX_{1} \subset B; no line segment joining two points of the same set meets l1l_{1}; and every line segment joining points from different sets meets l1l_{1}. 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 in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.