Related papers: The Mahler conjecture in two dimensions via the pr…
This is the second paper of two in a series under the same title ([CRX]); both study the quantitative volume space form rigidity conjecture: a closed $n$-manifold of Ricci curvature at least $(n-1)H$, $H=\pm 1$ or $0$ is diffeomorphic to a…
We establish central limit theorems for natural volumes of random inscribed polytopes in projective Riemannian or Finsler geometries. In addition, normal approximation of dual volumes and the mean width of random polyhedral sets are…
We address an old open question in convex geometry that dates back to the work of Minkowski: what are the equality cases of the monotonicity of mixed volumes? The problem is equivalent to that of providing a geometric characterization of…
Volume approximation is an important problem found in many applications of computer graphics, vision, and image processing. The problem is about computing an accurate and compact approximate representation of 3D volumes using some simple…
The multiverse/landscape paradigm that has emerged from eternal inflation and string theory, describes a large-scale multiverse populated by "pocket universes" which come in a huge variety of different types, including different…
We derive the Weil-Petersson measure on the moduli space of hyperbolic surfaces with defects of arbitrary opening angles and use this to compute its volume. We conjecture a matrix integral computing the corresponding volumes and confirm…
Let $K$ be an $n$-dimensional symmetric convex body with $n \ge 4$ and let $K\dual$ be its polar body. We present an elementary proof of the fact that $$(\Vol K)(\Vol K\dual)\ge \frac{b_n^2}{(\log_2 n)^n},$$ where $b_n$ is the volume of the…
Minkowski's 2nd theorem in the Geometry of Numbers provides optimal upper and lower bounds for the volume of a $o$-symmetric convex body in terms of its successive minima. In this paper we study extensions of this theorem from two different…
We study Laurent polynomials in any number of variables that are sums of at most $k$ monomials. We first show that the Mahler measure of such a polynomial is at least $h/2^{k-2}$, where $h$ is the height of the polynomial. Next, restricting…
Speakman and Lee (2017) gave a formula for the volume of the convex hull of the graph of a trilinear monomial, $y=x_1x_2x_3$, over a box in the nonnegative orthant, in terms of the upper and lower bounds on the variables. This was done in…
We study the maximum weight convex polytope problem, in which the goal is to find a convex polytope maximizing the total weight of enclosed points. Prior to this work, the only known result for this problem was an $O(n^3)$ algorithm for the…
For each dimension $d$, $d$-dimensional integral simplices with exactly one interior integral point have bounded volume. This was first shown by Hensley. Explicit volume bounds were determined by Hensley, Lagarias and Ziegler, Pikhurko, and…
This book uses optimal control theory to prove that the most unpackable centrally symmetric convex disk in the plane is a smoothed polygon. A smoothed polygon is a polygon whose corners have been rounded in a special way by arcs of…
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…
A generalized hyperbolic tetrahedra is a polyhedron (possibly non-compact) with finite volume in hyperbolic space, obtained from a tetrahedron by the polar truncation at the vertices lying outside the space. In this paper it is proved that…
We establish Schmutz Schaller's conjecture that the hexagonal lattice is `better' than the square lattice. Schmutz Schaller (Bulletin of the AMS 35 (1998), p. 201), motivated by considerations from hyperbolic geometry, conjectured that in…
We construct a quasi-polynomial time deterministic approximation algorithm for computing the volume of an independent set polytope with restrictions. Randomized polynomial time approximation algorithms for computing the volume of a convex…
The Stoker problem, first formulated in 1968, consists in understanding to what extent a convex polyhedron is determined by its dihedral angles. By means of the double construction, this problem is intimately related to rigidity issues for…
We have derived an analytical formulation for estimating the volume of geometries enclosed by implicitly defined surfaces. The novelty of this work is due to two aspects. First we provide a general analytical formulation for all…
Predictions in an eternally inflating multiverse are meaningless unless we specify the probability measure. The scale-factor cutoff is perhaps the simplest and most successful measure which avoid catastrophic problems such as the youngness…