Related papers: A Diophantine transport problem from 2016 and its …
We consider so-called branched transport and variants thereof in two space dimensions. In these models one seeks an optimal transportation network for a given mass transportation task. In two space dimensions, they are closely connected to…
The traveling salesman problem is a fundamental combinatorial optimization problem with strong exact algorithms. However, as problems scale up, these exact algorithms fail to provide a solution in a reasonable time. To resolve this, current…
The optimal transport (OT) problem is a classical optimization problem having the form of linear programming. Machine learning applications put forward new computational challenges in its solution. In particular, the OT problem defines a…
A famous problem posed by Diophantus was to find sets of distinct positive rational numbers such that the product of any two is one less than a rational square. Some sets of six such numbers are presented and the computational algorithm…
Diophantine approximation is the problem of approximating a real number by rational numbers. We propose a version of this in which the numerators are approximately related to the denominators by a Laurent polynomial. Our definition is…
Optimal transport (OT) distances are finding evermore applications in machine learning and computer vision, but their wide spread use in larger-scale problems is impeded by their high computational cost. In this work we develop a family of…
Using elementary number theory we study Diophantine equations over the rational integers of the following form, $y^2=(x+a)(x+a+k)(x+b)(x+b+k)$, $y^2=c^2x^4+ax^2+b$ and $y^2=(x^2-1)(x^2-\alpha^2)(x^2-(\alpha+1)^2).$ We express their integer…
This is an English translation from the Latin original of Leonhard Euler's ``Solutio facilior problematis Diophantei circa triangulum, in quo rectae ex angulis latera opposita bisecantes rationaliter exprimantur''. In this paper, Euler…
We consider the transport equation with a velocity field satisfying the Osgood condition. The weak formulation is not meaningful in the usual Lebesgue sense, meaning that the usual DiPerna--Lions treatment of the problem is not applicable…
We derive a closed expression for the number of nonnegative solutions of a certain system of linear Diophantine equations. The motivation comes from high energy physics where the nonnegative solutions play a crucial role in the perturbative…
We study a generalization of the multi-marginal optimal transport problem, which has no fixed number of marginals $N$ and is inspired of statistical mechanics. It consists in optimizing a linear combination of the costs for all the possible…
We consider a Beckmann formulation of an unbalanced optimal transport (UOT) problem. The $\Gamma$-convergence of this formulation of UOT to the corresponding optimal transport (OT) problem is established as the balancing parameter $\alpha$…
In this article, we make use of some known method to investigate some properties of the numbers represented as sums of two equal odd powers, i.e., the equation $x^n+y^n=N$ for $n\ge3$. It was originated in developing algorithms to search…
We describe a mechanical device which can be used as an analog computer to solve the transportation problem. In practice this device is simulated by a numerical algorithm. Tests show that this algorithm is 60 times faster than a current…
This paper presents a widely applicable approach to solving (multi-marginal, martingale) optimal transport and related problems via neural networks. The core idea is to penalize the optimization problem in its dual formulation and reduce it…
Recently the second and third author developed an iterative scheme for obtaining rough solutions of the 3D incompressible Euler equations in H\"older spaces (arXiv:1202.1751 and arXiv:1205.3626 (2012)). The motivation comes from Onsager's…
An optimal transport problem on finite spaces is a linear program. Recently, a relaxation of the optimal transport problem via strictly convex functions, especially via the Kullback--Leibler divergence, sheds new light on data sciences.…
We establish numerical methods for solving the martingale optimal transport problem (MOT) - a version of the classical optimal transport with an additional martingale constraint on transport's dynamics. We prove that the MOT value can be…
A new $L^p$-primal-dual weak Galerkin method ($L^p$-PDWG) with $p>1$ is proposed for the first-order transport problems. The existence and uniqueness of the $L^p$-PDWG numerical solutions is established. In addition, the $L^p$-PDWG method…
Nonlinear programming problems are useful in designing and assigning work schedule and also in transporting goods and services from known sources to specified destinations. The objective function could be linear or nonlinear depending on…