ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be the polygonal domain under consideration, and let M(G)M(G) be its medial axis divided into KK pieces. For N−1N-1 discs, write the optimal way as {ni′}1K\{n'_i\}_1^{K}, and for NN discs write a way as {ni}1K\{n_i\}_1^{K}. The distance between pieces is counted by the number of connecting pieces.

Nearby-optimal-way conjecture. Given the optimal way of distributing N−1N-1 discs, {ni′}1K\{n'_i\}_1^{K}, the optimal way of distributing NN discs is nearby, where nearby means

∑1K∣ni−ni′∣\sum_1^K \mid n_i-n'_i\mid

is small; moreover, if the number of discs assigned to a piece decreases, then the pieces whose disc counts increase have minimal distance to the decreased piece.

This conjecture would justify using the optimal (N−1)(N-1)-disc solution to restrict the search for the optimal NN-disc solution to a small neighborhood of ways. The supplied text gives no resolution status.

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.