The nearby-optimal-way conjecture for polygon fillings
Statement
Let be the polygonal domain under consideration, and let be its medial axis divided into pieces. For discs, write the optimal way as , and for discs write a way as . The distance between pieces is counted by the number of connecting pieces.
Nearby-optimal-way conjecture. Given the optimal way of distributing discs, , the optimal way of distributing discs is nearby, where nearby means
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 -disc solution to restrict the search for the optimal -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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.