Related papers: A sharp isoperimetric bound for convex bodies

The central limit theorem for convex bodies says that with high probability the marginal of an isotropic log-concave distribution along a random direction is close to a Gaussian, with the quantitative difference determined asymptotically by…

The notion of ball convexity, considered in finite dimensional real Banach spaces, is a natural and useful extension of usual convexity; one replaces intersections of half-spaces by suitable intersections of balls. A subset $S$ of a normed…

The dual Minkowski problem for even data asks what are the necessary and sufficient conditions on an even prescribed measure on the unit sphere for it to be the $q$-th dual curvature measure of an origin-symmetric convex body in…

We prove some results concerning the boundary of a convex set in $\H^n$. This includes the convergence of curvature measures under Hausdorff convergence of the sets, the study of normal points, and, for convex surfaces, a generalized Gauss…

We consider a generalization of the hyperplane problem to arbitrary measures in place of volume and to sections of lower dimensions. We prove this generalization for unconditional convex bodies and for duals of bodies with bounded volume…

The approximability of a convex body is a number which measures the difficulty to approximate that body by polytopes. We prove that twice the approximability is equal to the volume entropy for a Hilbert geometry in dimension two end three…

We provide a sharp lower bound for the perimeter of the inner parallel sets of a convex body $\Omega$. The bound depends only on the perimeter and inradius $r$ of the original body and states that \[|\partial\Omega_t| \geq…

In this paper we give a lower bound on the waist of the unit sphere of a uniformly convex normed space by using the localization technique in codimension greater than one and a strong version of the Borsuk-Ulam theorem. The tools used in…

The Shapley-Folkman theorem shows that Minkowski averages of uniformly bounded sets tend to be convex when the number of terms in the sum becomes much larger than the ambient dimension. In optimization, Aubin and Ekeland [1976] show that…

It is known that an $n$-dimensional convex body which is typical in the sense of Baire category, shows a simple, but highly non-intuitive curvature behaviour: at almost all of its boundary points, in the sense of measure, all curvatures are…

In light of the log-Brunn-Minkowski conjecture, various attempts have been made to define the geometric mean of convex bodies. Many of these constructions are fairly complex and/or fail to satisfy some natural properties one would expect of…

The Brunn-Minkowski Theory has seen several generalizations over the past century. Many of the core ideas have been generalized to measures. With the goal of framing these generalizations as a weighted Brunn-Minkowski theory, we prove the…

A generalization of Young's inequality for convolution with sharp constant is conjectured for scenarios where more than two functions are being convolved, and it is proven for certain parameter ranges. The conjecture would provide a unified…

We study the lower bound for Koldobsky's slicing inequality. We show that there exists a measure $\mu$ and a symmetric convex body $K \subseteq \mathbb{R}^n$, such that for all $\xi\in S^{n-1}$ and all $t\in \mathbb{R},$…

In this paper we present a new bound obtained with the probabilistic method for the solution of the Set Covering problem with unit costs. The bound is valid for problems of fixed dimension, thus extending previous similar asymptotic…

In this paper, we consider the isoperimetric problem in the space $\mathbb{R}^N$ with density. Our result states that, if the density f is l.s.c. and converges to a positive limit at infinity, being smaller than this limit far from the…

We propose to derive deviation measures through the Minkowski gauge of a given set of acceptable positions. We show that, given a suitable acceptance set, any positive homogeneous deviation measure can be accommodated in our framework. In…

We investigate the rate of convergence in the central limit theorem for convex sets. We obtain bounds with a power-law dependence on the dimension. These bounds are asymptotically better than the logarithmic estimates which follow from the…

The Brunn-Minkowski inequality states that for bounded measurable sets $A$ and $B$ in $\mathbb{R}^n$, we have $|A+B|^{1/n} \geq |A|^{1/n}+|B|^{1/n}$. Also, equality holds if and only if $A$ and $B$ are convex and homothetic sets in…

In this paper we prove a theorem that provides an upper bound for the density of packings of congruent copies of a given convex body in $\mathbb{R}^n$; this theorem is a generalization of the linear programming bound for sphere packings. We…