Related papers: On the discrete logarithmic Minkowski problem in t…
We consider the convex hull of a finite sample of i.i.d. points uniformly distributed in a convex body in $\R^d$, $d\geq 2$. We prove an exponential deviation inequality, which leads to rate optimal upper bounds on all the moments of the…
We prove that the combinatorial optimization problem of determining the hull number of a partial cube is NP-complete. This makes partial cubes the minimal graph class for which NP-completeness of this problem is known and improves some…
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,…
It is shown that, given a point $x\in\mathbbm{R}^d$, $d\ge 2$, and open sets $U_1,...,U_k$ containing $x$, any convex combination of the harmonic measures for $x$ with respect to $U_n$, $1\le n\le k$, is the limit of a sequence of harmonic…
The Minkowski problem for electrostatic capacity characterizes measures generated by electrostatic capacity, which is a well-known variant of the Minkowski problem. This problem has been generalized to $L_p$ Minkowski problem for…
We prove a sharp stability result concerning how close homothetic sets attaining near-equality in the Brunn-Minkowski inequality are to being convex. In particular, resolving a conjecture of Figalli and Jerison, we show there are universal…
The Brunn-Minkowski theory in convex geometry concerns, among other things, the volumes, mixed volumes, and surface area measures of convex bodies. We study generalizations of these concepts to Borel measures with density in…
We introduce the M-representation of polytopes, which makes it possible to compute linear transformations, convex hulls, and Minkowski sums with linear complexity in the dimension of the polytopes. When the polytope is a convex hull of a…
General results on convex bodies are reviewed and used to derive an exact closed-form parametric formula for the Minkowski sum boundary of $m$ arbitrary ellipsoids in $N$-dimensional Euclidean space. Expressions for the principal curvatures…
A quadratically constrained quadratic program (QCQP) is an optimization problem in which the objective function is a quadratic function and the feasible region is defined by quadratic constraints. Solving non-convex QCQP to global…
We study a natural extension to the well-known convex hull problem by introducing multiplicity: if we are given a set of convex polygons, and we are allowed to partition the set into multiple components and take the convex hull of each…
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, we propose a resolvent of an equilibrium problem in a geodesic space with negative curvature having the convex hull finite property. We prove its well-definedness as a single-valued mapping whose domain is whole space, and…
Arithmetic automata recognize infinite words of digits denoting decompositions of real and integer vectors. These automata are known expressive and efficient enough to represent the whole set of solutions of complex linear constraints…
In this paper we shall discuss local polynomial convexity at the origin of the union of finitely many totally-real planes through $0 \in\mathbb{C}^2$. The planes, say $P_0,..., P_N$, satisfy a mild transversality condition that enables us…
We show that the cone-volume measure of a convex body with centroid at the origin satisfies the subspace concentration condition. This implies, among others, a conjectured best possible inequality for the $\mathrm{U}$-functional of a convex…
We prove three results in this paper. First, we prove for a wide class of functions $\varphi\in C^2(\mathbb{S}^{n-1})$ and $\psi(X, \nu)\in C^2(\mathbb{R}^{n+1}\times\mathbb{H}^n),$ there exists a unique, entire, strictly convex, spacelike…
$\mathbb B$-convexity was defined in [7] as a suitable Kuratowski-Painlev\'e upper limit of linear convexities over a finite dimensional Euclidean vector space. Excepted in the special case where convex sets are subsets of $\mathbb R^n_ +$,…
We study the convex-hull problem in a probabilistic setting, motivated by the need to handle data uncertainty inherent in many applications, including sensor databases, location-based services and computer vision. In our framework, the…
We prove a conjecture of Toponogov on complete convex planes, namely that such planes must contain an umbilic point, albeit at infinity. Our proof is indirect. It uses Fredholm regularity of an associated Riemann-Hilbert boundary value…