Matchings in metric spaces, the dual problem and calibrations modulo 2

MaRDI QIDQ502164zbMATH OpenFDO

Authors Mircea Petrache, Roger Züst

Publication date 3 January 2017

Published in The New York Journal of Mathematics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1410.0062, http://www.emis.de/journals/NYJM/j/2016/22-57.html

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

zbMATH Keywords

treecalibrationKantorovich dualityminimal matchingrectifiable chain

Mathematics Subject Classification ID

Variational problems in a geometric measure-theoretic setting (49Q20) Length, area, volume, other geometric measure theory (28A75) Minimal surfaces and optimization (49Q05) Geometric measure and integration theory, integral and normal currents in optimization (49Q15)

Abstract: We show that for a metric space with an even number of points there is a 1-Lipschitz map to a tree-like space with the same matching number. This result gives the first basic version of an unoriented Kantorovich duality. The study of the duality gives a version of global calibrations for 1-chains with coefficients in $mathbb{Z}_2$. Finally we extend the results to infinite metric spaces and present a notion of "matching dimension" which arises naturally.

Recommendations

• On relations between transportation cost spaces and _1
• An optimal matching problem
• Matchings and the variance of Lipschitz functions
• Strong duality of the Monge-Kantorovich mass transfer problem in metric spaces
• On the uniqueness and numerical approximations for a matching problem

Cited in

(1)

• Coefficient groups inducing nonbranched optimal transport

This page was built for publication: Matchings in metric spaces, the dual problem and calibrations modulo 2

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q502164)