Related papers: The 825 Smallest Right-Angled Hyperbolic Polyhedra

An equiangular hyperbolic Coxeter polyhedron is a hyperbolic polyhedron where all dihedral angles are equal to \pi/n for some fixed integer n at least 2. It is a consequence of Andreev's theorem that either n=3 and the polyhedron has all…

We consider a compact hyperbolic tetrahedron of a general type. It is a convex hull of four points called vertices in the hyperbolic space $\mathbb{H}^3$. It can be determined by the set of six edge lengths up to isometry. For further…

We prove a conjecture of Goncharov, which says that any multiple polylogarithm can be expressed via polylogarithms of depth at most half of the weight. We give an explicit formula for this presentation, involving a summation over trees that…

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…

Let $O$ be a closed $n$-dimensional arithmetic (real or complex) hyperbolic orbifold. We show that the diameter of $O$ is bounded above by $$\frac{c_1\log vol(O) + c_2}{h(O)},$$ where $h(O)$ is the Cheeger constant of $O$, $vol(O)$ is its…

Gromov and Piatetski-Shapiro proved existence of finite volume non-arithmetic hyperbolic manifolds of any given dimension. In dimension four and higher, we show that there are about v^v such manifolds of volume at most v, considered up to…

A classic theorem of Kazhdan and Margulis states that for any semisimple Lie group without compact factors, there is a positive lower bound on the covolume of lattices. H. C. Wang's subsequent quantitative analysis showed that the…

Let P be a set of n points in R^3. The 2-center problem for P is to find two congruent balls of minimum radius whose union covers P. We present two randomized algorithms for computing a 2-center of P. The first algorithm runs in O(n^3 log^5…

We describe an algorithm that, given a 3-manifold M, outputs a finite set containing all minimal volume k-component hyperbolic link complements in M. A key step, that might be of independent interest, is an algorithm that, given two…

The isoperimetric problem is one of the oldest in geometry and it consists of finding a surface of minimum area that encloses a given volume $V$. It is particularly important in physics because of its strong relation with stability, and…

We present a simple algorithm for finding eigenmodes of the Laplacian for arbitrary compact hyperbolic 3-manifolds. We apply our algorithm to a sample of twelve manifolds and generate a list of the lowest eigenvalues. We also display a…

In this paper, we study the rigidity of hyperbolic polyhedral 3-manifolds and the volume optimization program of angle structures. We first study the rigidity of decorated 1-3 type hyperbolic polyhedral metrics on 3-manifolds which are…

The lists of facets -- $298,592$ in $86$ orbits -- and of extreme rays -- $242,695,427$ in $9,003$ orbits -- of the hypermetric cone $HYP_8$ are computed. The first generalization considered is the hypermetric polytope $HYPP_n$ for which we…

In this paper we derive explicit estimates for the functions which appear in the previous work of Bridgeman and Kahn. As a consequence, we obtain an explicit lower bound for the length of the shortest orthogeodesic in terms of the volume of…

We give a deterministic method of quasi-polynomial complexity to approximate the volume of the intersection of the unit hypercube with two specific sets. The method can actually be applied (without losing the quasi-polynomial complexity) to…

The goal of this paper is to present a lower bound for the Mahler volume of at least 4-dimensional symmetric convex bodies. We define a computable dimension dependent constant through a 2-dimensional variational (max-min) procedure and…

A 1957 conjecture by Zdzislaw Melzak, that the unit volume polyhedron with least edge length was a triangular right prism, with edge length $2^{2/3}3^{11/6}$. We present a variety of necessary local criteria for any minimizer. In the case…

Agol has conjectured that minimally twisted n-chain links are the smallest volume hyperbolic manifolds with n cusps, for n at most 10. In his thesis, Venzke mentions that these cannot be smallest volume for n at least 11, but does not…

A convex body $R$ in $\mathbb R^d$ is called reduced if the minimal width $\Delta(R')$ of each convex body $R'\subset R$ different from $R$ is strictly smaller than the minimal width $\Delta(R)$ of $R$. In this article we construct a…

We give a new proof of the well-known result that the minimal volume vector fields on $\mathbb{S}^3(r)$ are the Hopf vector fields. Such proof relies again on calibration theory, arising here from a systematic point of view given by a…