Related papers: The structure and normalized volume of Monge polyt…
The objective of this paper is to present two types of results on Minkowski sums of convex polytopes. The first is about a special class of polytopes we call perfectly centered and the combinatorial properties of the Minkowski sum with…
The state space of an operator system of $n$-by-$n$ matrices has, in a sense, many normal cones. Merely this convex geometrical property implies smoothness qualities and a clustering property of exposed faces. The latter holds since each…
In this article we describe cell decompositions of the moduli space of Riemann surfaces and their relationship to a Hurwitz problem. The cells possess natural linear structures and with respect to this they can be described as rational…
Transportation matrices are $m\times n$ non-negative matrices whose row sums and row columns are equal to, or dominated above with given integral vectors $R$ and $C$. Those matrices belong to a convex polytope whose extreme points have been…
A shape of a combinatorial polytope is a convex embedding into Euclidean space. We provide necessary and sufficient conditions for a piecewise linear map between two shapes of the same polytope to be a compression (respectively a weak…
Let $\rho$ be a metric on the set $X=\{1,2,\dots,n+1\}$. Consider the $n$-dimensional polytope of functions $f:X\rightarrow \mathbb{R}$, which satisfy the conditions $f(n+1)=0$, $|f(x)-f(y)|\leq \rho(x,y)$. The question on classifying…
This paper studies Monge parameterization, or differential flatness, of control-affine systems with four states and twocontrols. Some of them are known to be flat, and this implies admitting a Monge parameterization. Focusing on systems…
In its most general form, the optimal transport problem is an infinite-dimensional optimization problem, yet certain notable instances admit closed-form solutions. We identify the common source of this tractability as \textit{symmetry} and…
In optimal transport, quadratic regularization is a sparse alternative to entropic regularization: the solution measure tends to have small support. Computational experience suggests that the support decreases monotonically to the…
In this paper, we study the simplex faces of the order polytope $\mathcal{O}(P)$ and the chain polytope $\mathcal{C}(P)$ of a finite poset $P$. We show that, if $P$ can be recursively constructed from $\mathbf{X}$-free posets using disjoint…
Orthogonal surfaces are nice mathematical objects which have interesting connections to various fields, e.g., integer programming, monomial ideals and order dimension. While orthogonal surfaces in one or two dimensions are rather trivial…
We rephrase Monge's optimal transportation (OT) problem with quadratic cost--via a Monge-Amp\`ere equation--as an infinite-dimensional optimization problem, which is in fact a convex problem when the target is a log-concave measure with…
The paper is devoted to a study of the cone $\cop$ of copositive matrices. Based on the known from semi-infinite optimization concept of immobile indices, we define zero and minimal zero vectors of a subset of the cone $\cop$ and use them…
We express the matroid polytope $P_M$ of a matroid $M$ as a signed Minkowski sum of simplices, and obtain a formula for the volume of $P_M$. This gives a combinatorial expression for the degree of an arbitrary torus orbit closure in the…
This paper shows that the semi-dual formulation of the optimal transport problem has a degenerate saddle-point structure, and that its numerical solution is equivalent to solving a constrained optimization problem. We derive necessary and…
It is possible to write the indicator function of any matroid polytope as an integer combination of indicator functions of Schubert matroid polytopes. In this way, every matroid on $n$ elements of rank $r$ can be thought of as a lattice…
A permutation polytope is the convex hull of a group of permutation matrices. In this paper we investigate the combinatorics of permutation polytopes and their faces. As applications we completely classify permutation polytopes in…
A bimatroid is a matroid-like generalization of the collection of regular minors of a matrix. In this article, we use the theory of Lorentzian polynomials to study the logarithmic concavity of natural sequences associated to bimatroids.…
We prove the existence of an optimal map for the Monge problem when the cost is a supercritical Mane potential on a compact manifold. Supercritical Mane potentials form a class of costs which generalize the Riemannian distances. We describe…
We address the collective matrix completion problem of jointly recovering a collection of matrices with shared structure from partial (and potentially noisy) observations. To ensure well--posedness of the problem, we impose a joint low rank…