arXiv (All)
open access
Optimal transport to non-convex polyhedral domains
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 bo
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Convex Hulls of Reachable Sets#144182
- Transfer Learning via Regularized Random-effects Linear Discriminant Analysis.#1236372
- Moving Geometric Objects to Render Their Intersection Graph Connected or Locally Dense#1048354
- More on Disjunctive Convex Hulls of Generalized Cross Polytopes#1201573
- Dispersion Polymerization of Styrene Mediated by Low Amounts of Poly(4-Vinylpyridine) Macromolecular Chain-Transfer Agent#468207
Record · ID 1344253
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive