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).
Recommendations
Cited in
(10)- Minimal surfaces, crystals, shortest networks, and undergraduate research
- Wulff clusters in \(\mathbb{R}^2\)
- The Steiner ratio for the dual normed plane
- Minimum Steiner trees in normed planes
- A tight lower bound for the Steiner ratio in Minkowski planes
- Examples of DLR states which are not weak limits of finite volume Gibbs measures with deterministic boundary conditions
- On the Gibbs states of the noncritical Potts model on \(\mathbb Z ^2\)
- The local Steiner problem in normed planes
- Linear networks and convex polytopes
- On the Steiner property for planar minimizing clusters. The anisotropic case
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)