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

We study sets defined as the intersection of a rank-1 constraint with different choices of linear side constraints. We identify different conditions on the linear side constraints, under which the convex hull of the rank-1 set is polyhedral…

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 $K$-hull of a compact set $A\subset\mathbb{R}^d$, where $K\subset \mathbb{R}^d$ is a fixed compact convex body, is the intersection of all translates of $K$ that contain $A$. A set is called $K$-strongly convex if it coincides with its…

Given N points in the plane $P_1 P_2...P_N$ and a location $\Omega$, the union of discs with diameters $[\Omega P_i], i = 1, 2,...N$ covers the convex hull of the points. The location $\Omega_s$ minimizing the area covered by the union of…

The Gaussian polytope $\mathcal P_{n,d}$ is the convex hull of $n$ independent standard normally distributed points in $\mathbb R^d$. We derive explicit expressions for the probability that $\mathcal P_{n,d}$ contains a fixed point…

We obtain local and global results on polynomially convex hulls of Lagrangian and totally real submanifolds of $C^n$ with self-intersections and open Whitney umbrella points.

This paper details an algorithm for unfolding a class of convex polyhedra, where each polyhedron in the class consists of a convex cap over a rectangular base, with several restrictions: the cap's faces are quadrilaterals, with vertices…

John's inclusion states that a convex body in $\mathbb{R}^d$ can be covered by the $d$-dilation of its maximal volume ellipsoid. We obtain a certain John-type inclusion for log-concave functions. As a byproduct of our approach, we establish…

We apply the techniques developed by Marcus, Spielman and Srivastava, working with principal submatrices in place of rank $1$ decompositions to give an alternate proof of their results on restricted invertibility. We show that one can find…

Using the concepts of mixed volumes and quermassintegrals of convex geometry, we derive an exact formula for the exclusion volume for a general convex body that applies in any space dimension, including both the rotationally-averaged…

A joint generalization of real smooth as well of complex manifolds are the Cauchy-Riemann manifolds. The main objective of the paper is to inroduce a class of symmetric CR manifolds containing both classes of Riemannian and Hermitian…

In this note, as a particular case of a more general result, we obtain the following theorem: Let $\Omega\subseteq {\bf R}^n$ be a non-empty bounded open set and let $f:\overline {\Omega}\to {\bf R}^n$ be a continuous function which is…

We introduce a class of polytopes that concisely capture the structure of UV and IR divergences of general Feynman integrals in Schwinger parameter space, treating them in a unified way as worldline segments shrinking and expanding at…

We prove a conjecture made by the first author: given an n-body central configuration X_0 in the euclidean space R^{2p}, let Im F be the set of ordered real p-tuples {\nu_1,\nu_2,...,\nu_p} such that {\pm i\nu_1,\pm i\nu_2,...,\pm i\nu_p}…

The paper is concerned with the boundary behaviour of polynomially and rationally convex hulls in pseudoconvex domains in $\mathbb{C}^n$. As an application, it is shown that every connected polynomially or rationally convex compact set with…

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 generalize the Beckner's type Poincar\'e inequality \cite{Beckner} to a large class of probability measures on an abstract Wiener space of the form $\mu\star\nu$, where $\mu$ is the reference Gaussian measure and $\nu$ is a probability…

Convex geometries are closure systems satisfying the anti-exchange axiom. Every finite convex geometry can be embedded into a convex geometry of finitely many points in an n-dimensional space equipped with a convex hull operator, by the…

Let $P$ be a finite partially ordered set. In a recent series of works, Proudfoot introduced the notion of $Z$-polynomials associated with $P$-kernels, providing a unified framework for various intersection cohomology Poincar\'e polynomials…

We analyze the correctness of an O(n log n) time divide-and-conquer algorithm for the convex hull problem when each input point is a location determined by a normal distribution. We show that the algorithm finds the convex hull of such…