November 7, 2003
Similar papers 4
October 10, 2007
One method for obtaining every closed orientable 3-manifold is as branched covering of the 3-sphere over a link. There is a classical topological result showing that the minimun possible number of sheets in the covering is three. In this paper we obtain a geometric version of this result. The interest is given by the growing importance of geometry in 3-manifolds theory.
February 23, 2024
Dimension 4 is the first dimension in which exotic smooth manifold pairs appear -- manifolds which are topologically the same but for which there is no smooth deformation of one into the other. Whilst smooth and triangulated 4-manifolds do coincide, comparatively little work has been done towards gaining an understanding of smooth 4-manifolds from the discrete and algorithmic perspective. In this paper we introduce new software tools to make this possible, including a softwar...
November 1, 2012
We give a more geometric approach to an algorithm for deciding whether two hyperbolic 3-manifolds are homeomorphic. We also give a more algebraic approach to the homeomorphism problem for geometric, but non-hyperbolic, 3-manifolds.
November 14, 2015
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 manifold. Tight triangulations are conjectured to be strongly minimal, and proven to be so for dimensions $\leq 3$. However, in spite of substantial theoretical results about such triangulations, there are precious few examples. In fact, apart fro...
May 15, 2024
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 ...
December 5, 2014
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 algorithms to date have not gone beyond n = 12. The underlying algorithms essentially (i) enumerate all relevant 4-regular multigraphs on n nodes, and then (ii) for each multigraph G they enumerate possible 3-manifold triangulations with G as ...
July 22, 2014
This article is a survey article that gives detailed constructions and illustrations of some of the standard examples of non-orientable surfaces that are embedded and immersed in 4-dimensional space. The illustrations depend upon their 3-dimensional projections, and indeed the illustrations here depend upon a further projection into the plane of the page. The concepts used to develop the illustrations will be developed herein.
November 18, 2010
After a short summary of known results on surface-complexity of closed 3-manifolds, we will classify all closed orientable 3-manifolds with surface-complexity one.
August 13, 2012
Regina is a software package for studying 3-manifold triangulations and normal surfaces. It includes a graphical user interface and Python bindings, and also supports angle structures, census enumeration, combinatorial recognition of triangulations, and high-level functions such as 3-sphere recognition, unknot recognition and connected sum decomposition. This paper brings 3-manifold topologists up-to-date with Regina as it appears today, and documents for the first time in ...
November 8, 2012
Given an special type of triangulation $T$ for an oriented closed 3-manifold $M^3$ we produce a framed link in $S^3$ which induces the same $M^3$ by an algorithm of complexity $O(n^2)$ where $n$ is the number of tetrahedra in $T$ . The special class is formed by the duals of the {\em solvable gems}. These are in practice computationaly easy to obtain from any triangulation for $M^3$. The conjecture that each closed oriented 3-manifold is induced by a solvable gem has been ver...