Related papers: The 825 Smallest Right-Angled Hyperbolic Polyhedra
By gluing some copies of a polytope of Kerckhoff and Storm's, we build the smallest known orientable hyperbolic 4-manifold that is not commensurable with the ideal 24-cell or the ideal rectified simplex. It is cusped and arithemtic, and has…
In this paper, we study the fundamental open question of finding the optimal high-order algorithm for solving smooth convex minimization problems. Arjevani et al. (2019) established the lower bound $\Omega\left(\epsilon^{-2/(3p+1)}\right)$…
We construct here two new examples of non-orientable, non-compact, hyperbolic 4-manifolds. The first has minimal volume $v_m = 4{\pi}^2/3$ and two cusps. This example has the lowest number of cusps among known minimal volume hyperbolic…
W. Thurston suggested a method for computing hyperbolic volume of hyperbolic 3-manifolds, based on a triangulation of the manifold. The method was implemented by J. Weeks in the program SnapPea, which produces a decimal approximation as a…
We describe an algorithm which has enabled us to give a complete list, without repetitions, of all closed oriented irreducible 3-manifolds of complexity up to 9. More interestingly, we have actually been able to give a "name" to each such…
Estimating the volume of a convex body is a canonical problem in theoretical computer science. Its study has led to major advances in randomized algorithms, Markov chain theory, and computational geometry. In particular, determining the…
Milnor computed the volumes of ideal hyperbolic prisms as part of an effort to construct 3-manifolds whose volumes are finite rational sums of the Lobachevsky function evaluated at rational multiples of pi. Motivated by these results and…
A small polygon is a convex polygon of unit diameter. We are interested in small polygons which have the largest area for a given number of vertices $n$. Many instances are already solved in the literature, namely for all odd $n$, and for…
On finite-volume hyperbolic $3$-manifolds, we compare volumes of different metrics using the exponential convergence of Ricci-DeTurck flow toward the hyperbolic metric $h_0$. We prove that among metrics with scalar curvature bounded below…
We classify all the possible $delta$-vectors of d-dimensional integral convex polytopes whose volumes are less than or equal to 3/(d!).
We prove that the regular octahedron has the minimal surface area among 3-polytopes of given volume and having at most six vertices.
We classify the complete hyperbolic 3-manifolds admitting a maximal cusp of volume at most 2.62. We use this to show that the figure-8 knot complement is the unique 1-cusped hyperbolic 3-manifold with nine or more non-hyperbolic fillings;…
The hexagon is the least-perimeter tile in the Euclidean plane. On hyperbolic surfaces, the isoperimetric problem differs for every given area. Cox conjectured that a regular $k$-gonal tile with 120-degree angles is isoperimetric for its…
Closed hyperbolic manifolds are proven to minimize volume over all Alexandrov spaces with curvature bounded below by -1 in the same bilipschitz class. As a corollary compact convex cores with totally geodesic boundary are proven to minimize…
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…
For a hyperplane $H$ supporting a convex body $C$ in the hyperbolic space $\mathbb{H}^d$ we define the width of $C$ determined by $H$ as the distance between $H$ and a most distant ultraparallel hyperplane supporting $C$. The minimum width…
Quantitative estimates related to the classical Borsuk problem of splitting set in Euclidean space into subsets of smaller diameter are considered. For a given $k$ there is a minimal diameter of subsets at which there exists a covering with…
We study the problem of covering a given set of $n$ points in a high, $d$-dimensional space by the minimum enclosing polytope of a given arbitrary shape. We present algorithms that work for a large family of shapes, provided either only…
Let $\rho_n(V)$ be the number of complete hyperbolic manifolds of dimension n with volume less than $V$. Burger, Gelander, Lubotzky, and Moses showed that when n>3 there exist a,b>0 depending on the dimension such that aV log(V) <…
The volume of a Meissner polyhedron is computed in terms of the lengths of its dual edges. This allows to reformulate the Meissner conjecture regarding constant width bodies with minimal volume as a series of explicit finite dimensional…