ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let PP be a finite point set in a 22D CAT(0) complex with a single vertex OO. Set H0=PH_0=P; for each i≥1i\geq 1, let HiH_i be obtained from Hi−1H_{i-1} by adding all intersections of shortest paths between pairs of points in Hi−1H_{i-1} with edges of the complex.

Polynomial stabilization conjecture. The iterative construction stabilizes after a polynomially bounded number of iterations:

Hk=Hk+1H_k=H_{k+1}

for some polynomially bounded kk.

The preceding discussion establishes that the convex hull is closed, so the procedure is finite; the conjecture asks for a polynomial bound on the number of iterations needed for stabilization.

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.