Related papers: Polynomial hulls and an optimization problem
We discuss the relation between pluripolar hulls and fine analytic structure. Our main result is the following. For each non polar subset $S$ of the complex plane $\mathbb C$ we prove that there exists a pluripolar set $E \subset (S \times…
We present a characterization, in terms of projective biduality, for the hypersurfaces appearing in the boundary of the convex hull of a compact real algebraic variety.
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,…
The convex hull of N independent random points chosen on the boundary of a simple polytope in R^n is investigated. Asymptotic formulas for the expected number of vertices and facets, and for the expectation of the volume difference are…
We show that the closed convex hull of any one-dimensional semi-algebraic subset of R^n has a semidefinite representation, meaning that it can be written as a linear projection of the solution set of some linear matrix inequality. This is…
Extensions of the notions of polynomially and rationally convex hulls are introduced. Using these notions, a generalization of a result of Duval and Levenberg on polynomially convex hulls containing no analytic discs is presented. As a…
We review several (and provide new) results on the theory of moments, sums of squares and basic semi-algebraic sets when convexity is present. In particular, we show that under convexity, the hierarchy of semidefinite relaxations for…
High proved the following theorem. If the intersections of any two congruent copies of a plane convex body are centrally symmetric, then this body is a circle. In our paper we extend the theorem of High to the sphere and the hyperbolic…
A set-system $S\subseteq \{0,1\}^n$ is cube-ideal if its convex hull can be described by capacity and generalized set covering inequalities. In this paper, we use combinatorics, convex geometry, and polyhedral theory to give exponential…
It is shown how the Beneath-and-Beyond algorithm can be used to yield another proof of the equivalence of V- and H-representations of convex polytopes. In this sense this paper serves as the sketch of an introduction to polytope theory with…
In this research paper, the problem of optimization of a quadratic form over the convex hull generated by the corners of hypercube is attempted and solved. It is reasoned that under some conditions, the optimum occurs at the corners of…
In this article we prove a conjecture of Bezdek, Brass, and Harborth concerning the maximum volume of the convex hull of any facet-to-facet connected system of n unit hypercubes in the d-dimensional Euclidean space. For d=2 we enumerate the…
Given a 2-sheeted torus over the circle with winding number 1, we prove that its polynomial hull is a union of 2-sheeted holomorphic discs. Moreover when the hull is non degenerate its boundary is a Levi-flat solid torus foliated by such…
Motivated by the desire to cope with data imprecision, we study methods for taking advantage of preliminary information about point sets in order to speed up the computation of certain structures associated with them. In particular, we…
In this work we prove constructively that the complement ${\mathbb R}^n\setminus{\mathcal K}$ of an $n$-dimensional unbounded convex polyhedron ${\mathcal K}\subset{\mathbb R}^n$ and the complement ${\mathbb R}^n\setminus{\rm Int}({\mathcal…
Let $K \subseteq \mathbb{R}^{2 \times 2}$ be a compact set, let $K^{rc}$ be its rank-one convex hull, and let $L(K)$ be its lamination convex hull. It is shown that the mapping $K \to \overline{L(K)}$ is not upper semicontinuous on the…
The hamiltonian circuit polytope is the convex hull of feasible solutions for the circuit constraint, which provides a succinct formulation of the traveling salesman and other sequencing problems. We study the polytope by establishing its…
We discuss local polynomial convexity of real analytic Levi-flat hypersurfaces in $\mathbb C^n$, $n>1$, near singular points.
In this article, we survey the primary research on polyhedral computing methods for constrained linear control systems. Our focus is on the modeling power of convex optimization, featured to design set-based robust and optimal controllers.…
In this paper we study the problem of calculating the convex hull of certain affine algebraic varieties. As we explain, the motivation for considering this problem is that certain pure-state measures of quantum entanglement, which we call…