Minimizing optimal transport for functions with fixed-size nodal sets
Abstract
Consider the class of zero-mean functions with fixed and norms and exactly nodal points. Which functions minimize , 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 . 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 is not inversely proportional to the size of the nodal set, . Based on similar reductions, we make connections between the analogous problem of minimizing for defined on with an equivalent optimal domain partition problem.
Cite
@article{arxiv.2110.14837,
title = {Minimizing optimal transport for functions with fixed-size nodal sets},
author = {Qiang Du and Amir Sagiv},
journal= {arXiv preprint arXiv:2110.14837},
year = {2023}
}