An optimal irrigation network with infinitely many branching points
Max-Planck-Institut für Mathematik in den
2 Institut für Mathematik, Universität Zürich, Winterthurerstrasse 190, 8057 Zürich, Switzerland
The Gilbert−Steiner problem is a mass transportation problem, where the cost of the transportation depends on the network used to move the mass and it is proportional to a certain power of the “flow”. In this paper, we introduce a new formulation of the problem, which turns it into the minimization of a convex functional in a class of currents with coefficients in a group. This framework allows us to define calibrations. We apply this technique to prove the optimality of a certain irrigation network in the separable Hilbert space ℓ2, having countably many branching points and a continuous amount of endpoints.
Mathematics Subject Classification: 49Q15 / 49Q20 / 49N60 / 53C38
Key words: Gilbert−Steiner problem / irrigation problem / calibrations / flatG-chains
© EDP Sciences, SMAI 2016