ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let Q1,…,QnQ_1,\ldots,Q_n be points and let B1,…,BnB_1,\ldots,B_n be edges of a convex hull, with each point matched to one edge and the resulting triangles considered as in the preceding heuristic. Termination conjecture. The algorithm described above always terminates. This is presented as an observation relevant to the matching problem in the discussion, but no proof or resolution is given in the supplied text.

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.