Papers
Topics
Authors
Recent
2000 character limit reached

Optimal (partial) transport to non-convex polygonal domains (2311.15655v3)

Published 27 Nov 2023 in math.AP

Abstract: In this paper, we investigate the optimal (partial) transport problems when the target is a non-convex polygonal domain in (\mathbb{R}2). For the complete optimal transportation, we prove that the singular set is locally a 1-dimensional smooth curve, except for a finite number of points. For the optimal partial transportation, we prove that the free boundary is smooth except for a finite number of singular points.

Summary

We haven't generated a summary for this paper yet.

Whiteboard

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.