Calibrations for minimal networks in a covering space setting
From MaRDI portal
Publication:5118957
DOI10.1051/COCV/2019024zbMATH Open1479.49094arXiv1707.01448OpenAlexW2963209203MaRDI QIDQ5118957FDOQ5118957
Marcello Carioni, Alessandra Pluda
Publication date: 28 August 2020
Published in: ESAIM: Control, Optimisation and Calculus of Variations (Search for Journal in Brave)
Abstract: In this paper we define a notion of calibration for an equivalent approach to the classical Steiner problem in a covering space setting and we give some explicit examples. Moreover we introduce the notion of calibration in families: the idea is to divide the set of competitors in a suitable way, defining an appropriate (and weaker) notion of calibration. Then, calibrating the candidate minimizers in each family and comparing their perimeter, it is possible to find the minimizers of the minimization problem. Thanks to this procedure we prove the minimality of the Steiner configurations spanning the vertices of a regular hexagon and of a regular pentagon.
Full work available at URL: https://arxiv.org/abs/1707.01448
Variational problems in a geometric measure-theoretic setting (49Q20) Minimal surfaces and optimization (49Q05) Covering spaces and low-dimensional topology (57M10)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Density theorems for local minimizers of area-type functionals
- Variational methods in image segmentation with 7 image processing experiments
- The calibration method for the Mumford-Shah functional and free-discontinuity problems
- Approximation of Length Minimization Problems Among Compact Connected Sets
- Paired calibrations applied to soap films, immiscible fluids, and surfaces or networks minimizing other norms
- Functionals defined on partitions in sets of finite perimeter. II: Semicontinuity, relaxation and homogenization
- Numerical minimization of geometrical type problems related to calculus of variations
- Existence and regularity results for the Steiner problem
- Connected components of sets of finite perimeter and applications to image processing
- Tubular neighborhoods in Euclidean spaces
- Functionals defined on partitions in sets of finite perimeter. I: Integral representation and Gamma-convergence
- Soap films and covering spaces
- Constrained BV functions on covering spaces for minimal networks and Plateau's type problems
- The Steiner tree problem revisited through rectifiable \(G\)-currents
- Convex relaxation and variational approximation of the Steiner problem: theory and numerics
- Steiner minimal trees for regular polygons
- Covers, soap films and BV functions
- Triple covers and a non-simply connected surface spanning an elongated tetrahedron and beating the cone
- A Modica-Mortola approximation for the Steiner problem
- Numerical Solution of Soap Film Dual Problems
- Numerical calibration of Steiner trees
- A phase-field approximation of the Steiner problem in dimension two
- Variational Approximation of Functionals Defined on 1-dimensional Connected Sets: The Planar Case
Cited In (6)
- On length-minimizing Steiner networks
- Existence and uniqueness of the motion by curvature of regular networks
- Minimizing properties of networks via global and local calibrations
- On different notions of calibrations for minimal partitions and minimal networks in \(\mathbb{R}^2\)
- A Multimaterial Transport Problem and its Convex Relaxation via Rectifiable $G$-currents
- On the \(L\)-minimizing networks in \(\mathbb R^n\)
Recommendations
- Title not available (Why is that?) 👍 👎
- Min-max theory for networks of constant geodesic curvature 👍 👎
- Extremal problems in Minkowski space related to minimal networks 👍 👎
- Correlation between the norm and the geometry of minimal networks 👍 👎
- On the \(L\)-minimizing networks in \(\mathbb R^n\) 👍 👎
- Minimum networks in uniform orientation metrics 👍 👎
- SOME PROBLEMS CONCERNING MINIMAL NETWORKS 👍 👎
- On different notions of calibrations for minimal partitions and minimal networks in \(\mathbb{R}^2\) 👍 👎
- Reconstruction of norm by geometry of minimal networks 👍 👎
- Minimizing properties of networks via global and local calibrations 👍 👎
This page was built for publication: Calibrations for minimal networks in a covering space setting
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5118957)
