Cost-minimizing networks among immiscible fluids in \({\mathbb{R}}^2\) (Q5929047)

The authors study cost minimizing planar networks consisting of straight line segments. The cost functional is defined by interpreting the network as the set of interfaces of a given number of immiscible fluids \(F_1,\dots, F_n\), the interface \(N_{ij}\) between the fluids \(F_i\) and \(F_j\) carrying the cost \(a_{ij}\cdot\) length \((N_{ij})\) with \(a_{ij}> 0\) and the total cost being the sum over all interfaces. The region occupied by any of the fluids may be empty or disconnected. A calibration of a network consists in the placement of \(n\) points in the plane having certain properties in relation of the interfaces and the cost factors \(a_{ij}\). \textit{G. Lawlor} and \textit{F. Morgan} [Pac. J. Math. 166, No. 1, 55-83 (1994; Zbl 0830.49028)] proved that when a cone (i.e., a network consisting of line segments meeting in one point) admits a calibration then it is minimizing and that the converse is also true provided that all fluids are present. The authors of the present paper generalize this result by proving that a minimizing cone possesses a calibration also in the case when one fluid is missing. Moreover, they construct an example showing that this need no longer be the case when two fluids are missing.