We call a cusped hyperbolic 3-manifold tetrahedral if it can be decomposed into regular ideal tetrahedra. Following an earlier publication by three of the authors, we give a census of all tetrahedral manifolds and all of their combinatorial tetrahedral tessellations with at most 25 (orientable case) and 21 (non-orientable case) tetrahedra. Our isometry classification uses certified canonical cell decompositions (based on work by Dunfield, Hoffman, Licata) and isomorphism signatures (an improvement of dehydration sequences by Burton). The tetrahedral census comes in Regina as well as SnapPy format, and we illustrate its features.

Abstract. A representation for compact 3-manifolds with non-empty non-spherical boundary via 4-colored graphs (i.e. 4-regular graphs endowed with a proper edge-coloration with four colors) has been recently introduced by two of the authors, and an initial classification of such manifolds has been obtained up to 8 vertices of the representing graphs. Computer experiments show that the number of graphs/manifolds grows very quickly as the number of vertices increases. As a consequence, we have focused on the case of orientable 3-manifolds with toric boundary, which contains the important case of complements of knots and links in the 3-sphere.In this paper we obtain the complete catalogation/classification of these 3-manifolds up to 12 vertices of the associated graphs, showing the diagrams of the involved knots and links. For the particular case of complements of knots, the research has been extended up to 16 vertices.2010 Mathematics Subject Classification: 57M25, 57N10, 57M15.

The goal of this paper is to tabulate all prime links in the thickened torus [Formula: see text] having diagrams having crossing number 5. First, we construct a table of prime projections of links on the torus [Formula: see text] having exactly 5 crossings. To this end, we enumerate abstract quadrivalent graphs of special type and consider all possible embeddings of the graphs into the torus [Formula: see text] in order to construct prime projections. Then, we prove that all obtained projections are inequivalent. Second, we use the list of prime projections to construct a table of diagrams of prime links in the torus [Formula: see text]. In order to prove that all those links are inequivalent, we use two modifications of the Kauffman bracket. Several known and new tricks allow us to keep the process within reasonable limits and rigorously theoretically prove the completeness of the constructed tables.