Skip to main content Accessibility help
×
Hostname: page-component-5c6d5d7d68-ckgrl Total loading time: 0 Render date: 2024-08-15T22:16:06.835Z Has data issue: false hasContentIssue false

30 - Regularity of minimizing clusters

Published online by Cambridge University Press:  05 October 2012

Francesco Maggi
Affiliation:
Università degli Studi di Firenze, Italy
Get access

Summary

This chapter is devoted to the discussion of the regularity properties of minimizing clusters. We shall first prove the following Hn−1-a.e. regularity result in arbitrary dimension (Theorem 30.1); then, in Section 30.3, we shall focus on the planar case, and achieve a more precise result, including a complete description of near-to-singularities behavior; see Theorem 30.7.

Theorem 30.1If ε is a minimizing N-cluster inn and 0 ≤ hkN, then ε(h, k) is an analytic hypersurface with constant mean curvature inn, which is relatively open in ε(h) ∩ ε(k), and satisfies

The key tool in the proof of Theorem 30.1 is the infiltration lemma of Section 30.1, which allows us, for example, to prove each chamber of the cluster to be a volume-constrained perimeter minimizer in a neighborhood of its interface points; see Corollary 30.3. In Section 30.2 we shall combine this result with some density estimates in order to complete the proof of (30.1).

Infiltration lemma

The following lemma shows that if some chambers of a minimizing cluster fill most of B(x, 2r), then they completely fill B(x, r).

Type
Chapter
Information
Sets of Finite Perimeter and Geometric Variational Problems
An Introduction to Geometric Measure Theory
, pp. 431 - 444
Publisher: Cambridge University Press
Print publication year: 2012

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Save book to Kindle

To save this book to your Kindle, first ensure coreplatform@cambridge.org is added to your Approved Personal Document E-mail List under your Personal Document Settings on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part of your Kindle email address below. Find out more about saving to your Kindle.

Note you can select to save to either the @free.kindle.com or @kindle.com variations. ‘@free.kindle.com’ emails are free but can only be saved to your device when it is connected to wi-fi. ‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.

Find out more about the Kindle Personal Document Service.

  • Regularity of minimizing clusters
  • Francesco Maggi, Università degli Studi di Firenze, Italy
  • Book: Sets of Finite Perimeter and Geometric Variational Problems
  • Online publication: 05 October 2012
  • Chapter DOI: https://doi.org/10.1017/CBO9781139108133.036
Available formats
×

Save book to Dropbox

To save content items to your account, please confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account. Find out more about saving content to Dropbox.

  • Regularity of minimizing clusters
  • Francesco Maggi, Università degli Studi di Firenze, Italy
  • Book: Sets of Finite Perimeter and Geometric Variational Problems
  • Online publication: 05 October 2012
  • Chapter DOI: https://doi.org/10.1017/CBO9781139108133.036
Available formats
×

Save book to Google Drive

To save content items to your account, please confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account. Find out more about saving content to Google Drive.

  • Regularity of minimizing clusters
  • Francesco Maggi, Università degli Studi di Firenze, Italy
  • Book: Sets of Finite Perimeter and Geometric Variational Problems
  • Online publication: 05 October 2012
  • Chapter DOI: https://doi.org/10.1017/CBO9781139108133.036
Available formats
×