Related papers: Convexity and Cone-Vexing
In this paper we give a new proof of a theorem by Alexandrov on the Gauss curvature prescription of Euclidean convex sets. This proof is based on the duality theory of convex sets and on optimal mass transport. A noteworthy property of this…
Three results in p-convex geometry are established. First is the analogue of the Levi problem in several complex variables, namely: local p-convexity implies global p-convexity. The second asserts that the support of a minimal p-dimensional…
The Kantorovich distance is a widely used metric between probability distributions. The Kantorovich-Rubinstein duality states that it can be defined in two equivalent ways: as a supremum, based on non-expansive functions into [0, 1], and as…
The word "complexity" is most often used as a meta--linguistic expression referring to certain intuitive characteristics of a natural system and/or its scientific description. These characteristics may include: sheer amount of data that…
The Four-Vertex Theorem has been of interest ever since a discrete version appeared in 1813 due to Cauchy. Up until now, there have been many different versions of this theorem, both for discrete cases and smooth cases. In 2004, an approach…
This is the first part of our work on Zariski decomposition structures, where we study Zariski decompositions using Legendre-Fenchel type transforms. In this way we define a Zariski decomposition for curve classes. This decomposition…
Distance functions of metric spaces with lower curvature bound, by definition, enjoy various metric inequalities; triangle comparison, quadruple comparison and the inequality of Lang-Schroeder-Sturm. The purpose of this paper is to study…
The notion of approachability in repeated games with vector payoffs was introduced by Blackwell in the 1950s, along with geometric conditions for approachability and corresponding strategies that rely on computing {\em steering directions}…
Divergences are quantities that measure discrepancy between two probability distributions and play an important role in various fields such as statistics and machine learning. Divergences are non-negative and are equal to zero if and only…
We define, in the frame of an abstract Wiener space, the notions of convexity and of concavity for the equivalence classes of random variables. As application we show that some important inequalities of the finite dimensional case have…
The Four Vertex Theorem, one of the earliest results in global differential geometry, says that a simple closed curve in the plane, other than a circle, must have at least four "vertices", that is, at least four points where the curvature…
In the 1930's, Tarski introduced his plank problem at a time when the field discrete geometry was about to born. It is quite remarkable that Tarski's question and its variants continue to generate interest in the geometric as well as…
Two classical results characterizing regularity of a convergence space in terms of continuous extensions of maps on one hand, and in terms of continuity of limits for the continuous convergence on the other, are extended to…
Convexity is a key concept in information theory, namely via the many implications of Jensen's inequality, such as the non-negativity of the Kullback-Leibler divergence (KLD). Jensen's inequality also underlies the concept of Jensen-Shannon…
We study the observation congruences induced by rational polyhedral cones on vector-valued quantitative languages. The extreme rays of the dual cone define intrinsic covectors, and these covectors classify every incremental residual future…
In the variational cluster approximation (VCA) (or variational cluster perturbation theory), widely used to study the Hubbard model, a fundamental problem that renders variational solutions difficult in practice is its known lack of…
In this survey, we consider the sharp Sobolev inequality in convex cones. We also prove it by using the optimal transport technique. Then we present some results related to the Euler-Lagrange equation of the Sobolev inequality: the…
A longstanding problem in rigidity theory is to characterize the graphs which are minimally generically rigid in 3-space. The results of Cauchy, Dehn, and Alexandrov give one important class: the triangulated convex spheres, but there is an…
We show that a broad range of convex optimization algorithms, including alternating projection, operator splitting, and multiplier methods, can be systematically derived from the framework of subspace correction methods via convex duality.…
We study the relation between various notions of exterior convexity introduced in Bandyopadhyay-Dacorogna-Sil \cite{BDS1} with the classical notions of rank one convexity, quasiconvexity and polyconvexity. To this end, we introduce a…