Experiments with the Census

We explicitly construct small triangulations for a number of well-known 3-dimensional manifolds and give a brief outline of some aspects of the underlying theory of 3-manifolds and its historical development.

In this work we present a complete (no misses, no duplicates) census for closed, connected, orientable and prime 3-manifolds induced by plane graphs with a bipartition of its edge set (blinks) up to $k=9$ edges. Blinks form a universal encoding for such manifolds. In fact, each such a manifold is a subtle class of blinks, \cite{lins2013B}. Blinks are in 1-1 correpondence with {\em blackboard framed links}, \cite {kauffman1991knots, kauffman1994tlr} We hope that this census be...

Real 3-manifold triangulations can be uniquely represented by isomorphism signatures. Databases of these isomorphism signatures are generated for a variety of 3-manifolds and knot complements, using SnapPy and Regina, then these language-like inputs are used to train various machine learning architectures to differentiate the manifolds, as well as their Dehn surgeries, via their triangulations. Gradient saliency analysis then extracts key parts of this language-like encoding ...

This survey focuses on the computational complexity of some of the fundamental decision problems in 3-manifold theory. The article discusses the wide variety of tools that are used to tackle these problems, including normal and almost surfaces, hierarchies, homomorphisms to finite groups, and hyperbolic structures.

Through computer enumeration with the aid of topological results, we catalogue all 18 closed non-orientable P^2-irreducible 3-manifolds that can be formed from at most eight tetrahedra. In addition we give an overview as to how the 100 resulting minimal triangulations are constructed. Observations and conjectures are drawn from the census data, and future potential for the non-orientable census is discussed. Some preliminary nine-tetrahedron results are also included.

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 sign...

In this survey on combinatorial properties of triangulated manifolds we discuss various lower bounds on the number of vertices of simplicial and combinatorial manifolds. Moreover, we give a list of all known examples of vertex-minimal triangulations.

This survey article describes the algorithmic approaches successfully used over the time to construct hyperbolic structures on 3-dimensional topological "objects" of various types, and to classify several classes of such objects using such structures.

This is a survey article on finite type invariants of 3-manifolds written for the Encyclopedia of Mathematical Physics to be published by Elsevier.

Drawing together techniques from combinatorics and computer science, we improve the census algorithm for enumerating closed minimal P^2-irreducible 3-manifold triangulations. In particular, new constraints are proven for face pairing graphs, and pruning techniques are improved using a modification of the union-find algorithm. Using these results we catalogue all 136 closed non-orientable P^2-irreducible 3-manifolds that can be formed from at most ten tetrahedra.