Related papers: Note on Minkowski Summation and Unimodularity in D…
This work introduces two new notions of dimension, namely the unimodular Minkowski and Hausdorff dimensions, which are inspired from the classical analogous notions. These dimensions are defined for unimodular discrete spaces, introduced in…
New Orlicz Brunn-Minkowski inequalities are established for rigid motion compatible Minkowski valuations of arbitrary degree. These extend classical log-concavity properties of intrinsic volumes and generalize seminal results of Lutwak and…
The Shapley-Folkman theorem is a statement about the Minkowski sum of (non-convex) sets, expressing the closeness of the Minkowski sum to convexity in a quantitative manner. This paper establishes similar theorems for integrally convex…
We present an alternative, short proof of a recent discrete version of the Brunn-Minkowski inequality due to Lehec and the second named author. Our proof also yields the four functions theorem of Ahlswede and Daykin as well as some new…
This paper describes the theory of Minkowski problems for geometric measures in convex geometric analysis. The theory goes back to Minkowski and Aleksandrov and has been developed extensively in recent years. The paper surveys classical and…
The concept of convex compactness, weaker than the classical notion of compactness, is introduced and discussed. It is shown that a large class of convex subsets of topological vector spaces shares this property and that is can be used in…
We give an alternative proof for discrete Brunn-Minkowski type inequalities, recently obtained by Halikias, Klartag and the author. This proof also implies somewhat stronger weighted versions of these inequalities. Our approach generalizes…
The projector onto the Minkowski sum of closed convex sets is generally not equal to the sum of individual projectors. In this work, we provide a complete answer to the question of characterizing the instances where such an equality holds.…
In this paper, we study convex analysis and its theoretical applications. We first apply important tools of convex analysis to Optimization and to Analysis. We then show various deep applications of convex analysis and especially infimal…
For a collection of convex bodies $P_1,\dots,P_n \subset \mathbb{R}^d$ containing the origin, a Minkowski complex is given by those subsets whose Minkowski sum does not contain a fixed basepoint. Every simplicial complex can be realized as…
We present an alternative proof of Sanov's theorem for Polish spaces in the weak topology that follows via discretization arguments. We combine the simpler version of Sanov's Theorem for discrete finite spaces and well chosen finite…
This paper introduces a new subtraction operation for convex sets, which defines their difference as a collection of inclusion-minimal convex sets with appropriate definitions of linear operations on them. With these operations the set of…
Convexity is an important notion in non linear optimization theory as well as in infinite dimensional functional analysis. As will be seen below, very simple and powerful tools will be derived from elementary duality arguments (which are…
This paper gives two different proofs to a structural theorem of decreasing minimization (lexicographic optimization) on integrally convex sets. The theorem states that the set of decreasingly minimal elements of an integrally convex set…
We establish a finite-dimensional version of the Arveson-Stinespring dilation theorem for unital completely positive maps on operator systems. This result can be seen as a general principle to deduce finite-dimensional dilation theorems…
In this short survey we want to present some of the impact of Minkowski's successive minima within Convex and Discrete Geometry. Originally related to the volume of an $o$-symmetric convex body, we point out relations of the successive…
A quantitative version of Minkowski sum, extending the definition of $\theta$-convolution of convex bodies, is studied to obtain extensions of the Brunn-Minkowski and Zhang inequalities, as well as, other interesting properties on Convex…
A complete classification of continuous, dually epi-translation invariant, and rotation equivariant valuations on convex functions is established. This characterizes the recently introduced functional Minkowski vectors, which naturally…
One of the most fruitful results from Minkowski's geometric viewpoint on number theory is his so called 1st Fundamental Theorem. It provides an optimal upper bound for the volume of an o-symmetric convex body whose only interior lattice…
This is a chapter (planned to appear in Wiley's upcoming Encyclopedia of Operations Research and Management Science) describing parts of the theory of convex polyhedra that are particularly important for optimization. The topics include…