相关论文: Embedding $S^n$ into $R^{n+1}$ with given integral…
In this article we obtain a nonlocal version of the Alexandrov Theorem which asserts that the only set with sufficiently smooth boundary and of constant nonlocal mean curvature is an Euclidean ball. We consider a general nonlocal mean…
A significant group of problems coming from the realm of Combinatorial Geometry can only be approached through the use of Algebraic Topology. From the first such application to Kneser's problem in 1978 by Lov% \'{a}sz \cite{Lovasz} through…
We present filling as a type of spatial subdivision problem similar to covering and packing. Filling addresses the optimal placement of overlapping objects lying entirely inside an arbitrary shape so as to cover the most interior volume. In…
Many classical problems in convex geometry can be cast as optimization problems under certain containment conditions. The arguably best-understood example is volume-maximization of convex bodies contained in other convex bodies, where the…
Motivated by the necessity to find exact solutions with the elliptic Weierstrass function of the Einstein's equations (see gr-qc/0105022),the present paper develops further the proposed approach in hep-th/0107231, concerning the s.c. cubic…
In this essay, we discuss the notion of optimal transport on geodesic measure spaces and the associated (2-)Wasserstein distance. We then examine displacement convexity of the entropy functional on the space of probability measures. In…
The dynamical formulation of optimal transport, also known as Benamou-Brenier formulation or Computational Fluid Dynamics formulation, amounts to write the optimal transport problem as the optimization of a convex functional under a PDE…
Classical H.Minkowski theorems on existence and uniqueness of convex polyhedra with prescribed directions and areas of faces as well as the well-known generalization of H.Minkowski uniqueness theorem due to A.D.Alexandrov are extended to a…
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 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…
We introduce a new second order stochastic algorithm to estimate the entropically regularized optimal transport cost between two probability measures. The source measure can be arbitrary chosen, either absolutely continuous or discrete,…
During recent decades, there has been a substantial development in optimal mass transport theory and methods. In this work, we consider multi-marginal problems wherein only partial information of each marginal is available, which is a setup…
We establish estimates for the asymptotic best approximation of the Euclidean unit ball by polytopes under a notion of distance induced by the intrinsic volumes. We also introduce a notion of distance between convex bodies that is induced…
The optimal transport problem is studied in the context of Lorentz-Finsler geometry. For globally hyperbolic Lorentz-Finsler spacetimes the first Kantorovich problem and the Monge problem are solved. Further the intermediate regularity of…
Bernstein problem for affine maximal type equation has been a core problem in affine geometry. A conjecture proposed firstly by Chern for entire graph and then extended by Trudinger-Wang to its fully generality asserts that any Euclidean…
We start with a discussion on Alexander invariants, and then prove some general results concerning the divisibility of the Alexander polynomials and the supports of the Alexander modules, via Artin's vanishing theorem for perverse sheaves.…
This article focuses on the problem of analytically determining the optimal placement of five points on the unit sphere $\mathbb{S}^2$ so that the surface area of the convex hull of the points is maximized. It is shown that the optimal…
In an Euclidean $d$-space, the container problem asks to pack $n$ equally sized spheres into a minimal dilate of a fixed container. If the container is a smooth convex body and $d\geq 2$ we show that solutions to the container problem can…
In both real and complex cases, we establish the connection of the problem about $2$-dimensional linear subspaces the most deviating from the coordinate ones with one simply formulated optimization problem for isoperimetric polygons in…
For the curved n-body problem in S^3, we show that a regular polygonal configuration for n masses on a geodesic is an equilibrium configuration if and only if n is odd and the masses are equal. The equilibrium configuration is associated…