Finite string system conjecture for finitely supported loads
Statement
Let be a bounded convex domain, and let the load be finitely supported. An optimal string system consists of a pair solving the optimal string system problem. Write for its support and for the support of the load. Finite string system conjecture. A solution of the optimal string system problem exists. Moreover, there is at least one solution satisfying
The conjecture predicts that finitely supported loads admit an optimal finite string system whose strings connect only boundary points or points in the support of the load. Its status is not established by the supplied source context.
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.