Skip to content
DraconiticResearch
Search Sources API
203,234 studies31 sourcesUpdated 41 min ago
PreprintarXiv licencearXiv

Discontinuities in optimal transport between nonconvex domains

Abstract

We develop a new approach to studying discontinuity sets of measure-preserving convex gradient maps between nonconvex domains. Such maps optimize the Euclidean distance squared. Our idea is to introduce a new `phantom' optimal transport problem, that transports the missing mass from the convex hull of the target to the `excess' Monge--Ampère measure of the minimal convex extension of the Brenier potential. We show that the closure of the discontinuity set of the original map contains the support of this phantom target. Moreover, inside a planar source domain these two sets actually coincide; on n-dimensional domains they coincide ℋn−1-a.e. The Hausdorff exponent n−1 is sharp in every dimension n≥3. For planar polygonal targets, we establish a quantitative global length bound for the closure of the discontinuity set depending only on the target geometry, valid for bounded positive densities.

Related

  1. Optimal transport to non-convex polyhedral domains
    Shibing Chen, Qi-Rui Li, Yuanyuan Li +2
    arXivPreprintCC BY-NC-ND 4.0Full textAnalysis & PDEsarXiv
  2. Strictly stable solutions in uniformly convex planar domains may have nonconvex superlevel sets
    Yi Ru-Ya Zhang
    arXivPreprintCC BY 4.0Full textAnalysis & PDEsarXiv
  3. Douglas-Rachford splitting method for nonconvex stochastic optimal control
    François Caffier, Paul Malisani, Laurent Pfeiffer
    HALPreprintCC BY 4.0Full textOptimisation & controlHALarXiv
  4. Near-Optimal Nonconvex Matrix Completion
    Jian-Feng Cai, Xiliang Lu, Juntao You
    arXivPreprintarXiv licenceFull textNumerical analysis & scientific computingarXiv
  5. Soft-Update MSA for Nonconvex Stochastic Optimal Control: Theory and Algorithms
    Shaolin Ji, Xinmeng Liu
    arXivPreprintarXiv licenceFull textOptimisation & controlarXiv
BibTeX
@misc{mccann2026discontinuities,
  title = {{Discontinuities in optimal transport between nonconvex domains}},
  author = {Robert McCann and Arghya Rakshit},
  howpublished = {arXiv},
  year = {2026},
  month = nov,
  doi = {10.48550/arxiv.2611.03950},
  eprint = {2611.03950},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2611.03950},
}
RIS
TY  - UNPB
TI  - Discontinuities in optimal transport between nonconvex domains
AU  - Robert McCann
AU  - Arghya Rakshit
PY  - 2026
DA  - 2026/11/02
PB  - arXiv
DO  - 10.48550/arxiv.2611.03950
UR  - https://arxiv.org/abs/2611.03950
AB  - We develop a new approach to studying discontinuity sets of measure-preserving convex gradient maps between nonconvex domains. Such maps optimize the Euclidean distance squared. Our idea is to introduce a new `phantom' optimal transport problem, that transports the missing mass from the convex hull of the target to the `excess' Monge--Ampère measure of the minimal convex extension of the Brenier potential. We show that the closure of the discontinuity set of the original map contains the support of this phantom target. Moreover, inside a planar source domain these two sets actually coincide; on n-dimensional domains they coincide ℋ^n−1-a.e. The Hausdorff exponent n−1 is sharp in every dimension n≥3. For planar polygonal targets, we establish a quantitative global length bound for the closure of the discontinuity set depending only on the target geometry, valid for bounded positive densities.
ER  -