Related papers: Archimedes' Revenge
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 experimentally study the fundamental problem of computing the volume of a convex polytope given as an intersection of linear inequalities. We implement and evaluate practical randomized algorithms for accurately approximating the…
We prove the following Helly-type result. Let $\mathcal{C}_1,\dots,\mathcal{C}_{3d}$ be finite families of convex bodies in $\mathbb{R}^d$. Assume that for any colorful selection of $2d$ sets, $C_{i_k}\in \mathcal{C}_{i_k}$ for each $1\leq…
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…
We introduce the positive intersection product in Arakelov geometry and prove that the arithmetic volume function is continuously differentiable. As applications, we compute the distribution function of the asymptotic measure of a Hermitian…
We observe that a large part of the volume of a hyperbolic polyhedron is taken by a tubular neighbourhood of its boundary, and use this to give a new proof for the finiteness of arithmetic maximal reflection groups following a recent work…
A ball polyhedron is a finite intersection of congruent balls in $\mathbb{R}^3$. These shapes arise in various contexts in discrete and convex geometry. We focus on Reuleaux polyhedra, the subclass of ball polyhedra whose centers and…
This paper first gives a brief overview over some interesting descriptions of conic sections, showing formulations in the three geometric algebras of Euclidean spaces, projective spaces, and the conformal model of Euclidean space. Second…
We provide closed-form expressions for the first moments (i.e., the volume and volume-weighted centroid) of a polyhedron clipped by a paraboloid, that is, of a polyhedron intersected with the subset of the three-dimensional real space…
We determine the minimal volume of arithmetic hyperbolic orientable n-dimensional orbifolds (compact and non-compact) for every odd dimension n>3. Combined with the previously known results it solves the minimal volume problem for…
We propose a method for computing upper bounds for the Heilbronn problem for triangles.
We give an explicit description of the 3-ball quotients constructed by Couwenberg-Heckman-Looijenga, and deduce the value of their orbifold Euler characteristics. For each lattice, we also give a presentation in terms of generators and…
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…
We prove that if a closed hyperbolic 3-manifold M contains infinitely many totally geodesic surfaces, then M is arithmetic.
We construct and analyze a finite volume scheme for numerical solution of a three-dimensional Poisson equation. This is an extension of a two-dimensional approach by Suli 1991. Here we derive optimal convergence rates in the discrete H^1…
In this article we prove a conjecture of Bezdek, Brass, and Harborth concerning the maximum volume of the convex hull of any facet-to-facet connected system of n unit hypercubes in the d-dimensional Euclidean space. For d=2 we enumerate the…
We introduce and study arithmetic polygons. We show that these arithmetic polygons are connected to triples of square pyramidal numbers. For every odd $N\geq3$, we prove that there is at least one arithmetic polygon with $N$ sides. We also…
An algorithm for determining the list of smallest volume right-angled hyperbolic polyhedra in dimension 3 is described. This algorithm has been implemented on computer using the program Orb to compute volumes, and the first 825 polyhedra in…
A three-dimensional orthoscheme is defined as a tetrahedron whose base is a right-angled triangle and an edge joining the apex and a non-right-angled vertex is perpendicular to the base. A generalization, called complete orthoschemes, of…
We consider several problems that involve lines in three dimensions, and present improved algorithms for solving them. The problems include (i) ray shooting amid triangles in $R^3$, (ii) reporting intersections between query lines…