Triangulated Manifolds with Few Vertices: Geometric 3-Manifolds

We give a bounded runtime solution to the homeomorphism problem for closed hyperbolic 3-manifolds. This is an algorithm which, given two triangulations of hyperbolic 3-manifolds by at most $t$ tetrahedra, decides if they represent the same hyperbolic 3-manifold with runtime bounded by \[ 2^{2^{t^{O(t)}}}.\] We do this by first finding a hyperbolic structure on each manifold given as a geometric triangulation and then comparing the two as geometric manifolds.

We give a simple combinatoric proof of an exponential upper bound on the number of distinct 3-manifolds that can be constructed by successively identifying nearest neighbour pairs of triangles in the boundary of a simplicial 3-ball and show that all closed simplicial manifolds that can be constructed in this manner are homeomorphic to $S^3$. We discuss the problem of proving that all 3-dimensional simplicial spheres can be obtained by this construction and give an example of ...

The crushing operation of Jaco and Rubinstein is a powerful technique in algorithmic 3-manifold topology: it enabled the first practical implementations of 3-sphere recognition and prime decomposition of orientable manifolds, and it plays a prominent role in state-of-the-art algorithms for unknot recognition and testing for essential surfaces. Although the crushing operation will always reduce the size of a triangulation, it might alter its topology, and so it requires a care...

In this paper, we explore minimal contact triangulations on contact 3-manifolds. We give many explicit examples of contact triangulations that are close to minimal ones. The main results of this article say that on any closed oriented 3-manifold the number of vertices for minimal contact triangulations for overtwisted contact structures grows at most linearly with respect to the relative $d^3$ invariant. We conjecture that this bound is optimal. We also discuss, in great deta...

A taut ideal triangulation of a 3-manifold is a topological ideal triangulation with extra combinatorial structure: a choice of transverse orientation on each ideal 2-simplex, satisfying two simple conditions. The aim of this paper is to demonstrate that taut ideal triangulations are very common, and that their behaviour is very similar to that of a taut foliation. For example, by studying normal surfaces in taut ideal triangulations, we give a new proof of Gabai's result tha...

This survey gives a brief overview of theoretically and practically relevant algorithms to compute geodesic paths and distances on three-dimensional surfaces. The survey focuses on polyhedral three-dimensional surfaces.

We present a practical algorithm to test whether a 3-manifold given by a triangulation or an ideal triangulation contains a closed essential surface. This property has important theoretical and algorithmic consequences. As a testament to its practicality, we run the algorithm over a comprehensive body of closed 3-manifolds and knot exteriors, yielding results that were not previously known. The algorithm derives from the original Jaco-Oertel framework, involves both enumera...

This paper poses some basic questions about instances (hard to find) of a special problem in 3-manifold topology. "Important though the general concepts and propositions may be with the modern industrious passion for axiomatizing and generalizing has presented us...nevertheless I am convinced that the special problems in all their complexity constitute the stock and the core of mathematics; and to master their difficulty requires on the whole the harder labor." Hermann Weyl 1...

We present new computational methods for proving diffeomorphy of triangulated 4-manifolds, including algorithms and topological software that can for the first time effectively handle the complexities that arise in dimension four and be used for large scale experiments.

This article presents an improvement and extension of the heuristic first presented by Hougardy, Lutz, and Zelke in 2010 for realizing triangulated orientable surfaces with few vertices by a simplex-wise linear embedding. The improvement consists in the applicability to non-orientable surfaces (simplex-wise linear immersions) as well as symmetric realizations. With the help of our algorithm, numerous - often symmetric - realizations of non-orientable surfaces with the minimal...