Related papers: The Mahler conjecture in two dimensions via the pr…
We study the expected volume of random polytopes generated by taking the convex hull of independent identically distributed points from a given distribution. We show that for log-concave distributions supported on convex bodies, we need at…
The maximum volume $j$-simplex problem asks to compute the $j$-dimensional simplex of maximum volume inside the convex hull of a given set of $n$ points in $\mathbb{Q}^d$. We give a deterministic approximation algorithm for this problem…
In this article we prove a conjecture of Bezdek, Brass, and Harborth concerning the maximum volume of the convex hull of any facet-to-facet connected system of n unit hypercubes in the d-dimensional Euclidean space. For d=2 we enumerate the…
A very fundamental geometric problem on finite systems of spheres was independently phrased by Kneser (1955) and Poulsen (1954). According to their well-known conjecture if a finite set of balls in Euclidean space is repositioned so that…
The bellows conjecture claims that the volume of any flexible polyhedron of dimension 3 or higher is constant during the flexion. The bellows conjecture was proved for flexible polyhedra in the Euclidean spaces of dimensions 3 and higher,…
Hadwiger's covering conjecture is that every $n$-dimensional convex body can be covered by at most $2^n$ of its smaller positive homothetic copies, with $2^n$ copies required only for affine images of $n$-cube. Convex hull of a ball and an…
In a $d$-dimensional convex body $K$, for $n \leq d+1$, random points $X_0, \dots, X_{n-1}$ are chosen according to the uniform distribution in $K$. Their convex hull is a random $(n-1)$-simplex with probability $1$. We denote its…
The intrinsic volumes of a convex cone are geometric functionals that return basic structural information about the cone. Recent research has demonstrated that conic intrinsic volumes are valuable for understanding the behavior of random…
The Hirsch conjecture, posed in 1957, stated that the graph of a $d$-dimensional polytope or polyhedron with $n$ facets cannot have diameter greater than $n - d$. The conjecture itself has been disproved, but what we know about the…
Volume is a natural geometric measure for comparing polyhedral relaxations of non-convex sets. Speakman and Lee gave volume formulae for comparing relaxations of trilinear monomials, quantifying the strength of various natural relaxations.…
We give a proof of the $A_2$ conjecture in geometrically doubling metric spaces (GDMS), i.e. a metric space where one can fit not more than a fixed amount of disjoint balls of radius $r$ in a ball of radius $2r$. Our proof consists of three…
We endeavour to estimate numerous multi-dimensional means of various probability distributions on a common space based on independent samples. Our approach involves forming estimators through convex combinations of empirical means derived…
This article investigates the Mahler measure of a family of 2-variate polynomials, denoted by $P_d, d\geq 1$, unbounded in both degree and genus. By using a closed formula for the Mahler measure introduced in "Volume function and Mahler…
The notion of the magnitude of a compact metric space was considered in arXiv:0908.1582 with Tom Leinster, where the magnitude was calculated for line segments, circles and Cantor sets. In this paper more evidence is presented for a…
The theory of intrinsic volumes of convex cones has recently found striking applications in areas such as convex optimization and compressive sensing. This article provides a self-contained account of the combinatorial theory of intrinsic…
The classic double bubble theorem says that the least-perimeter way to enclose and separate two prescribed volumes in $\mathbb{R}^N$ is the standard double bubble. We seek the optimal double bubble in $\mathbb{R}^N$ with density, which we…
Define a body A to be able to hide behind a body B if the orthogonal projection of B contains a translation of the corresponding orthogonal projection of A in every direction. In two dimensions, it is easy to observe that there exist two…
An identity due to Efron dating from 1965 relates the expected volume of the convex hull of $n$ random points to the expected number of vertices of the convex hull of $n+1$ random points. Forty years later this identity was extended from…
We provide two algorithms for computing the volume of a convex polytope with half-space representation {x>=0; Ax <=b} for some (m,n) matrix A and some m-vector b. Both algorithms have a O(n^m) computational complexity which makes them…
We show that the complex projective space has maximal degree (volume) among all n-dimensional Kahler-Einstein Fano manifolds admitting a holomorphic C^*-action with a finite number of fixed points. The toric version of this result,…