OpenAlex ·
Optimal transport to non-convex polyhedral domains
- Published
- Source
- OpenAlex
- Published in
- arXiv (Cornell University)
- DOI
- 10.48550/arxiv.2610.18756
- Original
- Read it at the publisher
- Topics
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.
More in Computational Complexity
Query Complexity of Densest Sub(hyper)graph Problems
Geometric Kernel Diversity: An Axiomatic Diversity Measure in Euclidean Space
Nearly Optimal Quantum Sample Complexity of Learning Fourier-Sparse Boolean Functions
Undirected Network Coding and Faster External-Memory Integer Sorting
Hitting Minors: Stronger Lower Bounds
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.