On different notions of calibrations for minimal partitions and minimal networks in ℝ2

Marcello Carioni, Alessandra Pluda

Research output: Working paper

3 Downloads (Pure)

Abstract

Calibrations are a possible tool to validate the minimality of a certain candidate. They have been introduced in the context of minimal surfaces [4, 11, 14] and adapted to the case of the Steiner problem in several variants. Our goal is to compare the different notions of calibrations for the Steiner Problem and for planar minimal partitions appearing in [8, 15, 16]. The paper is then complemented with remarks on the convexification of the problem, on non–existence of calibrations and on calibrations in families.
Original languageEnglish
PublisherArXiv.org
Number of pages22
DOIs
Publication statusPublished - 2018
Externally publishedYes

Fingerprint

Dive into the research topics of 'On different notions of calibrations for minimal partitions and minimal networks in ℝ2'. Together they form a unique fingerprint.

Cite this