Related papers: Terracini Convexity
The class of convex sets that admit approximations as Minkowski sum of a compact convex set and a closed convex cone in the Hausdorff distance is introduced. These sets are called approximately Motzkin-decomposable and generalize the notion…
Spectrahedra are linear sections of the cone of positive semidefinite matrices that, as convex bodies, generalize the class of polyhedra. In this paper we investigate the problem of recognizing when a spectrahedron is polyhedral. We reprove…
For each closed orientable surface we introduce a simplical complex with some additional structure which is a version of the complex of curves of this surface adjusted to investigation of its Torelli group. We call this complex the Torelli…
A novel approach is introduced to a very widely occurring problem, providing a complete, explicit resolution of it: minimisation of a convex quadratic under a general quadratic, equality or inequality, constraint. Completeness comes via…
The problem of minimizing a (nonconvex) quadratic form over the unit simplex, referred to as a standard quadratic program, admits an exact convex conic formulation over the computationally intractable cone of completely positive matrices.…
We construct, for any positive integer n, a family of n congruent convex polyhedra in R^3, such that every pair intersects in a common facet. Previously, the largest such family contained only eight polytopes. Our polyhedra are Voronoi…
A convex geometry is a closure space satisfying the anti-exchange axiom. For several types of algebraic convex geometries we describe when the collection of closed sets is order scattered, in terms of obstructions to the semilattice of…
Polytopes are the basic finite data structures for convex sets: they appear as feasible regions in linear optimization, as geometric summaries in algorithms, and as random objects in stochastic geometry. A natural geometric question is…
Variational analysis presents a unified theory encompassing in particular both smoothness and convexity. In a Euclidean space, convex sets and smooth manifolds both have straightforward local geometry. However, in the most basic hybrid case…
We investigate the symmetric inverse M-matrix problem from a geometric perspective. The central question in this geometric context is, which conditions on the k-dimensional facets of an n-simplex S guarantee that S has no obtuse dihedral…
Polygons are described as almost-convex if their perimeter differs from the perimeter of their minimum bounding rectangle by twice their `concavity index', $m$. Such polygons are called \emph{$m$-convex} polygons and are characterised by…
We generalize an inequality for convex lattice polygons -- aka toric surfaces -- to general rational surfaces.
Any solid object can be decomposed into a collection of convex polytopes (in short, convexes). When a small number of convexes are used, such a decomposition can be thought of as a piece-wise approximation of the geometry. This…
Tutte's embedding theorem states that every 3-connected graph without a $K_5$ or $K_{3,3}$ minor (i.e. a planar graph) is embedded in the plane if the outer face is in convex position and the interior vertices are convex combinations of…
Three results in p-convex geometry are established. First is the analogue of the Levi problem in several complex variables, namely: local p-convexity implies global p-convexity. The second asserts that the support of a minimal p-dimensional…
We prove a rigidity result for Serrin's overdetermined problem in a cone that is contained in a half-space in arbitrary dimensions. In the special case where the cone is an epigraph, this result was shown previously in low dimensions with a…
The Generalized Lax Conjecture asks whether every hyperbolicity cone is a section of a semidefinite cone of sufficiently high dimension. We prove that the space of hyperbolicity cones of hyperbolic polynomials of degree $d$ in $n$ variables…
The aim of this paper is to present some properties of reduced spherical convex bodies on the two-dimensional sphere $S^2$. The intersection of two different non-opposite hemispheres is called a lune. By its thickness we mean the distance…
The convex and metric structures underlying probabilistic physical theories are generally described in terms of base normed vector spaces. According to a recent proposal, the purely geometrical features of these spaces are appropriately…
In this work we study convex relaxations of quadratic optimisation problems over permutation matrices. While existing semidefinite programming approaches can achieve remarkably tight relaxations, they have the strong disadvantage that they…