Abstract 1 Introduction 2 Preliminaries 3 Creating the 10-tetrahedra census 4 Applications References

The Complete 10-Tetrahedra Census of Orientable Cusped Hyperbolic 3-Manifolds

Shana Yunsheng Li ORCID Dept. of Math., University of Illinois Urbana-Champaign, IL, USA
Abstract

We extend the complete census of orientable cusped hyperbolic 3-manifolds to 10 tetrahedra, giving the next 150,730 manifolds and their 496,638 minimal ideal triangulations. As applications, we find the precisely 439,898 exceptional Dehn fillings on them, revealing the next 1,849 simplest hyperbolic knot exteriors in S3. We also give the simplest example of an orientable cusped hyperbolic 3-manifold containing a closed totally geodesic surface.

Keywords and phrases:
hyperbolic manifolds, 3-manifolds, triangulation, census, tabulation, exact computation, computational topology, low-dimensional topology
Copyright and License:
[Uncaptioned image] © Shana Yunsheng Li; licensed under Creative Commons License CC-BY 4.0
2012 ACM Subject Classification:
Mathematics of computing Geometric topology
Related Version:
Full Version: https://arxiv.org/abs/2512.02142 [33]
Supplementary Material:
Dataset: https://doi.org/10.7910/DVN/BFEXZA [34]
Acknowledgements:
The author wishes to thank Nathan Dunfield for his generous guidance during numerous discussions, and the Keeling cluster maintenance team at UIUC for providing the computational resources that made this project possible.
Funding:
This material is based upon work supported by the National Science Foundation under Grant No. DMS-2424139 while the author was in residence at the Simons Laufer Mathematical Sciences Institute in Berkeley, California, during the Spring 2026 semester. The author was also supported by the National Science Foundation under Grant No. DMS-2303572 during the same semester.
Editors:
Hee-Kap Ahn, Michael Hoffmann, and Amir Nayyeri

1 Introduction

The enumeration of examples has been of fundamental importance in the study of low-dimensional topology ever since Tait gave the first knot table in 1884 [41]. The censuses of knots have been extensively explored over the years, all the way to approximately the first 2 billion knots [28, 8, 43]. However, the censuses of orientable cusped hyperbolic 3-manifolds, initiated by Hildebrand and Weeks [25], have seen no progress after the 44,250 manifolds whose minimal ideal triangulations consist of 9 tetrahedra were given by Burton in 2014 [7]. In this paper, we extend the census by giving the 150,730 manifolds whose minimal ideal triangulations consist of 10 tetrahedra. Table 1 summarizes the timeline of the development of censuses of orientable cusped hyperbolic 3-manifolds.

Table 1: Timeline of censuses of orientable cusped hyperbolic 3-manifolds.
Tetrahedra Name of manifolds Year Contributor(s)
2 - 5 m003 m412 1989 Hildebrand & Weeks [25]
6 s000 s961 1999 Callahan, Hildebrand & Weeks [11]
7 v0000 v3551
8 t00000 t12845 2010 Thistlethwaite [42]
9 o9_00000 o9_44249 2014 Burton [7]
10 o10_000000 o10_150729 2025 L.

By hyperbolic 3-manifolds, we mean 3-manifolds with Riemannian metrics of constant curvature 1 that are complete as metric spaces; in particular their geodesics can be extended indefinitely in length. A hyperbolic 3-manifold is cusped if it has a topological end that is of finite volume. An orientable cusped finite-volume hyperbolic 3-manifold is homeomorphic to the interior of a compact 3-manifold whose boundary is a non-empty union of tori. Our main result is the following:

Theorem 1.

There are precisely 150,730 orientable cusped hyperbolic 3-manifolds whose minimal ideal triangulations consist of 10 tetrahedra. Moreover, there are precisely a total of 496,638 minimal ideal triangulations of these manifolds.

Table 5 in [33, Appendix A.2] gives the counts of manifolds in Theorem 1 by cusp number.

We highlight here that in order to obtain Theorem 1, we applied a new core technique, the verified canonical triangulations. We anticipate that a mixture of this technique with traditional ones would suffice for further extension of the census, provided successful generation of the candidates; see Sections 3.1 and 3.5 for more detailed discussions.

Throughout this paper, we assume triangulations consist of finitely many tetrahedra. If a cusped hyperbolic 3-manifold admits an ideal triangulation, each tetrahedron has finite volume [15, §2.5], hence the volume of the manifold is finite. Conversely, any cusped finite-volume hyperbolic 3-manifold has an ideal triangulation given by a refinement of the Epstein–Penner cellulation [37, §5]. Therefore, for cusped hyperbolic 3-manifolds, being finite-volume is equivalent to admitting ideal triangulations, hence we drop the term finite-volume when talking about cusped hyperbolic 3-manifolds admitting ideal triangulations.

In general, it is unknown whether all cusped finite-volume hyperbolic 3-manifolds admit geometric triangulations in the sense of Section 2.1 below [36]. However, when certifying hyperbolicity, SnapPy returns true if and only if it finds a geometric triangulation. Therefore an immediate corollary of this paper is that

Corollary 2.

All cusped hyperbolic 3-manifolds ideally triangulable by at most 10 tetrahedra admit geometric triangulations.

Note that nonorientable manifolds are included here since they are included in Theorem 7. For orientable manifolds, the above result can be strengthened to Proposition 11.

We briefly review the needed terminologies in Section 2, then give detailed discussions in Section 3 for the creation of the 10-tetrahedra census, after which we give some applications of the extended census in Section 4. All corresponding code and data are available at [34].

2 Preliminaries

2.1 Triangulations

A (generalised) triangulation 𝒯 is a disjoint union of finitely many tetrahedra, with some or all faces identified in pairs via simplicial maps, and we avoid identifications where an edge is identified with itself in reverse. Note that 𝒯 is not necessarily a simplicial complex, as identifications of two faces of the same tetrahedron are allowed.

Quotienting by the identifications, 𝒯 can be seen as a topological space, along with a cellular structure induced by the tetrahedra. A vertex in 𝒯 is a 0-cell in this cellular structure, and an edge is a 1-cell. The link of a vertex in 𝒯 is the frontier of a small regular neighborhood of that vertex. A vertex is internal if its link is a sphere, and is ideal if its link is some other closed surface. For an edge e in 𝒯, its degree is the cardinality of the set

𝒮et{3-cells of 𝒯}{(nonempty) connected components of 𝒩et},

where 𝒩e is a small regular neighborhood of the midpoint of e.

Definition 3.

Let M be the interior of a compact 3-manifold with boundary. A triangulation 𝒯 is an ideal triangulation of M if it is homeomorphic to M after removing its ideal vertices, and is minimal if no ideal triangulation of M with fewer tetrahedra exists.

It follows that every vertex of an ideal triangulation is either internal or ideal. Note that an ideal triangulation itself is not a manifold and has at least one ideal vertex.

If M is a cusped hyperbolic 3-manifold, an ideal triangulation 𝒯 of M is geometric if all vertices are ideal, all edges are geodesics, all 2-cells are parts of geodesic planes, and no flat or negatively oriented tetrahedron (i.e. with zero or negative volume) exists.

The following results were proven in Section 3 of [7]:

Lemma 4 (Burton).

Let 𝒯 be a minimal ideal triangulation of a cusped hyperbolic 3-manifold. Then 𝒯 contains no internal vertices.

Lemma 5 (Burton).

Let 𝒯 be a minimal ideal triangulation of a cusped hyperbolic 3-manifold. Then 𝒯 has no edges of degree 1 or 2, and 𝒯 has no edges of degree 3 that are contained in three distinct tetrahedra.

2.2 Normal surfaces

In a tetrahedron, an arc α properly embedded in one of its faces is normal if the endpoints of α are in the interior of distinct edges. A properly embedded disk is a triangle if its boundary consists of three normal arcs in distinct faces, and is a square if its boundary consists of four normal arcs in distinct faces.

Let 𝒯 be a triangulation. A properly embedded compact surface in 𝒯 is normal if its intersection with every tetrahedron in 𝒯 (with the identifications undone) is a properly embedded surface whose connected components consist of only triangles and squares.

An isotopy of 𝒯 is normal if it preserves the cellular structure of 𝒯. Up to normal isotopy, there are 4 triangles and 3 squares in a tetrahedron. Multiple copies of triangles or squares in the same normal isotopy class may appear in the intersection of a normal surface and a tetrahedron. It follows that a normal surface in a triangulation of n tetrahedra is uniquely determined by a vector in 7n up to normal isotopy, where {kk0}.

The subset 𝒩{𝒗7n𝒗 represents a normal surface} consists of integral vectors in a certain non-convex subset of a polyhedral cone in 7n [29]. The standard vertex normal surfaces correspond to vertices of a cross-section of this polyhedral cone, and can be viewed as forming a finite basis for 𝒩.

The following result was proven in Section 3 of [7]:

Lemma 6 (Burton).

Let 𝒯 be a minimal ideal triangulation of a cusped hyperbolic 3-manifold. Then no standard vertex normal surface in 𝒯

  • has positive Euler characteristic; or

  • has zero Euler characteristic, is not a vertex link, and in addition

    • is one-sided; or

    • is two-sided, and if we cut 𝒯 open along it then no component of the resulting space is a solid torus or solid Klein bottle.

3 Creating the 10-tetrahedra census

3.1 Overview

To build a census (of knots, manifolds, etc), the procedure generally follows a 3-step outline:

  1. (i)

    Generate all candidates for the census.

  2. (ii)

    Decide the eligibility of each candidate.

  3. (iii)

    Group eligible candidates into isomorphism classes and certify that the isomorphism classes are all distinct.

As long as the candidate generation is performed exhaustively and the eligibility for each candidate is decided correctly, the census obtained is guaranteed to contain all wanted objects. With step (iii), the resulting census will contain no duplicates. We say that a census is complete if it contains all wanted objects without any duplicated ones.

For censuses of cusped hyperbolic 3-manifolds, the candidates will be ideal triangulations consisting of a given number of tetrahedra, and the eligibility conditions will be minimality (of triangulations) and hyperbolicity (of manifolds the triangulations represent). For certifying distinctness, algebraic invariants were widely applied for both the census of hyperbolic 3-manifolds [7] and the census of knots [28, 8, 43]. However, it is unknown whether algebraic methods will indeed separate all given isometry classes within a given scope, consequently they cannot be used to certify if two isometry classes are indeed the same, and other methods will be required for that purpose. Here we propose an alternative approach for cusped hyperbolic 3-manifolds, using a geometric invariant, the canonical triangulation, built upon the Epstein–Penner canonical cellulation [21] by Weeks [44], whose rigorous computation was implemented by Goerner [24]. An introduction to these can be found in [22], and we review them briefly in Section 3.3.1. The canonical triangulation, when computed rigorously, is a complete invariant of cusped hyperbolic 3-manifolds, and we applied it to deduplicate a majority of triangulations in the 10-tetrahedra census in Section 3.3.3.

Our approaches for steps (i) and (ii) largely overlap with those in [7]. For completeness, we briefly describe them in Section 3.2, and kindly refer the reader to [7] for more details. For step (iii), detailed discussions will be given in Section 3.3.

3.2 Candidate generation and eligibility tests

Let us start by looking at Table 2. The steps proceed from top to bottom. Each row consists of the name of the step, the number of remaining candidates whose hyperbolicity is unknown, the numbers of candidate discarded within that step due to ineligibility, and the number of candidates kept to be dealt with later in Section 3.3.3.

Table 2: The steps of filtering candidates for the 10-tetrahedra census.
Step Candidates Discarded Kept
Candidate generation 8,373,308 0 0
Greedy nonminimality 1,946,782 6,426,526 0
Certify hyperbolicity (r=1) 1,072,874 0 873,908
Exhaustive nonminimality (h=2) 698,650 374,224 0
Special surfaces 33,807 664,843 0
Certify hyperbolicity (r=60) 3,269 0 30,538
Exhaustive nonminimality (h=5) 12 3,257 0
Exhaustive nonminimality (h=6) 6 6 0
Certify hyperbolicity (r=1000) 0 0 6
Total 8,373,308 7,468,856 904,452

For candidate generation, we used Regina’s utility command tricensus to generate all ideal triangulations consisting of 10 tetrahedra except those that are obviously nonminimal or non-hyperbolic. More precisely, we obtained:

Theorem 7.

Up to relabelling, there are 8,373,308 ideal triangulations with 10 tetrahedra, in which every vertex is ideal, there are no edges of degree 1 or 2, and there are no edges of degree 3 that belong to three distinct tetrahedra.

Due to Lemmas 4 and 5, the triangulations described in Theorem 7 contain all minimal ideal triangulations of cusped hyperbolic 3-manifolds whose minimal ideal triangulations consist of 10 tetrahedra. Note that triangulations representing nonorientable manifolds are also included and carried through the tests, though we will discard them in Section 3.3.

With the candidates generated, we proceed to determine their eligibilities. For an ideal triangulation to remain in the census, it must be both minimal and representing a cusped hyperbolic 3-manifold. Hence an ideal triangulation is discarded immediately if it is certified to be nonminimal or representing a non-hyperbolic 3-manifold. If an ideal triangulation is certified to represent a cusped hyperbolic 3-manifold, we temporarily keep it, and decide whether it is minimal by checking if it represents a manifold that has already appeared in censuses with fewer tetrahedra, which we discuss in Section 3.3.

Four tests were used in Table 2, which we describe below:

Greedy nonminimality:

we use Regina’s highly efficient simplification algorithm [5] to try converting each candidate into an ideal triangulation with fewer tetrahedra, while representing the same 3-manifold. If such a triangulation with fewer tetrahedra is found, then the candidate is nonminimal.

Exhaustive nonminimality:

given an integer parameter h>0, for each candidate with n tetrahedra (n=10 in our settings), enumerate all triangulations that can be reached via 2-3 and 3-2 Pachner moves without ever exceeding n+h tetrahedra. If a triangulation with fewer than n tetrahedra is found during the process, the candidate is nonminimal.

Special surfaces:

for each candidate 𝒯, enumerate all standard vertex normal surfaces in it, and check if any of them

  • has positive Euler characteristic; or

  • has zero Euler characteristic, is not a vertex link, and in addition

    • is one-sided; or

    • is two-sided, and if we cut 𝒯 open along it then no component of the resulting space is a solid torus or solid Klein bottle.

If any such surface is found, then by Lemma 6, 𝒯 is either nonminimal or does not represent a cusped hyperbolic 3-manifold.

Certify hyperbolicity:

given an integer parameter r>0, for each candidate 𝒯, we randomize it by doing random Pachner moves, and ask SnapPy to try finding a complete hyperbolic structure on 𝒯, which uses an algorithm similar to HIKMOT’s [27], where affirmative answers are rigorous [24]. If the answer is not affirmative, we randomize 𝒯 and try again, until an affirmative answer is achieved or the number of attempts reaches r.

We summarize the tests along with their core functions in Table 4 in [33, Appendix A.1].

As is presented in Table 2, for each candidate, an affirmative answer was given by one of the above four tests. A candidate was kept if and only if the affirmative answer was given by the certify hyperbolicity test, and was discarded otherwise. As such, we obtained 904,452 triangulations certified to represent cusped hyperbolic 3-manifolds at the bottom of Table 2, with all others discarded.

3.3 Grouping and Separating

In this section, we discuss the procedure for step (iii) described in Section 3.1. A central tool for it, in both [7] and our method, is the canonical triangulation of cusped finite-volume hyperbolic 3-manifolds.

3.3.1 Canonical triangulation

We review the definition and computation of canonical triangulations very briefly, and refer the reader to [22] for more details.

Consider the (3+1)-Minkowski space 𝔼3,14 whose inner product , is defined by 𝒙,𝒚i=02xiyix3y3. The hyperboloid S+{𝒙𝔼3,1x3>0,𝒙,𝒙=1} is isometric to 3. Given a cusped hyperbolic 3-manifold M, for each cusp of M we choose a horotorus cusp neighborhood of the same volume; each neighborhood is bounded by a torus, which lifts to horospheres in 3S+. For each horosphere S+, its normal vector 𝒗 in 𝔼3,1 satisfies 𝒗,𝒗=0, and we normalize it so that 𝒗,𝒘=1 for any 𝒘. Therefore we obtain a family {𝒗}M of such vectors associated to a cusped hyperbolic 3-manifold M.

Definition 8.

The Epstein–Penner cellulation of M is given by the radial projection of the polygonal faces of the convex hull of {𝐯}M onto S+.

The Epstein–Penner cellulation is invariant under the choice of the volume of cusp neighborhoods, hence it is an invariant of cusped hyperbolic 3-manifolds [21]. It is generically a triangulation, but not always so. Given a polygonal cellulation of a 3-manifold, one can subdivide it into the triangulation induced by the following refinement of its 1-skeleton:

  • add a vertex in the interior of each 2-cell and 3-cell;

  • for each 2-cell or 3-cell e, let v be the vertex added to its interior:

    • for each vertex u originally in e, add an edge connecting v and u;

    • if e is a 3-cell, for each 2-cell e2 on the boundary of e, add an edge connecting v and the vertex added to the interior of e2.

Definition 9.

The canonical triangulation of M is the Epstein–Penner cellulation of M if the latter is a triangulation, and the subdivision of the Epstein–Penner cellulation described above otherwise.

Weeks established a heuristic procedure which, given a geometric triangulation, computes the Epstein–Penner cellulation of the corresponding cusped hyperbolic 3-manifold via local modifications, doing 2-3 and 3-2 Pachner moves wherever tetrahedra meet concavely at faces or edges [44]. The canonical triangulation can then be easily computed from the Epstein–Penner cellulation. The methods for both were implemented in SnapPea in the 1990s, and later inherited by its successor SnapPy [13]. In their original implementations, the hyperbolic structures used were only recorded numerically, hence accuracy issues may come into play, which we discuss in the following two sections.

3.3.2 Burton’s method: algebraic certification

Let us briefly review the method Burton used in [7], which can be summarized as:

  1. 1.

    For each ideal triangulation, compute its canonical triangulation numerically using SnapPea, and partition them into classes by the canonical triangulations computed.

  2. 2.

    For triangulations in each class, perform an exhaustive search through 2-3 and 3-2 Pachner moves, attempting to identify classes that should have been merged in step 1, but were not due to numerical accuracy issues, thus refining the partitioning.

  3. 3.

    For each class, compute the list {orientability,H1=π1ab,S2ab(π1),,Skab(π1)} of algebraic invariants to certify that all groups are distinct, increasing k if necessary, where Siab(G) is the multi-set of abelianisations of index i subgroups of G, one subgroup for each conjugacy class. For the 9-tetrahedra census, k=11 was required and sufficed.

Note that to confirm the completeness of previous censuses, Burton dealt with all candidates with no more than 9 tetrahedra at once, hence triangulations that were grouped with triangulations with fewer tetrahedra were discarded immediately due to nonminimality.

There are several aspects where numerical computation could cause issues in step 1:

  • A quantity tilt is used to characterize whether tetrahedra meet concavely, parallelly or convexly, each corresponding to the tilt being positive, zero, or negative respectively [44, 40]. When the absolute value of tilt is small, the numerical computation may falsely recognize the sign of tilt, resulting in an incorrect canonical triangulation.

  • Flat tetrahedra being falsely recognized as non-flat, which would then be incorrectly dealt with when subdividing Epstein–Penner triangulations into canonical triangulations.

When the above issues arise in step 1, SnapPea/SnapPy fails to find the correct canonical triangulation and arrives at an incorrect one, while still representing the same manifold as the input triangulation. Hence steps 2 and 3 were necessary to spot and resolve these miscomputed cases. However, steps 2 and 3 can be very expensive to perform, and require back-and-forth adjustments of parameters. Furthermore, although successful for censuses with at most 9 tetrahedra, it is unknown whether step 3 will separate all cases within a computable scope, or even if it will separate all of them in theory [23].

 Remark 10.

We remark here that the subdividing algorithm Weeks implemented in SnapPea/SnapPy does not work for refinements of Epstein–Penner cellulations containing flat tetrahedra. This led to the miscomputed example x101 found by Burton [6] and mentioned in [22, Remark 3.6]. The cause of the miscomputation was not located at the time of [22]. During the course of this project, the author found another such example, o9_43806 and located the said cause. This bug has been fixed in SnapPy 3.3 by forcing it to find a refinement that does not contain flat tetrahedra before proceeding to subdividing it. After the fix, the numerical computation gives correct results for all minimal triangulations in the orientable cusped censuses of at most 10 tetrahedra, which we confirmed using the verified computation explained in Section 3.3.3 (as long as successfully computed).

3.3.3 Our method: verified computation

Instead of making up for the mistakes caused by numerical computation of canonical triangulations using other methods, we enhance the computation itself to avoid the mistakes directly. With the accuracy issues described in the previous section, this requires us to:

  1. (a)

    given two supposedly different quantities, rigorously tell which one is larger;

  2. (b)

    given two supposedly equal quantities, prove that they are equal.

For (a), we use interval arithmetics, which can be thought of as computation with controlled errors. If two quantities are different, with sufficiently small error the lower bound of one will be strictly larger than the upper bound of another, revealing the larger quantity. Similar approach was also used in HIKMOT’s rigorous certification of hyperbolicity [27].

For (b), we use the LLL algorithm [32] to symbolically solve the trace field of hyperbolic structure, representing it as a number field. We then express the quantities as elements in the number field, hence they are equal if and only if their difference is the zero element.

The above enhanced computation was implemented in SnapPy by M. Goerner [24], and is called verified computation. We refer the reader to [20, 22] for more detailed discussions.

Canonical triangulations obtained with verified computation are thus provably correct. Let us call a supposedly canonical triangulation obtained by SnapPy a verified canonical triangulation if it was obtained with verified computation, and an unverified canonical triangulation if the computation was performed purely numerically.

Let {𝒯} be the set of ideal triangulations representing cusped hyperbolic 3-manifolds and {} be the set of cusped finite-volume hyperbolic 3-manifolds. Let ι:{𝒯}{} be the function that maps an ideal triangulation to the manifold it represents. The unverified canonical triangulation can thus be seen as a multi-valued function cu:{}{𝒯} which is a right inverse of ι; in other words, the following diagram commutes:

(1)

In particular, cu is injective. The verified canonical triangulation is then a branch of cu, a single-valued function cv:{}{𝒯}. Since cu is injective, cv is also injective, hence restricts to a bijection between {} and its image. Therefore the verified canonical triangulation is a complete invariant of cusped finite-volume hyperbolic 3-manifolds.

Although the definition of canonical triangulation does not require the manifold to be orientable, the current implementation of verified computation for canonical triangulations in SnapPy does not work for nonorientable ones with multiple cusps. Hence we discard the nonorientable candidates and deal with the remaining 608,918 orientable ones.

We successfully computed the verified canonical triangulations for all except 16 of the 608,918 orientable candidates. The 16 cases failed due to their trace fields being too complicated; we remark that this very nature intrinsically separates them from the others, though further investigation is still required to prove it. By comparing the results with the verified canonical triangulations of all manifolds in censuses of at most 9 tetrahedra, we obtained 496,622 minimal triangulations of 10 tetrahedra, which, grouped by their verified canonical triangulations, give 150,724 distinct manifolds. For the 16 candidates whose verified canonical triangulations were not computed, we computed the first 60 digits of their hyperbolic volumes using interval arithmetics [24] and their first homology groups, which separated them from all manifolds in censuses up to 9 tetrahedra plus the 150,724 ones, and grouped them into 6 classes; within each class, the triangulations were confirmed to all represent the same manifold as their unverified canonical triangulations are the same.

Therefore, we conclude that there are exactly 150,730 isometry classes in the 10-tetrahedra census, containing a total of 496,638 minimal triangulations, obtaining Theorem 1.

3.4 Finalizing the census

For each of the 150,730 isometry classes obtained in Section 3.3, we select a representative triangulation by the following procedure:

  1. (1)

    If the verified canonical triangulation is in the isometry class, let it be the representative.

  2. (2)

    Otherwise, consider the subset of triangulations that are geometric, which turns out to be never empty. If there is only one triangulation in the class, let it be the representative.

  3. (3)

    If there are multiple triangulations in that subset, let the triangulation with the most self-isomorphisms, i.e. cellular homeomorphisms onto itself, be the representative.

  4. (4)

    If there are multiple triangulations with the most self-isomorphisms, choose the one with the “fattest” tetrahedra, i.e. the one with the largest minimum imaginary part of tetrahedron shape parameters.

  5. (5)

    If there are still multiple options left, choose the one with the smallest triangulation signature (as defined in [4]) under the lexicographical order.

With the representative triangulations chosen as above, we set their peripheral curves to be the shortest. We then ordered them by volume, named them as displayed in Table 1, saved and published the data in [34]. The data now comes automatically with SnapPy 3.3.

Note that verified canonical triangulations, by construction, are always geometric [22]. Hence due to the geometric requirement in step (2), we obtained

Proposition 11.

Every cusped hyperbolic 3-manifold in the 10-tetrahedra census admits a minimal triangulation that is geometric.

We remark that the above proposition also holds for all (orientable) censuses with fewer tetrahedra, which we checked using Burton’s data from [7].

3.5 Obstructions on further extending the census

As is discussed in Section 3.1, there are essentially three steps for creating a complete census. For the census of (orientable) cusped hyperbolic 3-manifolds, step (ii) should not be a problem, as there are several other tests proposed in [7], but were not used when creating the 10-tetrahedra census. For step (iii), the verified computation has a chance of failing only when the LLL algorithm is invoked, which happens only when a tilt that is extremely close to zero is encountered during computation. This essentially implies that the Epstein–Penner cellulation is not a triangulation, which is the case for only 986 triangulations out of the 608918 orientable candidates mentioned in Section 3.3.3, a frequency less than 0.2%. Therefore, it is promising that a combination of verified canonical triangulations with algebraic methods would suffice in the foreseeable future, where the former separates most manifolds, and the latter deals with the rest.

The main obstruction thus lives in step (i), where an exponential growth rate of the computational power is needed, with a much larger base compared to tabulating knots [39]. If one were to include nonorientable candidates during generation (as we did in Theorem 7), even though the algorithm established in [7] is already extremely efficient, it still takes approximately 2 years to generate all candidates with 10 tetrahedra in a single thread of 2.6 GHz, about 50 times longer than to generate all candidates with 9 tetrahedra; we accelerated the process by parallelizing it in 300 threads. Thus, assuming the same growth rate, it will take approximately 100 years to generate all candidates with 11 tetrahedra with a single thread of 2.6 GHz, and hence 4 months in 300 threads.

The time consumption and growth rate can both be lowered by excluding nonorientable candidates during generation, as half of identifications of each face will be excluded from the beginning. It takes 2 months to enumerate all orientable candidates with 10 tetrahedra in a single thread, about 25 times longer than for 9 tetrahedra. We successfully generated all orientable candidates with 11 tetrahedra, which took about 6 years in a single thread, giving Theorem 12. We have now completed the 11-tetrahedra orientable census, with a preliminary SnapPy module available at [35], and full details to appear in a future publication.

Theorem 12.

Up to relabelling, there are 27,794,289 ideal triangulations of orientable 3-manifolds with 11 tetrahedra, in which every vertex is ideal, there are no edges of degree 1 or 2, and there are no edges of degree 3 that belong to three distinct tetrahedra.

4 Applications

A substantial amount of follow-up work can be done with the extended census. We describe several of them in this section.

4.1 Extending the census of exceptional Dehn fillings

Let M¯ be a compact orientable 3-manifold whose interior M is a 1-cusped hyperbolic 3-manifold; in particular M¯ is a torus, and M has finite volume. Dehn fillings on M are characterized by slopes on M¯, which are unoriented isotopy classes of simple closed curves on the torus. For a slope α, we denote by M(α) the closed manifold obtained by Dehn filling on M so that α bounds a disk in the attached solid torus D2×S1.

Definition 13.

A slope α is exceptional if M(α) is not hyperbolic.

The census of exceptional Dehn fillings will consist of pairs (M,α), where α is exceptional.

By deleting a cusp neighborhood N of M, we obtain a compact 3-manifold MN with torus boundary which is isotopic to M¯. Slopes on M¯ can thus be carried by the isotopy onto (MN)M. By taking N to be maximal, we define the length of a slope to be the minimum length of all curves in its isotopy class on (MN).

Agol [1] and Lackenby [31] independently proved that lengths of exceptional slopes cannot exceed 6. It follows that there are only finitely many exceptional fillings on a 1-cusped finite-volume hyperbolic 3-manifold. Therefore it is possible to give complete lists of exceptional Dehn fillings on 1-cusped hyperbolic 3-manifolds in the censuses. For censuses of at most 9 tetrahedra, this has been done by Dunfield [17]. For the 10-tetrahedra census, we obtained:

Theorem 14.

There are precisely 439,898 exceptional Dehn fillings on orientable 1-cusped hyperbolic 3-manifolds in the 10-tetrahedra census.

Table 3 outlines the procedure for obtaining Theorem 14. There are 144,016 1-cusped hyperbolic 3-manifolds in the 10-tetrahedra census. For each of them, we enumerated all slopes with length no more than 6, obtaining a total of 800,447 candidates for the exceptional census. As no duplicate slopes were enumerated for a given manifold, all candidates are distinct, and we only need to decide the hyperbolicity for each of them.

Table 3: The steps for creating the 10-tetrahedra exceptional census.
Step Candidates Discarded Confirmed
Candidate generation 800,447 0 0
Certify hyperbolicity 439,933 360,514 0
Regina census lookup 11,540 24 428,369
Essential S2 or torus 11 0 11,529
Identified to be m135(1,3) 0 11 0
Total 800,447 360,549 439,898

For each candidate (M,α), we consider its filled manifold M(α). Several rounds of certifying the hyperbolicity of M(α) with SnapPy reduced the remaining list by nearly a half. For Regina census lookup, we cut M(α) into connected sum summands and used regina.Census.lookup to try obtaining a name classifying it, which then tells us whether M(α) is hyperbolic or not. For those whose names were not obtained, we check whether they have fundamental normal surfaces which are essential S2 or tori; if they do, they are not hyperbolic. Only 11 candidates remain undetermined after this, and their filled manifolds were all identified as m135(1,3) by SnapPy. m135(1,3) is isometric to m412(1,-3)(-3,1) whose triangulation in SnapPy is certified to be geometric, hence m135(1,3) is hyperbolic.

Applying regina.Triangulation3.isSphere on fillings in Theorem 14 reveals that

Theorem 15.

There are precisely 1,849 manifolds in the 10-tetrahedra census that are exteriors of knots in S3.

For censuses of at most 9 tetrahedra, similar work have been done by Callahan, Dean and Weeks [10], Champanerkar, Kofman and Patterson [12] and Dunfield [17].

Many conjectures and results mentioned in [17] can be tested and updated against the extended exceptional census. We plan to address these in a future publication.

4.2 Thurston norm and twisted Alexander polynomial

Given an orientable cusped hyperbolic 3-manifold M with Betti number b1(M)=1 and an SL(2,)-lift ρ~ of its holonomy representation ρ:π1(M)PSL(2,), we consider its twisted Alexander polynomial τ2,ρ~(M)[t±1], defined by Dunfield, Friedl and Jackson [18, §2]. It was proved in [18] that

x(M)12degτ2,ρ~(M), (2)

where x(M) is the Thurston norm of a generator of H1(M;), and Equation 2 is an equality if M fibers over S1. Moreover, if M fibers over S1, then τ2,ρ~(M) is monic.

In [19], Dunfield, Garoufalidis and Yoon asked whether for any orientable cusped hyperbolic 3-manifold with b1(M)=1, there is at least one lift ρ~ such that Equation 2 is an equality. An affirmative answer was then experimentally given for all such manifolds in the censuses of at most 9 tetrahedra, a sample size of 59,068 manifolds.

We extended the experimentation to the 10-tetrahedra census. There are 143,919 manifolds in the 10-tetrahedra census with b1(M)=1. By applying the code in [14], we were able to compute the Thurston norms for all except the following 21 of them:

o10_077959 o10_076513 o10_091925 o10_073669 o10_067720 o10_102779 o10_142965 (3)
o10_141638 o10_146022 o10_140310 o10_091511 o10_122772 o10_147820 o10_127911
o10_120303 o10_145417 o10_136855 o10_136895 o10_148034 o10_143501 o10_138268

Out of the 21 manifolds in Equation 3, the following 9 were confirmed to not fiber over S1, as their twisted Alexander polynomials are not monic:

o10_076513 o10_091925 o10_142965 o10_091511 o10_136855 (4)
o10_136895 o10_148034 o10_143501 o10_138268

For the remaining 143,898 manifolds whose Thurston norms were successfully computed, we numerically computed their twisted Alexander polynomials of all SL(2,)-lifts. After taking the maximum degrees, we found that Equation 2 is an equality for all of them.

4.3 Homology 3-spheres and the L-space conjecture

The L-space conjecture asserts that for an irreducible -homology 3-sphere Y, the following are equivalent:

  1. (a)

    π1(Y) is left-orderable;

  2. (b)

    Y has non-minimal Heegaard Floer homology;

  3. (c)

    Y admits a taut foliation.

The equivalence of (a) and (b) was proposed by Boyer, Gordon and Watson [3]. The equivalence of (b) and (c) was asked by Ozsváth and Szabó [38] after they proved that (c) implies (b), and upgraded to a conjecture by A. Juhász [30]. For -homology spheres, Calegari and Dunfield [9] proved that (c) implies (a).

Dunfield [16] showed that the L-space conjecture holds on at least 62.2% of 307,301 hyperbolic -homology 3-spheres, obtained by Dehn fillings on orientable 1-cusped hyperbolic 3-manifolds in censuses of at most 9 tetrahedra. It was conjectured in [16] that these are precisely the filled manifolds from those censuses with lengths of systoles being at least 0.2.

While there are infinitely many hyperbolic -homology 3-spheres obtained by Dehn fillings on a finite set of orientable 1-cusped hyperbolic 3-manifolds, a finite list is obtained if we bound the list by the length of systoles, i.e. the shortest geodesics, from below, as the following result was shown by Hodgson and Kerckhoff [26]:

Lemma 16 (Hodgson & Kerckhoff).

Let M¯ be a compact orientable 3-manifold with torus boundary whose interior M is hyperbolic, and α be a slope on M¯. If M(α) is hyperbolic with systole length at least 0.163, then the normalized length of α is no more than 7.515.

Here, the normalized length of α is the length of α divided by the area of (MN).

Similarly to Section 4.1, for the 1-cusped hyperbolic 3-manifolds in the 10-tetrahedra census, by enumerating all slopes with normalized length no more than 7.515, excluding all exceptional slopes, and filtering by the length of systole, we obtained a list of 1,899,974 fillings containing all pairs (M,α) such that M(α) is a hyperbolic -homology 3-sphere with length of systole at least 0.163. Therefore,

Theorem 17.

There are precisely 1,899,974 pairs (M,α) where M is a 1-cusped hyperbolic 3-manifold in the 10-tetrahedra census and α is a slope such that M(α) is a hyperbolic -homology 3-sphere with length of systole at least 0.163.

Changing to in Theorem 17, the number of pairs becomes 10,729.

Note that, although the pairs (M,α) in Theorem 17 are all distinct, the filled manifolds M(α) are not; for instance, there are at least 22 pairs in the list such that M(α) is identical to m007(3,1). It remains to group the pairs into distinct isometry classes by M(α), compare the grouped list against the list of 307,301 manifolds in [16], and test the L-space conjecture on it. We wish to address these in a future publication.

4.4 Closed totally geodesic surfaces

An embedded surface S in a hyperbolic 3-manifold M is called totally geodesic if every geodesic in S is also a geodesic in M. The existence of closed totally geodesic surfaces is of particular interest.

An algorithm that is guaranteed to find all closed totally geodesic surfaces (up to isotopy) in a given orientable cusped finite-volume hyperbolic 3-manifold was built and used to find several examples of cusped hyperbolic 3-manifolds with closed totally geodesic surfaces by Basilio, Lee and Malionek [2]; however, none was found in the censuses of at most 9 tetrahedra. By applying their algorithm to the 10-tetrahedra census, we found that

Theorem 18.

The 2-cusped manifold o10_143602, whose volume is approximately 9.1345 and first homology group is 26, is the only manifold containing closed totally geodesic surfaces in the orientable cusped hyperbolic censuses of at most 10 tetrahedra. Moreover, o10_143602 contains exactly one such surface up to isotopy, which is nonorientable with Euler characteristic 1.

In particular, among all orientable cusped hyperbolic 3-manifolds containing closed totally geodesic surfaces, o10_143602 is the one whose minimal triangulations have the fewest tetrahedra; in other words, it is the simplest such example.

References

  • [1] Ian Agol. Bounds on exceptional Dehn filling. Geom. Topol., 4(1):431–449, 2000. doi:10.2140/gt.2000.4.431.
  • [2] Brannon Basilio, Chaeryn Lee, and Joseph Malionek. Totally Geodesic Surfaces in Hyperbolic 3-Manifolds: Algorithms and Examples. In Wolfgang Mulzer and Jeff M. Phillips, editors, 40th International Symposium on Computational Geometry (SoCG 2024), volume 293 of Leibniz International Proceedings in Informatics (LIPIcs), pages 14:1–14:19, Dagstuhl, Germany, 2024. Schloss Dagstuhl – Leibniz-Zentrum für Informatik. doi:10.4230/LIPIcs.SoCG.2024.14.
  • [3] Steven Boyer, Cameron McA Gordon, and Liam Watson. On L-spaces and left-orderable fundamental groups. Math. Ann., 356(4):1213–1245, 2013. doi:10.1007/s00208-012-0852-7.
  • [4] Benjamin A. Burton. The Pachner graph and the simplification of 3-sphere triangulations. In Computational geometry (SCG’11), pages 153–162. ACM, New York, 2011. doi:10.1145/1998196.1998220.
  • [5] Benjamin A. Burton. Computational topology with Regina: algorithms, heuristics and implementations. In Geometry and topology down under, volume 597 of Contemp. Math., pages 195–224. Amer. Math. Soc., Providence, RI, 2013. doi:10.1090/conm/597/11877.
  • [6] Benjamin A. Burton. A duplicate pair in the SnapPea census. Exp. Math., 23(2):170–173, 2014. doi:10.1080/10586458.2014.886535.
  • [7] Benjamin A. Burton. The cusped hyperbolic census is complete. Trans. Am. Math. Soc., pages 1–, 2017. doi:10.1090/tran/6767.
  • [8] Benjamin A. Burton. The next 350 million knots. In 36th International Symposium on Computational Geometry, volume 164 of LIPIcs. Leibniz Int. Proc. Inform., pages Art. No. 25, 17. Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2020. doi:10.4230/LIPIcs.SoCG.2020.25.
  • [9] Danny Calegari and Nathan M. Dunfield. Laminations and groups of homeomorphisms of the circle. Invent. Math., 152(1):149–204, 2003. doi:10.1007/s00222-002-0271-6.
  • [10] Patrick J. Callahan, John C. Dean, and Jeffrey R. Weeks. The simplest hyperbolic knots. J. Knot Theory Ramifications, 8(3):279–297, 1999. doi:10.1142/S0218216599000195.
  • [11] Patrick J. Callahan, Martin V. Hildebrand, and Jeffrey R. Weeks. A census of cusped hyperbolic 3-manifolds. Math. Comp., 68(225):321–332, 1999. With microfiche supplement. doi:10.1090/S0025-5718-99-01036-4.
  • [12] Abhijit Champanerkar, Ilya Kofman, and Eric Patterson. The next simplest hyperbolic knots. J. Knot Theory Ramifications, 13(7):965–987, 2004. doi:10.1142/S021821650400355X.
  • [13] Marc Culler, Nathan M. Dunfield, Matthias Goerner, and Jeffrey R. Weeks. SnapPy, a computer program for studying the geometry and topology of 3-manifolds. Available at http://snappy.computop.org (28/10/2025).
  • [14] Nathan Dunfield, Stavros Garoufalidis, and Seokbeom Yoon. Code and data for comparing 1-loop invariants and torsions, 2024. doi:10.7910/DVN/XUJ3RH.
  • [15] Nathan M. Dunfield. Cyclic surgery, degrees of maps of character curves, and volume rigidity for hyperbolic manifolds. Invent. Math., 136(3):623–657, 1999. doi:10.1007/s002220050321.
  • [16] Nathan M Dunfield. Floer homology, group orderability, and taut foliations of hyperbolic 3–manifolds. Geom. Topol., 24(4):2075–2125, 2020. doi:10.2140/gt.2020.24.2075.
  • [17] Nathan M. Dunfield. A census of exceptional Dehn fillings. In Characters in low-dimensional topology, volume 760 of Contemp. Math., pages 143–155. Amer. Math. Soc., [Providence], RI, [2020] ©2020. doi:10.1090/conm/760/15289.
  • [18] Nathan M. Dunfield, Stefan Friedl, and Nicholas Jackson. Twisted Alexander polynomials of hyperbolic knots. Exp. Math., 21(4):329–352, 2012. doi:10.1080/10586458.2012.669268.
  • [19] Nathan M Dunfield, Stavros Garoufalidis, and Seokbeom Yoon. 1-loop equals torsion for fibered 3-manifolds. arXiv.org, 2024. URL: https://arxiv.org/abs/2304.00469.
  • [20] Nathan M. Dunfield, Neil R. Hoffman, and Joan E. Licata. Asymmetric hyperbolic L-spaces, Heegaard genus, and Dehn filling. Math. Res. Lett., 22(6):1679–1698, 2015. doi:10.4310/MRL.2015.v22.n6.a7.
  • [21] D. B. A. Epstein and R. C. Penner. Euclidean decompositions of noncompact hyperbolic manifolds. J. Differential Geom., 27(1):67–80, 1988. doi:10.4310/jdg/1214441650.
  • [22] Evgeny Fominykh, Stavros Garoufalidis, Matthias Goerner, Vladimir Tarkaev, and Andrei Vesnin. A census of tetrahedral hyperbolic manifolds. Exp. Math., 25(4):466–481, 2016. doi:10.1080/10586458.2015.1114436.
  • [23] Giles Gardam. Profinite rigidity in the SnapPea census. Exp. Math., 30(4):489–498, 2021. doi:10.1080/10586458.2019.1577766.
  • [24] Matthias Goerner. SnapPy: verified computations. Available at https://snappy.computop.org/verify.html (28/10/2025).
  • [25] Martin Hildebrand and Jeffrey Weeks. A computer generated census of cusped hyperbolic 3-manifolds. In Computers and mathematics (Cambridge, MA, 1989), pages 53–59. Springer, New York, 1989. doi:10.1007/978-1-4613-9647-5_7.
  • [26] Craig D. Hodgson and Steven P. Kerckhoff. Universal bounds for hyperbolic Dehn surgery. Ann. Math., 162(1):367–421, 2005. doi:10.4007/annals.2005.162.367.
  • [27] Neil Hoffman, Kazuhiro Ichihara, Masahide Kashiwagi, Hidetoshi Masai, Shin’ichi Oishi, and Akitoshi Takayasu. Verified computations for hyperbolic 3-manifolds. Exp. Math., 25(1):66–78, 2016. doi:10.1080/10586458.2015.1029599.
  • [28] Jim Hoste, Morwen Thistlethwaite, and Jeff Weeks. The first 1,701,936 knots. Math. Intelligencer, 20(4):33–48, 1998. doi:10.1007/BF03025227.
  • [29] William Jaco and Ulrich Oertel. An algorithm to decide if a 3-manifold is a Haken manifold. Topology, 23(2):195–209, 1984. doi:10.1016/0040-9383(84)90039-9.
  • [30] András Juhász. A survey of Heegaard Floer homology. In New ideas in low dimensional topology, volume 56 of Ser. Knots Everything, pages 237–296. World Sci. Publ., Hackensack, NJ, 2015. doi:10.1142/9789814630627_0007.
  • [31] Marc Lackenby. Word hyperbolic Dehn surgery. Invent. Math., 140(2):243–282, 2000. doi:10.1007/s002220000047.
  • [32] A. K. Lenstra, H. W. Lenstra, Jr., and L. Lovász. Factoring polynomials with rational coefficients. Math. Ann., 261(4):515–534, 1982. doi:10.1007/BF01457454.
  • [33] Shana Yunsheng Li. The complete 10-tetrahedra census of orientable cusped hyperbolic 3-manifolds, 2025. arXiv:2512.02142.
  • [34] Shana Yunsheng Li. The complete 10-tetrahedra census of orientable cusped hyperbolic 3-manifolds, 2025. doi:10.7910/DVN/BFEXZA.
  • [35] Shana Yunsheng Li. snappy_11_tets, 2026. URL: https://pypi.org/project/snappy-11-tets/.
  • [36] Feng Luo, Saul Schleimer, and Stephan Tillmann. Geodesic ideal triangulations exist virtually. Proc. Amer. Math. Soc., 136(7):2625–2630, 2008. doi:10.1090/S0002-9939-08-09387-8.
  • [37] Bruno Martelli. An introduction to geometric topology, 2022. arXiv:1610.02592.
  • [38] Peter Ozsváth and Zoltán Szabó. Holomorphic disks and knot invariants. Adv. Math., 186(1):58–116, 2004. doi:10.1016/j.aim.2003.05.001.
  • [39] Stuart Rankin, Ortho Flint, and John Schermann. Enumerating the prime alternating knots, Part I. J. Knot Theory Ramifications, 13(1):57–100, 2004. doi:10.1142/S0218216504003044.
  • [40] Makoto Sakuma and Jeffrey R. Weeks. The generalized tilt formula. Geom. Dedicata, 55(2):115–123, 1995. doi:10.1007/BF01264924.
  • [41] Peter Guthrie Tait. Xix.—on knots. Part II. Transactions of the Royal Society of Edinburgh, 32(2):327–342, 1884. doi:10.1017/S0080456800026806.
  • [42] Morwen Thistlethwaite. Index of /mthistle/8tet. Available at https://web.math.utk.edu/˜mthistle/8tet/ (04/02/2026).
  • [43] Morwen B. Thistlethwaite. The enumeration and classification of prime 20-crossing knots. Algebr. Geom. Topol., 25(1):329–344, 2025. doi:10.2140/agt.2025.25.329.
  • [44] Jeffrey R. Weeks. Convex hulls and isometries of cusped hyperbolic 3-manifolds. Topology Appl., 52(2):127–149, 1993. doi:10.1016/0166-8641(93)90032-9.