Regularity for Minimizers of a Planar Partitioning Problem with Cusps
Michael Novack

TL;DR
This paper proves regularity properties of minimizers in a planar partitioning problem with cusps, showing that boundaries are smooth curves with finitely many constant curvature segments, and characterizes minimizers under certain conditions.
Contribution
It establishes regularity results for minimizers of a soap bubble-like partitioning problem with cusps, including boundary smoothness and junction behavior, and characterizes minimizers for small perturbations.
Findings
Boundaries are $C^{1,1}$ with finitely many constant curvature curves.
Cusps occur only at junctions involving the set $G$.
Minimizers for small $ ext{delta}$ are perturbations of the zero-$ ext{delta}$ case with wetted triple junctions.
Abstract
We study the regularity of minimizers for a variant of the soap bubble cluster problem: \begin{align*} \min \sum_{\ell=0}^N c_{\ell} P( S_\ell)\,, \end{align*} where , among partitions of satisfying and an area constraint on each for . If , we prove that for any minimizer, each is and consists of finitely many curves of constant curvature. Any such curve contained in or can only terminate at a point in at which has a cusp. We also analyze a similar problem on the unit ball with a trace constraint instead of an area constraint and obtain analogous regularity up to . Finally, in the case of equal coefficients…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsPoint processes and geometric inequalities · Limits and Structures in Graph Theory · Mathematical Approximation and Integration
