Calibrations for minimal networks in a covering space setting

Supervisor
Alessandra Pluda - Universit├Ąt Regensburg
Date and time
Tuesday, November 21, 2017 at 2:30 PM - Sala verde.
Programme Director
External reference
Publication date
October 17, 2017
Department
Computer Science  

Summary

In this talk I will present an improvement of the approach to the Steiner problem proposed by Amato, Bellettini and Paolini, which is based on the minimization of the perimeter of subsets of a suitably chosen covering space. In this setting I will define a proper notion of calibration
giving some examples. Finally I will focus on a calibration argument that allows to prove the minimality of the Steiner configurations for the vertices of a regular hexagon. This is a joint work with Marcello Carioni.

Contact persons: Annalisa Massacesi, Giandomenico Orlandi.





© 2002 - 2021  Verona University
Via dell'Artigliere 8, 37129 Verona  |  P. I.V.A. 01541040232  |  C. FISCALE 93009870234