Related papers: Archimedes' Revenge

We give several algorithms addressing computations of intersections of conjugate subgroups.

This paper proves the volume of the arithmetic Okounkov body, constructed from a hermitian line bundle on an arithmetic variety by the author in a previous paper, is equal to the the volume of the hermitian line bundle up to a simple…

A finite-volume hyperbolic 3-manifold geometrically bounds if it is the geodesic boundary of a finite-volume hyperbolic 4-manifold. We construct here an example of non-compact, finite-volume hyperbolic 3-manifold that geometrically bounds.…

We obtain a new upper estimate on the Euclidean diameter of the intersection of the kernel of a random matrix with iid rows with a given convex body. The proof is based on a small-ball argument rather than on concentration and thus the…

The work of Jorgensen and Thurston shows that there is a finite number N(v) of orientable hyperbolic 3-manifolds with any given volume v. We show that there is an infinite sequence of closed orientable hyperbolic 3-manifolds, obtained by…

We discuss the geometry of some arithmetic orbifolds locally isometric to a product of real hyperbolic spaces of dimension two and three, and prove that certain sequences of non-uniform orbifolds are convergent to this space in a geometric…

We construct the hyperbolic plane with its geodesic flow as the scale plus symmetry reduction of a three-body problem in the Euclidean plane. The potential is $-I/\Delta^2$ where $I$ is the triangle's moment of inertia and $\Delta$ its…

Answering a question of Gamarnik and Smedira, we give a polynomial time algorithm that approximately computes the volume of a truncation of a relaxation of the independent set polytope, improving on their quasi-polynomial time algorithm.…

We propose a new method for the evaluation of intersection numbers for twisted meromorphic $n$-forms, through Stokes' theorem in $n$ dimensions. It is based on the solution of an $n$-th order partial differential equation and on the…

Let N be a compact, orientable hyperbolic 3-manifold with connected, totally geodesic boundary of genus 2. If N has Heegaard genus at least 5, then its volume is greater than 6.89. The proof of this result uses the following dichotomy:…

Let $K$ be a convex body in $\mathbb R^n$. We prove that in small codimensions, the sections of a convex body through the centroid are quite symmetric with respect to volume. As a consequence of our estimates we give a positive answer to a…

The accurate prediction of aerothermal surface loading is of paramount importance for the design of high speed flight vehicles. In this work, we consider the numerical solution of hypersonic flow over a double-finned geometry,…

We prove that the 8^4_2 link complement is the minimal volume orientable hyperbolic manifold with 4 cusps. Its volume is twice of the volume V_8 of the ideal regular octahedron, i.e. 7.32... = 2V_8. The proof relies on Agol's argument used…

The present paper gives two concrete formulas for the volume of an arbitrary spherical tetrahedron, which is in a 3-dimensional spherical space of constant curvature +1. One formula is given in terms of dihedral angles, and another one is…

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…

We give diagrammatic algorithms for computing the group trisection, homology groups, and intersection form of a closed, orientable, smooth 4-manifold, presented as a branched cover of a bridge-trisected surface in $\mathbb{S}^{4}$. The…

In the burgeoning field of medical imaging, precise computation of 3D volume holds a significant importance for subsequent qualitative analysis of 3D reconstructed objects. Combining multivariate calculus, marching cube algorithm, and…

In view of solving problems of geometric realizability of polyhedra with given geometric constraints, we describe the space of geometric realizations of a simply-connected triangulated euclidean polyhedron in $\mathbb{R}^3$ up to similarity…

We give a bounded runtime solution to the homeomorphism problem for closed hyperbolic 3-manifolds. This is an algorithm which, given two triangulations of hyperbolic 3-manifolds by at most $t$ tetrahedra, decides if they represent the same…

Let $k \geq 2$ be a constant. Given any $k$ convex polygons in the plane with a total of $n$ vertices, we present an $O(n\log^{2k-3}n)$ time algorithm that finds a translation of each of the polygons such that the area of intersection of…