Related papers: A Diophantine transport problem from 2016 and its …
This paper studies the equitable and optimal transport (EOT) problem, which has many applications such as fair division problems and optimal transport with multiple agents etc. In the discrete distributions case, the EOT problem can be…
A probabilistic method for solving the Monge-Kantorovich mass transport problem on $R^d$ is introduced. A system of empirical measures of independent particles is built in such a way that it obeys a doubly indexed large deviation principle…
A numerical method for the solution of the elliptic Monge-Ampere Partial Differential Equation, with boundary conditions corresponding to the Optimal Transportation (OT) problem is presented. A local representation of the OT boundary…
Many research has been conducted about quadratic programming and inverse optimization. In this paper we present the combination aspect of these subjects, applying on transportation problem. First, we obtain the inverse form of quadratic…
Several N-body problems in ordinary (3-dimensional) space are introduced which are characterized by Newtonian equations of motion (``acceleration equal force;'' in most cases, the forces are velocity-dependent) and are amenable to exact…
It is important in drawing techniques to find combinations of two straight lines and their angle bisectors whose slopes are all rational numbers. This problem is reduced to solving the Diophantine equation $(a-c)^2(b^2+1) = (b-c)^2(a^2+1).$…
By using pairs of nontrivial rational solutions of congruent number equation $$ C_N:\;\;y^2=x^3-N^2x, $$ constructed are pairs of rational right (Pythagorean) triangles with one common side and the other sides equal to the sum and…
We study an optimization problem related to the approximation of given data by a linear combination of transformed modes. In the simplest case, the optimization problem reduces to a minimization problem well-studied in the context of proper…
In this paper, the elliptic curves theory is used for solving the Diophantine equations $\sum_{i=1}^n a_ix_{i} ^6+\sum_{i=1}^m b_iy_{i} ^3= \sum_{i=1}^na_iX_{i}^6\pm\sum_{i=1}^m b_iY_{i} ^3$, where $n$, $m$ $\geq 1$ and $a_i$, $b_i$, are…
We study the nonlocal Stefan problem, where the phase transition is described by a nonlocal diffusion as well as the change of enthalpy functions. By using a stochastic optimization approach introduced for the local case, we construct…
Monograph "B. Grechuk, Polynomial Diophantine equations. A systematic approach" suggests solving Diophantine equations systematically in certain order. Many hundreds of the equations are left to the reader. Here, we provide complete…
Consider the equation $q_1\alpha^{x_1}+\dots+q_k\alpha^{x_k} = q$, with constants $\alpha \in \overline{\mathbb{Q}} \setminus \{0,1\}$, $q_1,\ldots,q_k,q\in\overline{\mathbb{Q}}$ and unknowns $x_1,\ldots,x_k$, referred to in this paper as…
We exhibit a one-parameter family of first-order real elliptic systems on the plane whose ellipticity constant degenerates to zero as $\delta\to 0$, with condition number $\kappa = O(\delta^{-2})$. For any fixed elliptic solver operating at…
In this paper we present a novel method for the numerical solution of linear transport equations, which is based on ridgelets. Such equations arise for instance in radiative transfer or in phase contrast imaging. Due to the fact that…
We face the well-posedness of linear transport Cauchy problems $$\begin{cases}\dfrac{\partial u}{\partial t} + b\cdot\nabla u + c\,u = f&(0,T)\times{\mathbb R}^n\\u(0,\cdot)=u_0\in L^\infty&{\mathbb R}^n\end{cases}$$ under borderline…
In this paper, we present a splitting algorithm to solve multicomponent transport models. These models are related to plasma simulations, in which we consider the local thermodynamic equilibrium and weakly ionised plasma-mixture models that…
The linear transport theory is developed to describe the time dependence of the number density of tracer particles in porous media. The advection is taken into account. The transport equation is numerically solved by the analytical discrete…
In this article we study a broad class of integer programming problems in variable dimension. We show that these so-termed {\em n-fold integer programming problems} are polynomial time solvable. Our proof involves two heavy ingredients…
The optimal transport problem studies how to transport one measure to another in the most cost-effective way and has wide range of applications from economics to machine learning. In this paper, we introduce and study an information…
Adapted optimal transport (AOT) problems are optimal transport problems for distributions of a time series where couplings are constrained to have a temporal causal structure. In this paper, we develop computational tools for solving AOT…