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: align* Σ=0N c P( S)\,, align* where c>0, among partitions \S0,…,SN,G\ of R2 satisfying |G|≤ δ and an area constraint on each S for 1≤ ≤ N. If δ>0, we prove that for any minimizer, each ∂ S is C1,1 and consists of finitely many curves of constant curvature. Any such curve contained in ∂ S ∂ Sm or ∂ S ∂ G can only terminate at a point in ∂ G ∂ S ∂ Sm at which G has a cusp. We also analyze a similar problem on the unit ball B with a trace constraint instead of an area constraint and obtain analogous regularity up to ∂ B. Finally, in the case of equal coefficients c, we completely characterize minimizers on the ball for small δ: they are perturbations of minimizers for δ=0 in which the triple junction singularities, including those possibly on ∂ B, are ``wetted" by G.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…