Regularity for Minimizers of a Planar Partitioning Problem with Cusps
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 , we completely characterize minimizers on the ball for small : they are perturbations of minimizers for in which the triple junction singularities, including those possibly on , are ``wetted" by .
Keywords
Cite
@article{arxiv.2305.11865,
title = {Regularity for Minimizers of a Planar Partitioning Problem with Cusps},
author = {Michael Novack},
journal= {arXiv preprint arXiv:2305.11865},
year = {2025}
}