Related papers: The 825 Smallest Right-Angled Hyperbolic Polyhedra

We describe a polynomial time algorithm that takes as input a polygon with axis-parallel sides but irrational vertex coordinates, and outputs a set of as few rectangles as possible into which it can be dissected by axis-parallel cuts and…

We compute the volumes of convex bodies that are given by inequalities of concave polynomials. These volumes are found to arbitrary precision thanks to the representation of periods by linear differential equations. Our approach rests on…

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…

The aim of this note is to investigate isoperimetric-type problems for $3$-dimensional parallelohedra; that is, for convex polyhedra whose translates tile the $3$-dimensional Euclidean space. Our main result states that among…

A polyhedron in a three-dimensional hyperbolic space is said to be generalized if finite, ideal and truncated vertices are admitted. In virtue of Belletti's theorem (2021) the exact upper bound for volumes of generalized hyperbolic…

If $\lambda$ is a positive real number strictly less than $\log3$, there is a positive number $V_\lambda$ such that every orientable hyperbolic 3-manifold of volume greater than $V_\lambda$ admits $\lambda$ as a Margulis number. If…

We give the sharp lower bound of the volume product of three dimensional convex bodies which are invariant under a discrete subgroup of $O(3)$ in several cases. We also characterize the convex bodies with the minimal volume product in each…

In hep-th/9805025, a result for the symmetric 3-loop massive tetrahedron in 3 dimensions was found, using the lattice algorithm PSLQ. Here we give a more general formula, involving 3 distinct masses. A proof is devised, though it cannot be…

We give a closed formula for volumes of generic hyperbolic tetrahedra in terms of edge lengths. The cue of our formula is by the volume conjecture for the Turaev-Viro invariant of closed 3-manifolds, which is defined from the quantum…

The first two installments of this series of papers dealt with the maximum area polygons: Parallelogram, Rectangle, Square or Equilateral Triangle, in given triangles. Minimum area polygons were also considered in the second paper on…

This is an expository paper on Mom-technology, describing the recent work of the authors in this area (found in arXiv:math/0606072, arXiv:0705.4325, and arXiv:0809.0346) concerning the use of Mom-technology to find the minimum-volume…

The space of shapes of a polyhedron with given total angles less than 2\pi at each of its n vertices has a Kaehler metric, locally isometric to complex hyperbolic space CH^{n-3}. The metric is not complete: collisions between vertices take…

We compute for all orientable irreducible geometric 3-manifolds certain complexity functions that approximate from above Matveev's natural complexity, known to be equal to the minimal number of tetrahedra in a triangulation. We can show…

The "Mahler volume" is, intuitively speaking, a measure of how "round" a centrally symmetric convex body is. In one direction this intuition is given weight by a result of Santalo, who in the 1940s showed that the Mahler volume is…

We enumerate the small-volume manifolds that can be obtained by Dehn filling on Mom-2 and Mom-3 manifolds as defined by Gabai, Meyerhoff, and the author. In so doing we complete the proof that the Weeks manifold is the minimum-volume…

We develop a new method of constructing non-arithmetic lattices in the projective orthogonal group $\text{PO}(n,1)$ for every integer $n$ larger than one. The technique is to consider anti-holomorphic involutions on a complex arithmetic…

Meyer and Reisner had proved the Mahler conjecture for rovelution bodies. In this paper, using a new method, we prove that among origin-symmetric bodies of revolution in R^3, cylinders have the minimal Mahler volume. Further, we prove that…

Hyperbolic programming is the problem of computing the infimum of a linear function when restricted to the hyperbolicity cone of a hyperbolic polynomial, a generalization of semidefinite programming. We propose an approach based on symbolic…

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 identity of the smallest quadrangulation with minimum degree 3 also containing parallel edges is unknown. However, it has already been determined that its order (the number of vertices) is between 11 and 14. This paper narrows this…