ID: 1502.00383

A census of tetrahedral hyperbolic manifolds

February 2, 2015

View on ArXiv

Similar papers 2

The Homeomorphism Problem For Hyperbolic Manifolds I

August 2, 2021

86% Match
Joe Scull
Geometric Topology

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.

Find SimilarView on arXiv

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

October 14, 2008

86% Match
Ryan Budney, Benjamin A. Burton
Geometric Topology
Algebraic Topology

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 candi...

Find SimilarView on arXiv

Experiments with the Census

March 16, 2019

86% Match
Igor Rivin
Geometric Topology

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.

Find SimilarView on arXiv

Enumeration of non-orientable 3-manifolds using face pairing graphs and union-find

April 27, 2006

86% Match
Benjamin A. Burton
Geometric Topology
Computational Geometry
Combinatorics

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 graphs, and pruning techniques are improved using a modification of the union-find algorithm. Using these results we catalogue all 136 closed non-orientable P^2-irreducible 3-manifolds that can be formed from at most ten tetrahedra.

Find SimilarView on arXiv

Triangulated Manifolds with Few Vertices: Geometric 3-Manifolds

November 7, 2003

86% Match
Frank H. Lutz
Geometric Topology
Combinatorics

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.

Find SimilarView on arXiv

Triangulations of hyperbolic 3-manifolds admitting strict angle structures

November 14, 2011

85% Match
Craig D. Hodgson, J. Hyam Rubinstein, Henry Segerman
Geometric Topology

It is conjectured that every cusped hyperbolic 3-manifold has a decomposition into positive volume ideal hyperbolic tetrahedra (a "geometric" triangulation of the manifold). Under a mild homology assumption on the manifold we construct topological ideal triangulations which admit a strict angle structure, which is a necessary condition for the triangulation to be geometric. In particular, every knot or link complement in the 3-sphere has such a triangulation. We also give an ...

Find SimilarView on arXiv
Francesco Costantino, Yang-Hui He, ... , Hirst Edward
Geometric Topology
Machine Learning

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 ...

Minimal 4-colored graphs representing an infinite family of hyperbolic 3-manifolds

June 7, 2017

85% Match
P. Cristofori, E. Fominykh, ... , Tarkaev V.
Geometric Topology

The graph complexity of a compact 3-manifold is defined as the minimum order among all 4-colored graphs representing it. Exact calculations of graph complexity have been already performed, through tabulations, for closed orientable manifolds (up to graph complexity 32) and for compact orientable 3-manifolds with toric boundary (up to graph complexity 12) and for infinite families of lens spaces. In this paper we extend to graph complexity 14 the computations for orientable ma...

Find SimilarView on arXiv

Fibred and Virtually Fibred hyperbolic 3-manifolds in the censuses

October 13, 2004

85% Match
J. O. Button
Geometric Topology

Following on from work of Dunfield, we determine the fibred status of all the unknown hyperbolic 3-manifolds in the cusped census. We then find all the fibred hyperbolic 3-manifolds in the closed census and use this to find over 100 examples each of closed and cusped virtually fibred non-fibred census 3-manifolds, including the Weeks manifold. We also show that the co-rank of the fundamental group of every 3-manifold in the cusped and in the closed census is 0 or 1.

Find SimilarView on arXiv

Hyperbolic 24-cell 4-manifolds with one cusp

April 15, 2020

85% Match
John G. Ratcliffe, Steven T. Tschantz
Geometric Topology

In this paper, we describe all the hyperbolic 24-cell 4-manifolds with exactly one cusp. There are four of these manifolds up to isometry. These manifolds are the first examples of one-cusped hyperbolic 4-manifolds of minimum volume.

Find SimilarView on arXiv