Related papers: Extreme points of general transportation polytopes

We present a necessary and sufficient condition for a finite dimensional density matrix to be an extreme point of the convex set of density matrices with positive partial transpose with respect to a subsystem. We also give an algorithm for…

A transportation polytope consists of all multidimensional arrays or tables of non-negative real numbers that satisfy certain sum conditions on subsets of the entries. They arise naturally in optimization and statistics, and also have…

This article shows the existence of a class of closed bounded matrix convex sets which do not have absolute extreme points. The sets we consider are noncommutative sets, $K_X$, formed by taking matrix convex combinations of a single tuple…

This paper discusses properties of the graphs of 2-way and 3-way transportation polytopes, in particular, their possible numbers of vertices and their diameters. Our main results include a quadratic bound on the diameter of axial 3-way…

Let $ SM_n(\mathbb{R})^g$ denote $g$-tuples of $n \times n$ real symmetric matrices. Given tuples $X=(X_1, \dots, X_g) \in SM_{n_1}(\mathbb{R})^g$ and $Y=(Y_1, \dots, Y_g) \in SM_{n_2}(\mathbb{R})^g$, a matrix convex combination of $X$ and…

This paper is concerned with the extreme points of the polytopes of stochastic tensors. By a tensor we mean a multi-dimensional array over the real number field. A line-stochastic tensor is a nonnegative tensor in which the sum of all…

We give a characterization for the extreme points of the convex set of correlation matrices with a countable index set. A Hermitian matrix is called a correlation matrix if it is positive semidefinite with unit diagonal entries. Using the…

We prove an asymptotic estimate for the number of mxn non-negative integer matrices (contingency tables) with prescribed row and column sums and, more generally, for the number of integer feasible flows in a network. Similarly, we estimate…

This expository article gives a survey of matrix convex sets, a natural generalization of convex sets to the noncommutative (dimension-free) setting, with a focus on their extreme points. Mirroring the classical setting, extreme points play…

Convex or concave sequences of $n$ positive terms, viewed as vectors in $n$-space, constitute convex cones with $2n-2$ and $n$ extreme rays, respectively. Explicit description is given of vectors spanning these extreme rays, as well as of…

Two notions for linear maps (operational convex combinations and operational exetreme points) are introduced. The set S of ucp maps on the n times n matrix algebra is the operational convex combinations of the identity map. An operational…

We present a self-contained analysis of a particular family of metrics over the set of non-negative integers. We show that these metrics, which are defined through a nested sequence of optimal transport problems, provide tight estimates for…

Let R and S be two vectors of real numbers whose entries have the same sum. In the transportation problems one wishes to find a matrix A with row sum vector R and column sum vector S. If, in addition, the two vectors only contain…

In this paper, we investigate optimal (partial) transport problems for which the target is a non-convex polygonal domain in \(\mathbb{R}^2\). For the complete optimal transport problem, we prove that the singular set is locally a smooth…

This dissertation investigates the geometric combinatorics of convex polytopes and connections to the behavior of the simplex method for linear programming. We focus our attention on transportation polytopes, which are sets of all tables of…

We study the convex polytope of n x n stochastic matrices that define locally differentially private mechanisms. We first present invariance properties of the polytope and results reducing the number of constraints needed to define it. Our…

This paper connects discrete optimal transport to a certain class of multi-objective optimization problems. In both settings, the decision variables can be organized into a matrix. In the multi-objective problem, the notion of Pareto…

We consider a class of diffusion problems defined on simple graphs in which the populations at any two vertices may be averaged if they are connected by an edge. The diffusion polytope is the convex hull of the set of population vectors…

Consider the space $M_n^{nor}$ of square normal matrices $X=(x_{ij})$ over $\mathbb{R}\cup\{-\infty\}$, i.e., $-\infty\le x_{ij}\le0$ and $x_{ii}=0$. Endow $M_n^{nor}$ with the tropical sum $\oplus$ and multiplication $\odot$. Fix a real…

We give a useful new characterization of the set of all completely positive, trace-preserving (i.e., stochastic) maps from 2x2 matrices to 2x2 matrices. These conditions allow one to easily check any trace-preserving map for complete…