Minimizing optimal transport for functions with fixed-size nodal sets

Abstract

Consider the class of zero-mean functions with fixed L∞ and L1 norms and exactly N∈ N nodal points. Which functions f minimize Wp(f+,f-), the Wasserstein distance between the measures whose densities are the positive and negative parts? We provide a complete solution to this minimization problem on the line and the circle, which provides sharp constants for previously proven ``uncertainty principle''-type inequalities, i.e., lower bounds on N· Wp (f+, f-). We further show that, while such inequalities hold in many metric measure spaces, they are no longer sharp when the non-branching assumption is violated; indeed, for metric star-graphs, the optimal lower bound on Wp(f+,f-) is not inversely proportional to the size of the nodal set, N. Based on similar reductions, we make connections between the analogous problem of minimizing Wp(f+,f-) for f defined on ⊂Rd with an equivalent optimal domain partition problem.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…