English
Related papers

Related papers: Observations from the 8-tetrahedron non-orientable…

200 papers

A census is presented of all closed non-orientable 3-manifold triangulations formed from at most seven tetrahedra satisfying the additional constraints of minimality and P^2-irreducibility. The eight different 3-manifolds represented by…

Geometric Topology · Mathematics 2010-12-21 Benjamin A. Burton

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…

Geometric Topology · Mathematics 2011-11-29 Benjamin A. Burton

We present the census of all non-orientable, closed, connected 3-manifolds admitting a rigid crystallization with at most 30 vertices. In order to obtain the above result, we generate, manipulate and compare, by suitable computer…

Geometric Topology · Mathematics 2012-03-02 Paola Bandieri , Paola Cristofori , Carlo Gagliardi

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…

Geometric Topology · Mathematics 2019-09-10 Benjamin A. Burton , William Pettersson

We improve and extend to the non-orientable case a recent result of Karabas, Malicki and Nedela concerning the classification of all orientable prime 3-manifolds of Heegaard genus two, triangulated with at most 42 coloured tetrahedra.

Geometric Topology · Mathematics 2012-03-02 Paola Bandieri , Paola Cristofori , Carlo Gagliardi

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…

Geometric Topology · Mathematics 2019-08-12 Evgeny Fominykh , Stavros Garoufalidis , Matthias Goerner , Vladimir Tarkaev , Andrei Vesnin

We often rely on censuses of triangulations to guide our intuition in $3$-manifold topology. However, this can lead to misplaced faith in conjectures if the smallest counterexamples are too large to appear in our census. Since the number of…

Geometric Topology · Mathematics 2024-03-08 Benjamin A. Burton , Alexander He

From its creation in 1989 through subsequent extensions, the widely-used "SnapPea census" now aims to represent all cusped finite-volume hyperbolic 3-manifolds that can be obtained from <= 8 ideal tetrahedra. Its construction, however, has…

Geometric Topology · Mathematics 2014-05-13 Benjamin A. Burton

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…

Geometric Topology · Mathematics 2011-10-28 Benjamin A. Burton

We classify all closed non-orientable $\mathbb{P}^2$-irreducible 3-manifolds obtained by identifying the faces of a cube. These turn out to be the closed non-orientable $\mathbb{P}^2$-irreducible 3-manifolds with surface-complexity one. We…

Geometric Topology · Mathematics 2025-01-03 Gennaro Amendola

We extend the complete census of orientable cusped hyperbolic $3$-manifolds to $10$ tetrahedra, giving the next $150730$ manifolds and their $496638$ minimal ideal triangulations. As applications, we find the precisely $439898$ exceptional…

Geometric Topology · Mathematics 2026-03-05 Shana Yunsheng Li

In this paper, we describe geometrical constructions to obtain triangulations of connected sums of closed orientable triangulated 3-manifolds. Using these constructions, we show that it takes time polynomial in the number of tetrahedra to…

Geometric Topology · Mathematics 2009-09-29 Alexander Barchechat

The face pairing graph of a 3-manifold triangulation is a 4-valent graph denoting which tetrahedron faces are identified with which others. We present a series of properties that must be satisfied by the face pairing graph of a closed…

Geometric Topology · Mathematics 2010-12-21 Benjamin A. Burton

We call a 3-manifold Platonic if it can be decomposed into isometric Platonic solids. Generalizing an earlier publication by the author and others where this was done in case of the hyperbolic ideal tetrahedron, we give a census of…

Geometric Topology · Mathematics 2017-05-12 Matthias Goerner

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…

Geometric Topology · Mathematics 2024-07-12 Ryan Budney , Benjamin A. Burton

The present paper follows the computational approach to 3-manifold classification via edge-coloured graphs, already performed by several authors with respect to orientable 3-manifolds up to 28 coloured tetrahedra, non-orientable 3-manifolds…

Geometric Topology · Mathematics 2012-03-02 M. R. Casali , P. Cristofori

We present a fast enumeration algorithm for combinatorial 2- and 3-manifolds. In particular, we enumerate all triangulated surfaces with 11 and 12 vertices and all triangulated 3-manifolds with 11 vertices. We further determine all…

Combinatorics · Mathematics 2007-05-23 Thom Sulanke , Frank H. Lutz

We describe five ideal triangulations of the 3-cusped hyperbolic `magic manifold' that are each compatible with well-established techniques for triangulating Dehn fillings. Using these techniques, we construct low-complexity triangulations…

Geometric Topology · Mathematics 2025-03-11 Em K. Thompson

In this thesis, we use normal surface theory to understand certain properties of minimal triangulations of compact orientable 3-manifolds. We describe the collapsing process of normal 2-spheres and disks. Using some geometrical…

Geometric Topology · Mathematics 2009-09-29 Alexander Barchechat

We compute for all orientable irreducible geometric 3-manifolds certain complexity functions that approximate from above Matveev's natural complexity, known to be equal to the minimal number of tetrahedra in a triangulation. We can show…

Geometric Topology · Mathematics 2011-09-06 Bruno Martelli , Carlo Petronio
‹ Prev 1 2 3 10 Next ›