Related papers: The Minkowski Theorem for Max-plus Convex Sets

The faces of a convex set owe their relevance to an interplay between convexity and topology that is systematically studied in the work of Rockafellar. Infinite-dimensional convex sets are excluded from this theory as their relative…

Until now, the only known maximal surfaces in Minkowski 3-space of finite topology with compact singular set and without branch points were either genus zero or genus one, or came from a correspondence with minimal surfaces in Euclidean…

In this article a class of closed convex sets in the Euclidean $n$-space which are the convex hull of their profiles is described. Thus a generalization of Krein-Milman theorem\cite{Lay:1982} to a class of closed non-compact convex sets is…

In this paper we give an improved upper bound, as compared to the one given in [3] for the number of extreme points of the convex set of all G-invariant probability measures on X*Y with given marginals of full support.

We present a concise proof for the supporting hyperplane theorem. We then observe that the proof not only establishes the supporting hyperplane theorem but also extends it to a hyperplane separation theorem for certain non-convex sets. The…

In Lorentz-Minkowski space, we prove that the conjugate surface of a maximal graph over a convex domain is also a graph. We provide three proofs of this result that show a suitable correspondence between maximal surfaces in…

In this paper we introduce an enhanced notion of extremal systems for sets in locally convex topological vector spaces and obtain efficient conditions for set extremality in the convex case. Then we apply this machinery to deriving new…

The main result is a direct proof of the implication $(LVKF_{k,3})\Rightarrow( LT_{3k-1,3})$ below. Consider the following statements: ($LVKF_{1,3}$) From any 11 points in $ \mathbb{R}^{3}$ one can choose 3 pairwise disjoint triples whose…

We show that min-max minimal hypersurfaces can be localized. As a consequence, we obtain the sharp generalization to complete manifolds of the famous Almgren-Pitts min-max theorem in closed manifolds. We use this result to prove the…

Each convex combination of extreme points of a compact convex set represents a certain point of the convex set. Barycentric coordinates provide solutions to the inverse problem of expressing an element of a compact convex set as a convex…

Using an optimal containment approach, we quantify the asymmetry of convex bodies in $\mathbb{R}^n$ with respect to reflections across affine subspaces of a given dimension. We prove general inequalities relating these ''Minkowski…

We prove stability estimates for the Brunn-Minkowski inequality for convex sets. Unlike existing stability results, our estimates improve as the dimension grows. Our results are equivalent to a thin shell bound, which is one of the central…

The Brunn-Minkowski inequality, applicable to bounded measurable sets $A$ and $B$ in $\mathbb{R}^d$, states that $|A+B|^{1/d} \geq |A|^{1/d}+|B|^{1/d}$. Equality is achieved if and only if $A$ and $B$ are convex and homothetic sets in…

Given a compact convex domain $C\subset \mathbb{R}^k$ and bounded measurable functions $f_1,\ldots,f_n:C\to \mathbb{R}$, define the sup-convolution $(f_1\ast \ldots \ast f_n)(z)$ to be the supremum average value of…

In this paper we present a surprisingly short proof of Minkowski's second theorem. The author hopes there is no mistake in it, though the argument seems to be too plain to contain one. Also, we apply the main construction of the proof to…

In this paper we discuss a couple of observations related to polynomial convexity. More precisely, (i) We observe that the union of finitely many disjoint closed balls with centres in $\cup_{\theta\in[0,\pi/2]}e^{i\theta}V$ is polynomially…

Many works on inverse problems in the imaging sciences consider regularization via one or more penalty functions or constraint sets. When the models/images are not easily described using one or a few penalty functions/constraints, additive…

We propose a novel proof technique that can be applied to attack a broad class of problems in computational complexity, when switching the order of universal and existential quantifiers is helpful. Our approach combines the standard min-max…

Let $\beta_1,...,\beta_n$ be distinct points in the open unit disc in the complex plane, none of which is the origin, and let $H^1$ be the Hardy space. Define a closed convex set in $\mathbb{C}^{n}$ by $\Lambda = \{…

The Minkowski content of a compact set is a fine measure of its geometric scaling. For Lebesgue null sets it measures the decay of the Lebesgue measure of epsilon neighbourhoods of the set. It is well known that self-similar sets,…