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 scheme from the trained models. The isomorphism signature databases are taken from the 3-manifolds' Pachner graphs, which are also generated in bulk for some selected manifolds of focus and for the subset of the SnapPy orientable cusped census with $<8$ initial tetrahedra. These Pachner graphs are further analysed through the lens of network science to identify new structure in the triangulation representation; in particular for the hyperbolic case, a relation between the length of the shortest geodesic (systole) and the size of the Pachner graph's ball is observed.
Similar papers 1
November 7, 2003
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.
March 24, 2010
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.
May 10, 2023
We test the efficiency of applying Geometric Deep Learning to the problems in low-dimensional topology in a certain simple setting. Specifically, we consider the class of 3-manifolds described by plumbing graphs and use Graph Neural Networks (GNN) for the problem of deciding whether a pair of graphs give homeomorphic 3-manifolds. We use supervised learning to train a GNN that provides the answer to such a question with high accuracy. Moreover, we consider reinforcement learni...
October 27, 2011
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 can make it smaller than its original size. Here we present experimental work that suggests the reality is far different: for an exhaustive census of 81,800,394 one-vertex triangulations that span 1,901 distinct closed orientable 3-manifolds,...
March 16, 2019
In this paper we study the manifolds in the census of "small" 3-manifolds as available in SnapPy. We compare our results with the statistics of random 3-manifolds obtained using the Dunfield Thurston and Rivin models.
September 3, 2020
Leo Tolstoy opened his monumental novel Anna Karenina with the now famous words: Happy families are all alike; every unhappy family is unhappy in its own way A similar notion also applies to mathematical spaces: Every flat space is alike; every unflat space is unflat in its own way. However, rather than being a source of unhappiness, we will show that the diversity of non-flat spaces provides a rich area of study. The genesis of the so-called big data era and the proliferatio...
September 29, 2023
This research uses deep learning to estimate the topology of manifolds represented by sparse, unordered point cloud scenes in 3D. A new labelled dataset was synthesised to train neural networks and evaluate their ability to estimate the genus of these manifolds. This data used random homeomorphic deformations to provoke the learning of visual topological features. We demonstrate that deep learning models could extract these features and discuss some advantages over existing t...
November 18, 2010
It is important to have fast and 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 can make it smaller than its original size. Here we present experimental work suggesting that for 3-sphere triangulations the reality is far different: we never need to add more than two tetrahedra, and we never need more than a hand...
February 2, 2015
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...
May 24, 2013
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...