Related papers: Random inscribed polytopes in projective geometrie…

We consider the Holmes--Thompson volume of balls in the Funk geometry on the interior of a convex domain. We conjecture that for a fixed radius, this volume is minimized when the domain is a simplex and the ball is centered at the…

Any Riemannian manifold has a canonical collection of valuations (finitely additive measures) attached to it, known as the intrinsic volumes or Lipschitz-Killing valuations. They date back to the remarkable discovery of H. Weyl that the…

We establish estimates for the asymptotic best approximation of the Euclidean unit ball by polytopes under a notion of distance induced by the intrinsic volumes. We also introduce a notion of distance between convex bodies that is induced…

This paper derives central limit and bootstrap theorems for probabilities that sums of centered high-dimensional random vectors hit hyperrectangles and sparsely convex sets. Specifically, we derive Gaussian and bootstrap approximations for…

The intrinsic volumes of a convex body are fundamental invariants that capture information about the average volume of the projection of the convex body onto a random subspace of fixed dimension. The intrinsic volumes also play a central…

In this survey article we will consider universal lower bounds on the volume of a Riemannian manifold, given in terms of the volume of lower dimensional objects (primarily the lengths of geodesics). By `universal' we mean without curvature…

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…

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…

Let C = C(l_1, ..., l_n) be the n-dimensional orthogonal cross-polytope whose axes are of length l_1,..., l_n. Subject to the condition \sum l_i^2 = 1, the mean width of C is minimised when l_i = 1/sqrt{n} for every i, and it is maximised…

We state the Central Limit Theorem, as the degree goes to infinity, for the normalized volume of the zero set of a rectangular Kostlan-Shub-Smale random polynomial system. This paper is a continuation of {\it Central Limit Theorem for the…

We extend the notion of illumination bodies to Riemannian spaces of constant curvature and to projective Finsler geometries. We prove that the derivative of their volume defines a notion of surface area for convex bodies in these settings,…

A well-known result in the study of convex polyhedra, due to Minkowski, is that a convex polyhedron is uniquely determined (up to translation) by the directions and areas of its faces. The theorem guarantees existence of the polyhedron…

The classical Dvoretzky--Rogers lemma provides a deterministic algorithm by which, from any set of isotropic vectors in Euclidean $d$-space, one can select a subset of $d$ vectors whose determinant is not too small. Subsequently,…

We derive lower estimates for the approximation of the $d$-dimensional Euclidean ball by polytopes with a fixed number of $k$-dimensional faces, $k\in\{0,1,\ldots,d-1\}$. The metrics considered include the intrinsic volume difference and…

The random beta polytope is defined as the convex hull of $n$ independent random points with the density proportional to $(1-\|x\|^2)^\beta$ on the $d$-dimensional unit ball, where $\beta>-1$ is a parameter. Similarly, the random beta'…

We study the Hausdorff distance between a random polytope, defined as the convex hull of i.i.d. random points, and the convex hull of the support of their distribution. As particular examples, we consider uniform distributions on convex…

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…

Exploiting a bijective correspondence between planar quadrangulations and well-labeled trees, we define an ensemble of infinite surfaces as a limit of uniformly distributed ensembles of quadrangulations of fixed finite volume. The limit…

In this note we introduce a natural Finsler structure on convex surfaces, referred to as the projective Finsler structure, which is dual in a sense to the obvious inclusion of a convex surface in a normed space. It has an associated…

We consider moments of the normalized volume of a symmetric or nonsymmetric random polytope in a fixed symmetric convex body. We investigate for which bodies these moments are extremized, and calculate exact values in some of the extreme…