相关论文: A Polynomial Number of Random Points does not Dete…

We describe a maximum entropy approach for computing volumes and counting integer points in polyhedra. To estimate the number of points from a particular set X in R^n in a polyhedron P in R^n, by solving a certain entropy maximization…

We present a probabilistic model of illuminating a convex body by independently distributed light sources. In addition to recovering C.A. Rogers' upper bounds for the illumination number, we improve previous estimates of J. Januszewski and…

The longstanding Godbersen's conjecture states that for any convex body $K \subset \mathbb R^n$ of volume $1$ and any $j \in \{0, \ldots, n\}$, the mixed volume $V_j = V(K[j], -K[n - j])$ is bounded by $\binom{n}{j}$, with equality if and…

Consider a random set of points on the unit sphere in $\mathbb{R}^d$, which can be either uniformly sampled or a Poisson point process. Its convex hull is a random inscribed polytope, whose boundary approximates the sphere. We focus on the…

Computing mixed volume of convex polytopes is an important problem in computational algebraic geometry. This paper establishes sufficient conditions under which the mixed volume of several convex polytopes exactly equals the normalized…

In the paper "Isoperimetry of waists and local versus global asymptotic convex geometries", it was proved that the existence of nicely bounded sections of two symmetric convex bodies K and L implies that the intersection of randomly rotated…

We discuss how well a given convex body B in a real d-dimensional vector space V can be approximated by a set X for which the membership question: ``given an x in V, does x belong to X?'' can be answered efficiently (in time polynomial in…

There are (at least) two reasons to study random polytopes. The first is to understand the combinatorics and geometry of random polytopes especially as compared to other classes of polytopes, and the second is to analyze average-case…

Let $K\subset\mathbb S^{d-1}$ be a convex spherical body. Denote by $\Delta(K)$ the distance between two random points in $K$ and denote by $\sigma(K)$ the length of a random chord of $K$. We explicitly express the distribution of…

We obtain a new upper estimate on the Euclidean diameter of the intersection of the kernel of a random matrix with iid rows with a given convex body. The proof is based on a small-ball argument rather than on concentration and thus the…

Choose $n$ random, independent points in $\R^d$ according to the standard normal distribution. Their convex hull $K_n$ is the {\sl Gaussian random polytope}. We prove that the volume and the number of faces of $K_n$ satisfy the central…

We give a deterministic 2^{O(n)} algorithm for computing an M-ellipsoid of a convex body, matching a known lower bound. This has several interesting consequences including improved deterministic algorithms for volume estimation of convex…

The volume function V(t) of a compact set S\in R^d is just the Lebesgue measure of the set of points within a distance to S not larger than t. According to some classical results in geometric measure theory, the volume function turns out to…

We study the probability distribution of the area and the number of vertices of random polygons in a convex set $K\subset\mathbb{R}^2$. The novel aspect of our approach is that it yields uniform estimates for all convex sets…

We present a new random walk for uniformly sampling high-dimensional convex bodies. It achieves state-of-the-art runtime complexity with stronger guarantees on the output than previously known, namely in R\'enyi divergence (which implies…

We study the volume ratio between projections of two convex bodies. Given a high-dimensional convex body $K$ we show that there is another convex body $L$ such that the volume ratio between any two projections of fixed rank of the bodies…

In the Onsager model of one-component hard-particle systems, the entire phase behaviour is dictated by a function of relative orientation, which represents the amount of space excluded to one particle by another at this relative…

Let $P$ be a bounded polyhedron defined as the intersection of the non-negative orthant ${\Bbb R}^n_+$ and an affine subspace of codimension $m$ in ${\Bbb R}^n$. We show that a simple and computationally efficient formula approximates the…

In this paper we propose a method to construct probability measures on the space of convex bodies with a given pushforward distribution. Concretely we show that there is a measure on the metric space of centrally symmetric convex bodies,…

It was shown by G. Pisier that any finite-dimensional normed space admits an $\alpha$-regular $M$-position, guaranteeing not only regular entropy estimates but moreover regular estimates on the diameters of minimal sections of its unit-ball…