Take the 2-minute tour ×
MathOverflow is a question and answer site for professional mathematicians. It's 100% free, no registration required.

It is a theorem of Borel that there is a finite number of arithmetic hyperbolic manifolds of volume bounded above by $V.$ Is there any algorithm (or hope of an algorithm) to actually construct all of them, given $V?$ Also, if the number of such manifolds is $f(V)$ are there any bounds on $f?$

share|improve this question
I think you're looking for this reference: front.math.ucdavis.edu/0811.2482 –  Ian Agol Feb 6 '12 at 17:49
I agree that this gives the bound, but I am not sure about the algorithmic aspect. I will try to investigate... –  Igor Rivin Feb 6 '12 at 19:55

1 Answer 1

There should be an algorithm in principle. There's a couple of approaches. Given the estimates in this paper, one can bound from above the degree of the invariant trace field of an arithmetic hyperbolic 3-manifold with volume $\leq V$. This in turn leads to a lower bound on the injectivity radius $\epsilon(V)$ ( it is conjectured that there is a universal lower bound to the injectivity radius of closed arithmetic 3-manifolds; this is true if one restricts to arithmetic manifolds defined over a number field of bounded degree by Lemma 4.9 and the fact that the Mahler measure of an integral polynomial of bounded degree is bounded). Now construct all manifolds of volume $ \leq V$ with injectivity radius $\geq \epsilon(V)$. All arithmetic manifolds of volume $\leq V$ will appear among this list. One may perform this construction by bounding the number of tetrahedra in a triangulation (see e.g. Breslin), then gluing tetrahedra together in all possible ways, and computing whether they are arithmetic e.g. via Snap.

Another approach would be to construct all quaternion algebras over number fields of bounded degree with the appropriate ramification data coming from Borel's volume formula, and maximal orders in the quaternion algebras. Then compute presentations of the groups of units of the orders by applying Riley's algorithm to find a fundamental domain, then compute all finite index subgroups of bounded order by finding permutation representations.

share|improve this answer

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.