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.
An optimal irrigation network with infinitely many branching points
Massaccesi, Annalisa
2016-01-01
Abstract
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.File in questo prodotto:
Non ci sono file associati a questo prodotto.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.