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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
