Area minimizing sets subject to a volume constraint in a convex set
- 146 Downloads
For a given convex subset Ω of Euclidean n-space, we consider the problem of minimizing the perimeter of subsets of Ω subject to a volume constraint. The problem is to determine whether in general a minimizer is also convex. Although this problem is unresolved, we show that if Ω satisfies a “great circle” condition, then any minimizer is convex. We say that Ω satisfies a great circle condition if the largest closed ball B contained in Ω has a great circle that is contained in the boundary of Ω. A great circle of B is defined as the intersection of the boundary of B with a hyperplane passing through the center of B.
Math Subject Classifications49Q20 49Q15 49Q10 52A20
Key Words and Phrasessets of finite perimeter volume constraint area minimizing constant mean curvature
Unable to display preview. Download preview PDF.
- Giusti, E.Minimal Surfaces and Functions of Bounded Variation, Birkhäuser, Boston, MA, 1985.Google Scholar
- Massari, U. and Miranda, M. Minimal surfaces of codimension one,Math. Studies, North Holland,91, (1984).Google Scholar
- Simon, L. Lectures on geometric measure theory,Proc. Centre Math. Analysis, ANU,3, (1983).Google Scholar