Related papers: Inclusion-exclusion principles for convex hulls an…

We prove an exponential deviation inequality for the convex hull of a finite sample of i.i.d. random points with a density supported on an arbitrary convex body in $\R^d$, $d\geq 2$. When the density is uniform, our result yields rate…

While it is well known from examples that no interesting `halfspace theorem' holds for properly immersed complete $n$-dimensional self-translating mean curvature flow solitons in Euclidean space $\mathbb{R}^{n+1}$, we show that they must…

The convex hulls of face-vertex incident vectors of 3-face-colorable convex polytopes are computed. It is found that every such convex hull is a $d$-polytope with $d+2$ or $d+3$ vertices. Utilizing Gale transform and Gale diagram, we…

Several results concerning pairs of polynomially convex sets whose union is not even rationally convex are given. It is shown that there is no restriction on how two spaces can be embedded in some $\C^N$ so as to be polynomially convex but…

With the goal of obtaining strong relaxations for binary polynomial optimization problems, we introduce the pseudo-Boolean polytope defined as the convex hull of the set of binary points satisfying a collection of equations containing…

Let $V$ be a complex linear space, $G\subset\GL(V)$ be a compact group. We consider the problem of description of polynomial hulls $\wh{Gv}$ for orbits $Gv$, $v\in V$, assuming that the identity component of $G$ is a torus $T$. The paper…

We study random polytopes of the form $[X_1,\ldots,X_n]$ defined as convex hulls of independent and identically distributed random points $X_1,\ldots,X_n$ in $\mathbb{R}^d$ with one of the following densities: $$ f_{d,\beta} (x) =…

A convex partition of a point set P in the plane is a planar partition of the convex hull of P with empty convex polygons or internal faces whose extreme points belong to P. In a convex partition, the union of the internal faces give the…

It is shown that there exist arcs and simple closed curves in ${\mathbb C}^3$ with nontrivial polynomial hulls that contain no analytic discs. It is also shown that in any bounded Runge domain of holomorphy in ${\mathbb C}^N$ ($N \geq 2$)…

Computing the convex hull of a planar $n$-point set $P$ is one of the most fundamental problems in computational geometry. It has an $\Omega(n \log n)$ lower bound in the algebraic computation tree model, and many convex hull algorithms…

We shall deal with both the barotropic and the full compressible Euler system in multiple space dimensions. Both systems are particular examples of hyperbolic conservation laws. Whereas for scalar conservation laws there exists a well-known…

We consider the problem of characterizing the convex hull of the graph of a bilinear function $f$ on the $n$-dimensional unit cube $[0,1]^n$. Extended formulations for this convex hull are obtained by taking subsets of the facets of the…

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…

Indices of singular points of a vector field or of a 1-form on a smooth manifold are closely related with the Euler characteristic through the classical Poincar\'e--Hopf theorem. Generalized Euler characteristics (additive topological…

We derive a closed form description of the convex hull of mixed-integer bilinear covering set with bounds on the integer variables. This convex hull description is determined by considering some orthogonal disjunctive sets defined in a…

The type C_n full root polytope is the convex hull in R^n of the origin and the points e_i-e_j, e_i+e_j, 2e_k for 1 <= i < j <= n, k \in [n]. Given a graph G, with edges labeled positive or negative, associate to each edge e of G a vector…

As appropriate generalizations of convex combinations with uncountably many terms, we introduce the so-called Choquet combinations, Choquet decompositions and Choquet convex decompositions, as well as their corresponding hull operators…

We consider the convex quadratic optimization problem with indicator variables and arbitrary constraints on the indicators. We show that a convex hull description of the associated mixed-integer set in an extended space with a quadratic…

We present the multidimensional versions of the Pleijel and Ambartzumian--Pleijel identities. We also obtain the generalization of both the Blaschke--Petkantschin and Z\"ahle formulae considering the case when some points are chosen inside…

Let $P$ be a set of $n$ points in the plane. We consider a variation of the classical Erd\H{o}s-Szekeres problem, presenting efficient algorithms with $O(n^3)$ running time and $O(n^2)$ space complexity that compute: (1) A subset $S$ of $P$…