Connectedness conjecture for least-perimeter disk partitions
Statement
Let a minimizing graph be a least-perimeter partition of the unit disk into regions of prescribed areas. Connectedness conjecture. A minimizing graph separates the disk into connected regions. The paper proves the corresponding statement for three regions under the connectedness analysis developed there, while connectedness for general minimizing partitions remains open.
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.