# Calibrations for minimal networks in a covering space setting

created by pluda on 05 Mar 2017
modified by carioni on 14 Mar 2017

[BibTeX]

Preprint

Inserted: 5 mar 2017
Last Updated: 14 mar 2017

Year: 2017
Notes:

Preliminary version

Abstract:

In this paper we minimize the total variation of $BV$--functions with values in $\{0,1\}$ (that satisfy a constraint) defined on a suitable covering space and we prove an equivalence between the minimization problem and the classical Steiner problem. Moreover we define a notion of calibrations in our setting and we exhibit some explicit examples.