ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let Ω\Omega be a bounded convex domain, and let the load f∈M(Ω‾;R)f \in \mathcal{M}(\overline{\Omega};\mathbb{R}) be finitely supported. An optimal string system consists of a pair (Π^,π^)(\hat\Pi,\hat\pi) solving the optimal string system problem. Write sp(Π^,π^)\mathrm{sp}(\hat\Pi,\hat\pi) for its support and sp f\mathrm{sp}\,f 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 (Π^,π^)(\hat\Pi,\hat\pi) satisfying

sp(Π^,π^)⊂(∂Ω∪sp f)×(∂Ω∪sp f).\mathrm{sp}(\hat\Pi,\hat\pi) \subset (\partial\Omega \cup \mathrm{sp}\,f) \times (\partial\Omega \cup \mathrm{sp}\,f).

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 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.