Embeddings of 3-manifolds in S^4 from the point of view of the 11-tetrahedron census

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 prime closed 3-manifolds built from 11 or less tetrahedra. There are 13766 manifolds in the census, of which 13400 are orientable. Of the 13400 orientable manifolds, only 149 of them have hyperbolic torsion linking forms and are thus candidates for embedability in the 4-sphere. The majority of this paper is devoted to the embedding problem for these 149 manifolds. At present 41 are known to embed. Among the remaining manifolds, embeddings into homotopy 4-spheres are constructed for 4. 67 manifolds are known to not embed in the 4-sphere. This leaves 37 unresolved cases, of which only 3 are geometric manifolds i.e. having a trivial JSJ-decomposition.Comment: 58 pages, 80+ figures. V6: Included references to libraries valid in Regina 5.0+. Incorporated changes suggested by Ahmed Issa, following from his techniques developed with McCoy. Included a few recent references. To appear in Experimental Mathematic

Stronger ILPs for the Graph Genus Problem

The minimum genus of a graph is an important question in graph theory and a key ingredient in several graph algorithms. However, its computation is NP-hard and turns out to be hard even in practice. Only recently, the first non-trivial approach - based on SAT and ILP (integer linear programming) models - has been presented, but it is unable to successfully tackle graphs of genus larger than 1 in practice. Herein, we show how to improve the ILP formulation. The crucial ingredients are two-fold. First, we show that instead of modeling rotation schemes explicitly, it suffices to optimize over partitions of the (bidirected) arc set A of the graph. Second, we exploit the cycle structure of the graph, explicitly mapping short closed walks on A to faces in the embedding. Besides the theoretical advantages of our models, we show their practical strength by a thorough experimental evaluation. Contrary to the previous approach, we are able to quickly solve many instances of genus > 1

Bounds for the genus of a normal surface

This paper gives sharp linear bounds on the genus of a normal surface in a triangulated compact, orientable 3--manifold in terms of the quadrilaterals in its cell decomposition---different bounds arise from varying hypotheses on the surface or triangulation. Two applications of these bounds are given. First, the minimal triangulations of the product of a closed surface and the closed interval are determined. Second, an alternative approach to the realisation problem using normal surface theory is shown to be less powerful than its dual method using subcomplexes of polytopes.Comment: 38 pages, 25 figure

Detecting genus in vertex links for the fast enumeration of 3-manifold triangulations

Enumerating all 3-manifold triangulations of a given size is a difficult but increasingly important problem in computational topology. A key difficulty for enumeration algorithms is that most combinatorial triangulations must be discarded because they do not represent topological 3-manifolds. In this paper we show how to preempt bad triangulations by detecting genus in partially-constructed vertex links, allowing us to prune the enumeration tree substantially. The key idea is to manipulate the boundary edges surrounding partial vertex links using expected logarithmic time operations. Practical testing shows the resulting enumeration algorithm to be significantly faster, with up to 249x speed-ups even for small problems where comparisons are feasible. We also discuss parallelisation, and describe new data sets that have been obtained using high-performance computing facilities.Comment: 16 pages, 7 figures, 3 tables; v2: minor revisions; to appear in ISSAC 201

Developing a Mathematical Model for Bobbin Lace

Bobbin lace is a fibre art form in which intricate and delicate patterns are created by braiding together many threads. An overview of how bobbin lace is made is presented and illustrated with a simple, traditional bookmark design. Research on the topology of textiles and braid theory form a base for the current work and is briefly summarized. We define a new mathematical model that supports the enumeration and generation of bobbin lace patterns using an intelligent combinatorial search. Results of this new approach are presented and, by comparison to existing bobbin lace patterns, it is demonstrated that this model reveals new patterns that have never been seen before. Finally, we apply our new patterns to an original bookmark design and propose future areas for exploration.Comment: 20 pages, 18 figures, intended audience includes Artists as well as Computer Scientists and Mathematician

On uniqueness of end sums and 1-handles at infinity

For oriented manifolds of dimension at least 4 that are simply connected at infinity, it is known that end summing is a uniquely defined operation. Calcut and Haggerty showed that more complicated fundamental group behavior at infinity can lead to nonuniqueness. The present paper examines how and when uniqueness fails. Examples are given, in the categories TOP, PL and DIFF, of nonuniqueness that cannot be detected in a weaker category (including the homotopy category). In contrast, uniqueness is proved for Mittag-Leffler ends, and generalized to allow slides and cancellation of (possibly infinite) collections of 0- and 1-handles at infinity. Various applications are presented, including an analysis of how the monoid of smooth manifolds homeomorphic to R^4 acts on the smoothings of any noncompact 4-manifold.Comment: 25 pages, 8 figures. v2: Minor expository improvement