Related papers: Inequalities on Projected Volumes

We study properties of convex hulls of (co)adjoint orbits of compact groups, with applications to invariant theory and tensor product decompositions. The notion of partial convex hulls is introduced and applied to define two numerical…

We give an overview of the 2023 Computational Geometry Challenge targeting the problem Minimum Coverage by Convex Polygons, which consists of covering a given polygonal region (possibly with holes) by a minimum number of convex subsets, a…

In [SZ], Soprunov and Zvavitch have translated the Bezout inequalities (from Algebraic Geometry) into inequalities of mixed volumes satisfied by the simplex. They conjecture this set of inequalities characterizes the simplex, among all…

We study the problem of partitioning a polygon into the minimum number of subpolygons using cuts in predetermined directions such that each resulting subpolygon satisfies a given width constraint. A polygon satisfies the unit-width…

Recall that a convex body $K$ is in John's position if the unit Euclidean ball is the maximal volume ellipsoid contained in $K$. Approximating convex body in John's position by polytopes we obtain the following results. 1. Let $n>R_n\ge 1$…

At the heart of convex geometry lies the observation that the volume of convex bodies behaves as a polynomial. Many geometric inequalities may be expressed in terms of the coefficients of this polynomial, called mixed volumes. Among the…

We give the first nontrivial upper and lower bounds on the maximum volume of an empty axis-parallel box inside an axis-parallel unit hypercube in $\RR^d$ containing $n$ points. For a fixed $d$, we show that the maximum volume is of the…

For a permutationally invariant unconditional convex body K in R^n we define a finite sequence (K_j), j = 1, ..., n of projections of the body K to the space spanned by first j vectors of the standard basis of R^n. We prove that the…

Let $K$ be a convex body in $\mathbb{R}^d$ which slides freely in a ball. Let $K^{(n)}$ denote the intersection of $n$ closed half-spaces containing $K$ whose bounding hyperplanes are independent and identically distributed according to a…

In this paper we consider the problem of minimizing the relative perimeter under a volume constraint in the interior of a conically bounded convex set, i.e., an unbounded convex body admitting an \emph{exterior} asymptotic cone. Results…

This article describes a method to compute successive convex approximations of the convex hull of a set of points in R^n that are the solutions to a system of polynomial equations over the reals. The method relies on sums of squares of…

Let $\mathbb{B}_p^N$ be the $N$-dimensional unit ball corresponding to the $\ell_p$-norm. For each $N\in\mathbb N$ we sample a uniform random subspace $E_N$ of fixed dimension $m\in\mathbb{N}$ and consider the volume of $\mathbb{B}_p^N$…

The average section functional ${\rm as}(K)$ of a centered convex body in ${\mathbb R}^n$ is the average volume of central hyperplane sections of $K$: \begin{equation*}{\rm as}(K)=\int_{S^{n-1}}|K\cap \xi^{\perp }|\,d\sigma (\xi…

In the convex covering problem, we are given a convex polygon with holes $P$ and the goal is to cover $P$ using a small number of convex polygons that lie inside $P$. In this paper, we solve the problem using the following strategy. We find…

For a convex body $K\subset\R^n$ and $i\in\{1,...,n-1\}$, the function assigning to any $i$-dimensional subspace $L$ of $\R^n$, the $i$-dimensional volume of the orthogonal projection of $K$ to $L$, is called the $i$-th projection function…

We show that in all dimensions d>2, there exists an asymmetric convex body of revolution all of whose maximal hyperplane sections have the same volume. This gives the negative answer to the question posed by V. Klee in 1969.

The Busemann-Petty problem asks whether origin-symmetric convex bodies in real Euclidean n-space with smaller central hyperplane sections necessarily have smaller volume. The answer is affirmative for n less or equal to 4 and negative if n…

This article is a survey of recent results on slicing inequalities for convex bodies. The focus is on the setting of arbitrary measures in place of volume.

We study the problems of covering or partitioning a polygon $P$ (possibly with holes) using a minimum number of small pieces, where a small piece is a connected sub-polygon contained in an axis-aligned unit square. For covering, we seek to…

Tensor products of convex cones have recently come up in different areas, ranging from functional analysis and operator theory to approximation theory and theoretical physics. However, most of the existing literature focuses either on…