English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Tools annual

Global: Zendy Free Plan

Global: Zendy Tools monthly

Global: Zendy Plus monthly

In this note, we prove that minimal networks enjoy minimizing properties for the length functional. A minimal network is, roughly speaking, a subset ofR  2   $\mathbb {R}^2$    composed of straight segments joining at triple junctions forming angles equal to2  3    π   $\tfrac{2}{3} \pi$   ; in particular such objects are just critical points of the length functional a priori. We show that a minimal networkΓ  ∗   $\Gamma _*$   : (i) minimizes mass among currents with coefficients in an explicit group (independent ofΓ  ∗   $\Gamma _*$   ) having the same boundary ofΓ  ∗   $\Gamma _*$   , (ii) identifies the interfaces of a partition of a neighborhood ofΓ  ∗   $\Gamma _*$    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.

Minimizing properties of networks via global and local calibrations