arXiv subjects

Benjamin A. Burton

Publications and source records attributed to Benjamin A. Burton.

57 records · Page 4Linked to original sources

arXiv2005

Observations from the 8-tetrahedron non-orientable census

Through computer enumeration with the aid of topological results, we catalogue all 18 closed non-orientable P^2-irreducible 3-manifolds that can be formed from at most eight tetrahedra. In addition we give an overview as to how the 100 resulting minimal triangulations are constructed. Observations and conjectures are drawn from the census data, and future potential for the non-orientable census is discussed. Some preliminary nine-tetrahedron results are also included.

math.GT↗

arXiv2005

Structures of small closed non-orientable 3-manifold triangulations

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 these 41 different triangulations are identified and described in detail, with particular attention paid to the recurring combinatorial structures that are shared amongst the different triangulations. Using these recurring structures, the resulting triangulations are generalised to infinite families that allow similar triangulations of additional 3-manifolds to be formed. Algorithms and techniques used in constructing the census are included.

math.GT↗

arXiv2003

Face pairing graphs and 3-manifold enumeration

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 minimal P^2-irreducible triangulation. In addition we present constraints upon the combinatorial structure of such a triangulation that can be deduced from its face pairing graph. These results are then applied to the enumeration of closed minimal P^2-irreducible 3-manifold triangulations, leading to a significant improvement in the performance of the enumeration algorithm. Results are offered for both orientable and non-orientable triangulations.

math.GT↗