OpenAlex ·

Optimal transport to non-convex polyhedral domains

Shibing Chen, Qi-Rui Li, Yuanyuan Li, Jiakun Liu and Xiaotian Wu

Published
Source
OpenAlex
Published in
arXiv (Cornell University)
DOI
10.48550/arxiv.2610.18756
Original
Read it at the publisher
Topics
Computational ComplexityNumerical Analysis

Abstract

We study optimal transport with a non-convex polyhedral target in $\mathbb{R}^n$. The closure of the singular set is locally a smooth hypersurface outside a relatively closed set of Hausdorff dimension at most $n-2$. For partial transport between domains separated by a hyperplane, the source free boundary has the same regularity.

The authors’ abstract, as arXiv lists it. arXiv’s listings, abstracts included, are free for anyone to reuse.

Read it on ReadSearch

Each opens after you create an account, and brings you back to this paper.

Already a reader? Sign in

All new papers in Computational Complexity

Get the few papers worth your time in Computational Complexity every morning.

ReadSearch reads the new papers in your field each day and brings you the few worth reading, each with its key finding in a sentence.

Papers belong to their authors and publishers; every page here links to the original. All research topics