On different notions of calibrations for minimal partitions and minimal networks in \(\mathbb{R}^2\)
From MaRDI portal
Publication:2039531
DOI10.1515/acv-2019-0005zbMath1473.51005arXiv1805.11397OpenAlexW3098431178MaRDI QIDQ2039531
Marcello Carioni, Alessandra Pluda
Publication date: 5 July 2021
Published in: Advances in Calculus of Variations (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1805.11397
Related Items (3)
Existence and uniqueness of the motion by curvature of regular networks ⋮ Minimizing properties of networks via global and local calibrations ⋮ Energy minimizing maps with prescribed singularities and Gilbert-Steiner optimal networks
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Constrained BV functions on covering spaces for minimal networks and Plateau's type problems
- The Steiner tree problem revisited through rectifiable \(G\)-currents
- Calibrated geometries
- The deformation theorem for flat chains
- Convex relaxation and variational approximation of the Steiner problem: theory and numerics
- Covers, soap films and BV functions
- Rectifiability of flat chains
- Every stationary polyhedral set in \(\mathbb{R}^ n\) is area minimizing under diffeomorphisms
- The calibration method for the Mumford-Shah functional and free-discontinuity problems
- Paired calibrations applied to soap films, immiscible fluids, and surfaces or networks minimizing other norms
- Soap films and covering spaces
- Clusters with multiplicities in \(\mathbb R^2\)
- Quelques problèmes de géométrie riemannienne ou deux variations sur les espaces symétriques compacts de rang un
- Variational Approximation of Functionals Defined on 1-dimensional Connected Sets: The Planar Case
- A Convex Approach to Minimal Partitions
- Calibrations for minimal networks in a covering space setting
- Flat Chains Over a Finite Coefficient Group
This page was built for publication: On different notions of calibrations for minimal partitions and minimal networks in \(\mathbb{R}^2\)
