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

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…

Motivated by the Maximum Theorem for convex functions (in the setting of linear spaces) and for subadditive functions (in the setting of Abelian semigroups), we establish a Maximum Theorem for the class of generalized convex functions,…

We establish a new notion of tropical convexity for signed tropical numbers. We provide several equivalent descriptions involving balance relations and intersections of open halfspaces as well as the image of a union of polytopes over…

Any maximal monotone operator can be characterized by a convex function. The family of such convex functions is invariant under a transformation connected with the Fenchel-Legendre conjugation. We prove that there exist a convex…

We present a natural reverse Minkowski-type inequality for lattices, which gives upper bounds on the number of lattice points in a Euclidean ball in terms of sublattice determinants, and conjecture its optimal form. The conjecture exhibits…

We study separation of a closed box from a max-min convex set by max-min semispace. This can be regarded as an interval extension of known separation results. We give a constructive proof of the separation in the case when the box and the…

This expository article gives a survey of matrix convex sets, a natural generalization of convex sets to the noncommutative (dimension-free) setting, with a focus on their extreme points. Mirroring the classical setting, extreme points play…

The Max-Cut polytope appears in the formulation of many difficult combinatorial optimization problems. These problems can also be formulated as optimization problems over the so-called trigonometric approximation which possesses an…

We develop a max-plus spectral theory for infinite matrices. We introduce recurrence and tightness conditions, under which many results of the finite dimensional theory, concerning the representation of eigenvectors and the asymptotic…

We prove that, in Minkowski space, if a spacelike, $(n-1)$-convex hypersurface $M$ with constant $\sigma_{n-1}$ curvature has bounded principal curvatures, then $M$ is convex. Moreover, if $M$ is not strictly convex, after an…

Let L be a compact convex set in R^n, and let 1 <= d <= n-1. The set L is defined to be d-decomposable if L is a direct Minkowski sum (affine Cartesian product) of two or more convex bodies each of dimension at most d. A compact convex set…

We study the topology of the space $\d\K^n$ of complete convex hypersurfaces of $\R^n$ which are homeomorphic to $\R^{n-1}$. In particular, using Minkowski sums, we construct a deformation retraction of $\d\K^n$ onto the Grassmannian space…

It is known that in the Minkowski sum of $r$ polytopes in dimension $d$, with $r<d$, the number of vertices of the sum can potentially be as high as the product of the number of vertices in each summand. However, the number of vertices for…

We study the relationship between min-plus, max-plus and Euclidean convexity for subsets of $\mathbb{R}^n$. We introduce a construction which associates to any max-plus convex set with compact projectivisation a canonical matrix called its…

We introduce moment maps for continuous unitary representations of general topological groups. For solvable separable locally compact groups, we prove that the closure of the image of the moment map of any representation is convex.

We study $\mathbb{R}^2\oplus\mathbb{R}$-separately convex hulls of finite sets of points in $\mathbb{R}^3$, as in KirchheimMullerSverak2003. This notion of convexity, which we call $2+1$ convexity, corresponds to rank-one convex convexity,…

Minkowski sums are of theoretical interest and have applications in fields related to industrial backgrounds. In this paper we focus on the specific case of summing polytopes as we want to solve the tolerance analysis problem described in…

In this paper the problem of maximizing the distance to a given fixed point over an intersection of balls is considered. It is known that this problem is NP complete in the general case, since any subset sum problem can be solved upon…

The notion of max-plus convex subset of Euclidean space can be naturally extended to other linear spaces. The aim of this paper is to describe the topology of hyperspaces of max-plus convex subsets of Tychonov powers $\mathbb R^\tau$ of the…

The present work considers the properties of generally convex sets in the $n$-dimensional real Euclidean space $\mathbb{R}^n$, $n>1$, known as weakly $m$-convex, $m=1,2,\ldots,n-1$. An open set of $\mathbb{R}^n$ is called weakly $m$-convex…