2000 character limit reached
$C_{loc}^{1,1}$ optimal pairs in the dual optimal transport problem for a Lorentzian cost along displacement interpolations
Published 15 Apr 2025 in math.OC | (2504.11556v1)
Abstract: We consider the optimal transportation problem on a globally hyperbolic spacetime with a cost function $c$, which corresponds to the optimal transportation problem on a complete Riemannian manifold where the cost function is given by the squared Riemannian distance. Building upon methods of weak KAM theory, we will establish the existence of $C_{loc}{1,1}$ optimal pairs for the dual optimal transport problem for probability measures along displacement interpolations.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.