Related papers: Centroids and equilibrium points of convex bodies
Motivated by the central limit problem for convex bodies, we study normal approximation of linear functionals of high-dimensional random vectors with various types of symmetries. In particular, we obtain results for distributions which are…
We prove two weighted geometric inequalities that hold for strictly mean convex and star-shaped hypersurfaces in Euclidean space. The first one involves the weighted area and the area of the hypersurface and also the volume of the region…
We prove for generalisations of quasi-homogeneous $n$-body problems with center of mass zero and $n$-body problems in spaces of negative constant Gaussian curvature that if the masses and rotation are fixed, there exists, for every order of…
It is proved that every convex body in the plane has a point such that the union of the body and its image under reflection in the point is convex. If the body is not centrally symmetric, then it has, in fact, three affinely independent…
The classical Busemann-Petty problem asks whether smaller central hyperplane sections of origin-symmetric convex bodies necessarily imply smaller total volume. Zvavitch studied this question for arbitrary measures with continuous even…
We prove a randomized version of the generalized Urysohn inequality relating mean-width to the other intrinsic volumes. To do this, we introduce a stochastic approximation procedure that sees each convex body K as the limit of intersections…
The Busemann-Petty problem asks whether origin-symmetric convex bodies in $\mathbb{R}^n$ with smaller central hyperplane sections necessarily have smaller $n$-dimensional volume. It is known that the answer is affirmative if $n\le 4$ and…
The Busemann-Petty problem asks whether origin-symmetric convex bodies in $\mathbb{R}^n$ with smaller central hyperplane sections necessarily have smaller $n$-dimensional volume. It is known that the answer to this problem is affirmative if…
The complex Busemann-Petty problem asks whether origin symmetric convex bodies in $\C^n$ with smaller central hyperplane sections necessarily have smaller volume. We prove that the answer is affirmative if $n\le 3$ and negative if $n\ge 4.$
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…
Uniformly regular equilibrium problems are natural generalizations of abstract equilibrium prob lems and they are defined over the uniformly prox-regular nonconvex sets. Some new efficient implicit methods for solving uniformly regular…
We construct symmetric convex bodies that are not intersection bodies, but all of their central hyperplane sections are intersection bodies. This result extends the studies by Weil in the case of zonoids and by Neyman in the case of…
We show that the $\Lp$ Busemann-Petty centroid inequality provides an elementary and powerful tool to the study of some sharp affine functional inequalities with a geometric content, like log-Sobolev, Sobolev and Gagliardo-Nirenberg…
We investigate convex polytopes of doubly stochastic matrices having special structures: symmetric, Hankel symmetric, centrosymmetric, and both symmetric and Hankel symmetric. We determine dimensions of these polytopes and classify their…
In this note, we study possible extensions of the Central Limit Theorem for non-convex bodies. First, we prove a Berry-Esseen type theorem for a certain class of unconditional bodies that are not necessarily convex. Then, we consider a…
We study the structures of two types of generalizations of intersection-bodies and the problem of whether they are in fact equivalent. Intersection-bodies were introduced by Lutwak and played a key role in the solution of the Busemann-Petty…
Since the answer to the complex Busemann-Petty problem is negative in most dimensions, it is natural to ask what conditions on the (n-1)-dimensional volumes of the central sections of complex convex bodies with complex hyperplanes allow to…
The subgradient projection iteration is a classical method for solving a convex inequality. Motivated by works of Polyak and of Crombez, we present and analyze a more general method for finding a fixed point of a cutter, provided that the…
Several years ago the authors started looking at some problems of convex geometry from a more general point of view, replacing volume by an arbitrary measure. This approach led to new general properties of the Radon transform on convex…
The goal of this paper is to establish certain inequalities between the numbers of convex polytopes in the d-dimensional space "containing" and "avoiding" zero provided that their vertex sets are subsets of a given finite set of points in…