On the anisotropic partitioning problem in Euclidean convex domains
Abstract
We consider the variational problem of minimizing an anisotropic perimeter functional under a volume constraint in a Euclidean convex domain. We extend to this setting analytical properties of the isoperimetric profile, topological features about the minimizers and sharp isoperimetric inequalities with respect to convex cones. Besides some geometric measure theory results about the existence and regularity of minimizers, the proofs rely on a second variation formula for the anisotropic area of hypersurfaces with non-empty boundary.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.