The structure of singularities in -minimizing networks in R^ 2

From MaRDI portal





It is well known that length-minimizing networks in \({\mathbb{R}}^ 2\) consist of segments meeting only in threes. This paper considers uniformly convex norms \(\Phi\) more general than length. The first theorem says that for any such smooth \(\Phi\), minimizing networks still meet only in threes. The second theorem shows that for some piecewiese smooth \(\Phi\), segments can meet in fours (although never in fives or more).











This page was built for publication: The structure of singularities in \(\Phi\)-minimizing networks in \({\mathbb{R}}^ 2\)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q910346)