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. A way WW is a distribution of NN discs over these pieces, written

W={ni}1K,N=∑iKni,W=\{n_i\}_1^{K},\qquad N=\sum_i^K n_i,

with ni∈Nn_i\in\mathbb{N} and ni∈{0,1}n_i\in\{0,1\} when the ii-th piece is a junction point.

One-local-maximum-per-way conjecture. There is at most one local maximum per way.

If true, an optimal NN-disc filling could be found by generating a maximum for every way; this would reduce the search to a finite collection whose size is of order O(NK−J−1)O\left(N^{K-J-1}\right) when JJ of the KK pieces are junctions. Whether a way can support multiple local maxima is not resolved 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.