On the anisotropic partitioning problem in Euclidean convex domains
On the anisotropic partitioning problem in Euclidean convex domains
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.
César Rosales
数学
César Rosales.On the anisotropic partitioning problem in Euclidean convex domains[EB/OL].(2025-04-11)[2025-05-21].https://arxiv.org/abs/2504.08345.点此复制
评论