Related papers: The sum of all width-one matrices

We study the optimal transport problem in sub-Riemannian manifolds where the cost function is given by the square of the sub-Riemannian distance. Under appropriate assumptions, we generalize Brenier-McCann's Theorem proving existence and…

An Erd\"os matrix $E$ is a bistochastic matrix whose sum of squares of entries (Frobenius norm squared) equals its maxtrace (maximum of all the $\sigma$-traces for permutations $\sigma$'s). We characterize all Erd\"os $E$ by the patterns of…

This paper provides a comprehensive study of the nonmonotone forward-backward splitting (FBS) method for solving a class of nonsmooth composite problems in Hilbert spaces. The objective function is the sum of a Fr\'echet differentiable (not…

Optimal transportation, or computing the Wasserstein or ``earth mover's'' distance between two distributions, is a fundamental primitive which arises in many learning and statistical settings. We give an algorithm which solves this problem…

Associated to any finite metric space are a large number of objects and quantities which provide some degree of structural or geometric information about the space. In this paper we show that in the setting of subsets of weighted Hamming…

The walk matrix of an $n$-vertex graph $G$ with adjacency matrix $A$, denoted by $W(G)$, is $[e,Ae,\ldots,A^{n-1}e]$, where $e$ is the all-ones vector. Let $G\circ P_m$ be the rooted product of $G$ and a rooted path $P_m$ (taking an…

The geometric transportation problem takes as input a set of points $P$ in $d$-dimensional Euclidean space and a supply function $\mu : P \to \mathbb{R}$. The goal is to find a transportation map, a non-negative assignment $\tau : P \times…

Let $x_{1},x_{2},\ldots,x_{n}$ be $n$ numbers, and $y_{1},y_{2},\ldots,y_{n}$ be $n$ further numbers chosen such that all $n^{2}$ pairwise sums $x_{i}+y_{j}$ are nonzero. Consider the $n\times n$-matrix \[ C:=\left(…

Maximally complex Regge trajectories are introduced for which both Re $\alpha(s)$ and Im $\alpha(s)$ grow as $s^{1-\epsilon}$ ($\epsilon$ small and positive). Our expression reduces to the standard real linear form as the imaginary part…

We derive analytic solutions for the potential and field in a one-dimensional system of masses or charges with periodic boundary conditions, in other words Ewald sums for one dimension. We also provide a set of tools for exploring the…

We show that Boolean matrix multiplication, computed as a sum of products of column vectors with row vectors, is essentially the same as Warshall's algorithm for computing the transitive closure matrix of a graph from its adjacency matrix.…

We use vielbein bundle's horizontal lift path integral formulation and gauge theory's holonomy map to compactly describe parallel transport and geodesic equations on a manifold. This is first applied to the geometry of general relativistic…

Consider the following parameterized counting variation of the classic subset sum problem, which arises notably in the context of higher homotopy groups of topological spaces: Let $\mathbf{v} \in \mathbb{Q}^d$ be a rational vector, $(T_{1},…

Inverse optimal transport (OT) refers to the problem of learning the cost function for OT from observed transport plan or its samples. In this paper, we derive an unconstrained convex optimization formulation of the inverse OT problem,…

Let $M_n$ denote a random symmetric $n$ by $n$ matrix, whose upper diagonal entries are iid Bernoulli random variables (which take value -1 and 1 with probability 1/2). Improving the earlier result by Costello, Tao and Vu, we show that…

Computing optimal transport (OT) distances such as the earth mover's distance is a fundamental problem in machine learning, statistics, and computer vision. In this paper, we study the problem of approximating the general OT distance…

Optimal transport has recently started to be successfully employed to define misfit or loss functions in inverse problems. However, it is a problem intrinsically defined for positive (probability) measures and therefore strategies are…

In this paper we discuss the notion of reducibility for matrix weights and introduce a real vector space $\mathcal C_\mathbb{R}$ which encodes all information about the reducibility of $W$. In particular a weight $W$ reduces if and only if…

We prove a nonsmooth implicit function theorem applicable to the zero set of the difference of convex functions. This theorem is explicit and global: it gives a formula representing this zero set as a difference of convex functions which…

Handling an infinite number of inequality constraints in infinite-dimensional spaces occurs in many fields, from global optimization to optimal transport. These problems have been tackled individually in several previous articles through…