Area Minimizing Sets Subject to a Volume Constraint in a Convex Set

Abstract

In this paper we consider the problem of minimizing area subject to a volume constraint in a given convex set.

0

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.

Discussion (0)

Sign in to join the discussion.

Loading comments…