Related papers: Structures of small closed non-orientable 3-manifo…
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…
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…
A typical census of 3-manifolds contains all manifolds (under various constraints) that can be triangulated with at most n tetrahedra. Al- though censuses are useful resources for mathematicians, constructing them is difficult: the best…
We often rely on censuses of triangulations to guide our intuition in $3$-manifold topology. However, this can lead to misplaced faith in conjectures if the smallest counterexamples are too large to appear in our census. Since the number of…
We describe five ideal triangulations of the 3-cusped hyperbolic `magic manifold' that are each compatible with well-established techniques for triangulating Dehn fillings. Using these techniques, we construct low-complexity triangulations…
We present the census of all non-orientable, closed, connected 3-manifolds admitting a rigid crystallization with at most 30 vertices. In order to obtain the above result, we generate, manipulate and compare, by suitable computer…
In this paper, we describe geometrical constructions to obtain triangulations of connected sums of closed orientable triangulated 3-manifolds. Using these constructions, we show that it takes time polynomial in the number of tetrahedra to…
We improve and extend to the non-orientable case a recent result of Karabas, Malicki and Nedela concerning the classification of all orientable prime 3-manifolds of Heegaard genus two, triangulated with at most 42 coloured tetrahedra.
It is important to have effective methods for simplifying 3-manifold triangulations without losing any topological information. In theory this is difficult: we might need to make a triangulation super-exponentially more complex before we…
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…
The face pairing graph of a 3-manifold triangulation is a 4-valent graph denoting which tetrahedron faces are identified with which others. We present a series of properties that must be satisfied by the face pairing graph of a closed…
From its creation in 1989 through subsequent extensions, the widely-used "SnapPea census" now aims to represent all cusped finite-volume hyperbolic 3-manifolds that can be obtained from <= 8 ideal tetrahedra. Its construction, however, has…
In this thesis, we use normal surface theory to understand certain properties of minimal triangulations of compact orientable 3-manifolds. We describe the collapsing process of normal 2-spheres and disks. Using some geometrical…
Tight triangulations are exotic, but highly regular objects in combinatorial topology. A triangulation is tight if all its piecewise linear embeddings into a Euclidean space are as convex as allowed by the topology of the underlying…
We extend the complete census of orientable cusped hyperbolic $3$-manifolds to $10$ tetrahedra, giving the next $150730$ manifolds and their $496638$ minimal ideal triangulations. As applications, we find the precisely $439898$ exceptional…
The present paper follows the computational approach to 3-manifold classification via edge-coloured graphs, already performed by several authors with respect to orientable 3-manifolds up to 28 coloured tetrahedra, non-orientable 3-manifolds…
We present a framework to classify PL-types of large censuses of triangulated $4$-manifolds, which we use to classify the PL-types of all triangulated $4$-manifolds with up to six pentachora. This is successful except for triangulations…
One measure of the complexity of a 3-manifold is its triangulation complexity: the minimal number of tetrahedra in a triangulation of it. A natural question is whether we can relate this quantity to its topology. We determine the…
This is a collection of notes on embedding problems for 3-manifolds. The main question explored is `which 3-manifolds embed smoothly in the 4-sphere?' The terrain of exploration is the Burton/Martelli/Matveev/Petronio census of triangulated…
Methods were developed in Ref. [1] for constructing reference metrics (and from them differentiable structures) on three-dimensional manifolds with topologies specified by suitable triangulations. This note generalizes those methods by…