Affiliation:
1. Dipartimento di Matematica Università di Pisa Pisa Italy
2. Dipartimento di Matematica e Applicazioni Università di Napoli Federico II Naples Italy
Abstract
AbstractIn this note, we prove that minimal networks enjoy minimizing properties for the length functional. A minimal network is, roughly speaking, a subset of composed of straight segments joining at triple junctions forming angles equal to ; in particular such objects are just critical points of the length functional a priori. We show that a minimal network : (i) minimizes mass among currents with coefficients in an explicit group (independent of ) having the same boundary of , (ii) identifies the interfaces of a partition of a neighborhood of solving the minimal partition problem among partitions with same boundary traces. Consequences and sharpness of such results are discussed. The proofs reduce to rather simple and direct arguments based on the exhibition of (global or local) calibrations associated to the minimal network.
Reference22 articles.
1. The calibration method for the Mumford-Shah functional and free-discontinuity problems
2. Functionals defined on partitions in sets of finite perimeter. I. Integral representation and Γ$\Gamma$‐convergence;Ambrosio L.;J. Math. Pures Appl. (9),1990
3. Functionals defined on partitions in sets of finite perimeter. II. Semicontinuity, relaxation and homogenization;Ambrosio L.;J. Math. Pures Appl. (9),1990
4. Functions of Bounded Variation and Free Discontinuity Problems
5. Variational Approximation of Functionals Defined on 1-dimensional Connected Sets: The Planar Case
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献