相关论文: The Minkowski Theorem for Max-plus Convex Sets

The aim of this paper is twofold. On one hand the generalized Minkowski sets are defined and characterized. On the other hand, the Motzkin decomposable sets, along with their epigraphic versions are considered and characterized in new ways.…

A planar point set is in convex position precisely when it has a convex polygonization, that is, a polygonization with maximum interior angle measure at most \pi. We can thus talk about the convexity of a set of points in terms of the…

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…

We study the max-plus or tropical analogue of the notion of polar: the polar of a cone represents the set of linear inequalities satisfied by its elements. We establish an analogue of the bipolar theorem, which characterizes all the…

This article derives closed-form parametric formulas for the Minkowski sums of convex bodies in d-dimensional Euclidean space with boundaries that are smooth and have all positive sectional curvatures at every point. Under these conditions,…

Matrix convexity generalizes convexity to the dimension free setting and has connections to many mathematical and applied pursuits including operator theory, quantum information, noncommutative optimization, and linear control systems. In…

We consider the problem of lower bounding a generalized Minkowski measure of subsets of a convex body with a log-concave probability measure, conditioned on the set size. A bound is given in terms of diameter and set size, which is sharp…

In this article we carry out a detailed investigation of the geometric nature of the points at infinity of Minkowski superspace. It turns out that there are several sets of points forming the superconformal boundary of Minkowski superspace:…

In this paper we explore questions regarding the Minkowski sum of the boundaries of convex sets. Motivated by a question suggested to us by V.~Milman regarding the volume of $\partial K+ \partial T$ where $K$ and $T$ are convex bodies, we…

A nonempty closed convex set in ${\mathbb R}^n$, not containing the origin, is called a pseudo-cone if with every $x$ it also contains $\lambda x$ for $x\ge 1$. We consider pseudo-cones with a given recession cone $C$, called…

In this paper, combining the covolume, we study the Minkowski theory for the non-compact convex set with an asymptotic boundary condition. In particular, the mixed covolume of two non-compact convex sets is introduced and its geometric…

The central focus of this paper is the $L_p$ dual Minkowski problem for $C$-compatible sets, where $C$ is a pointed closed convex cone in $\mathbb{R}^n$ with nonempty interior. Such a problem deals with the characterization of the $(p,…

The $L_p$-Minkowski problem deals with the existence of closed convex hypersurfaces in $\mathbb{R}^{n+1}$ with prescribed $p$-area measures. It extends the classical Minkowski problem and embraces several important geometric and physical…

The Minkowski problem for a class of unbounded closed convex sets is considered. This is equivalent to a Monge-Amp\`ere equation on a bounded convex open domain with possibly non-integrable given data. A complete solution (necessary and…

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…

This article shows the existence of a class of closed bounded matrix convex sets which do not have absolute extreme points. The sets we consider are noncommutative sets, $K_X$, formed by taking matrix convex combinations of a single tuple…

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…

The Shapley-Folkman theorem shows that Minkowski averages of uniformly bounded sets tend to be convex when the number of terms in the sum becomes much larger than the ambient dimension. In optimization, Aubin and Ekeland [1976] show that…

For a Minkowski centered convex compact set $K$ we define $\alpha(K)$ to be the smallest possible factor to cover $K \cap (-K)$ by a rescalation of $\mathrm{conv} (K\cup (-K))$ and give a complete description of the possible values of…

The main purpose of this note is to prove an upper bound on the number of lattice points of a centrally symmetric convex body in terms of the successive minima of the body. This bound improves on former bounds and narrows the gap towards a…