The structure of singularities in \(\Phi\)-minimizing networks in \({\mathbb{R}}^ 2\) (Q910346): Difference between revisions

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).