相关论文: The structure and normalized volume of Monge polyt…

We construct a certain $\F_2$-valued analogue of the mixed volume of lattice polytopes. This 2-mixed volume cannot be defined as a polarization of any kind of an additive measure, or characterized by any kind of its monotonicity properties,…

We study the harmonic polytope, which arose in Ardila, Denham, and Huh's work on the Lagrangian geometry of matroids. We describe its combinatorial structure, showing that it is a $(2n-2)$-dimensional polytope with…

We present a simple proof of the fact that the base (and independence) polytope of a rank $n$ regular matroid over $m$ elements has an extension complexity $O(mn)$.

Symmetric Monge-Kantorovich transport problems involving a cost function given by a family of vector fields were used by Ghoussoub-Moameni to establish polar decompositions of such vector fields into $m$-cyclically monotone maps composed…

Volume polynomials form a distinguished class of log-concave polynomials with remarkable analytic and combinatorial properties. I will survey realization problems related to them, review fundamental inequalities they satisfy, and discuss…

A fundamental concept in optimal transport is c-cyclical monotonicity: it allows to link the optimality of transport plans to the geometry of their support sets. Recently, related concepts have been successfully applied in the…

We study the Monge--Kantorovich problem with one-dimensional marginals $\mu$ and $\nu$ and the cost function $c = \min\{l_1, \ldots, l_n\}$ that equals the minimum of a finite number $n$ of affine functions $l_i$ satisfying certain…

Completing a data matrix X has become an ubiquitous problem in modern data science, with applications in recommender systems, computer vision, and networks inference, to name a few. One typical assumption is that X is low-rank. A more…

The existence and multiplicity and nonexistence of nontrivial radial convex solutions of systems of Monge-Amp\`ere equations are established with superlinearity or sublinearity assumptions for an appropriately chosen parameter. The proof of…

Combinatorial mixed valuations associated to translation-invariant valuations on polytopes are introduced. In contrast to the construction of mixed valuations via polarization, combinatorial mixed valuations reflect and often inherit…

We propose deep learning methods for classical Monge's optimal mass transportation problems, where where the distribution constraint is treated as penalty terms defined by the maximum mean discrepancy in the theory of Hilbert space…

If $\mathbb{F}$ is an ordered field and $M$ is a finite-rank torsion-free monoid, then one can embed $M$ into a finite-dimensional vector space over $\mathbb{F}$ via the inclusion $M \hookrightarrow \text{gp}(M) \hookrightarrow \mathbb{F}…

We introduce the property of convex normality of rational polytopes and give a dimensionally uniform lower bound for the edge lattice lengths, guaranteeing the property. As an application, we show that if every edge of a lattice d-polytope…

We study a combinatorial notion where given a set of lattice points one takes the set of all sums of subsets of a fixed size, and we ask if the given set comes from a convex lattice polytope whether the resulting set also comes from a…

A (bounded) manifold of circular type is a complex manifold M of dimension n admitting a (bounded) exhaustive real function u, defined on M minus a point x_o, so that: a) it is a smooth solution on $M\setminus {x_o}$ to the Monge-Amp\`ere…

The multistsochastic Monge--Kantorovich problem on the product $X = \prod_{i=1}^n X_i$ of $n$ spaces is a generalization of the multimarginal Monge--Kantorovich problem. For a given integer number $1 \le k<n$ we consider the minimization…

Let $X$ be a finite set in $Z^d$. We consider the problem of optimizing linear function $f(x) = c^T x$ on $X$, where $c\in Z^d$ is an input vector. We call it a problem $X$. A problem $X$ is related with linear program $\max\limits_{x \in…

The hamiltonian circuit polytope is the convex hull of feasible solutions for the circuit constraint, which provides a succinct formulation of the traveling salesman and other sequencing problems. We study the polytope by establishing its…

We present a general method, based on conjugate duality, for solving a convex minimization problem without assuming unnecessary topological restrictions on the constraint set. It leads to dual equalities and characterizations of the…

We prove that $c$-cyclically monotone transport plans $\pi$ optimize the Monge-Kantorovich transportation problem under an additional measurability condition. This measurability condition is always satisfied for finitely valued, lower…