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 P2-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
Finding vertex-minimal triangulations of closed manifolds is a very difficult problem. Except for sp...
Finding vertex-minimal triangulations of closed manifolds is a very difficult problem. Except for sp...
In this thesis, we use normal surface theory to understand certain properties of minimal tr...
A census is presented of all closed non-orientable 3-manifold triangulations formed from at most sev...
Drawing together techniques from combinatorics and computer science, we improve the census algorithm...
Through computer enumeration with the aid of topological results, we catalogue all 18 closed nonorie...
The understanding and classication of (compact) 3-dimensional manifolds (without boundary) is with n...
The understanding and classification of (compact) 3-dimensional manifolds (without boundary) is with...
Through computer enumeration with the aid of topological results, we catalogue all 18 closed nonorie...
This thesis examines three distinct problems relating to the combinatorial structures of minimal 3-m...
This thesis examines three distinct problems relating to the combinatorial structures of minimal 3-m...
Drawing together techniques from combinatorics and computer science, we improve the census algorithm...
The present paper adopts a computational approach to the study of nonorientable 3-manifolds: in fact...
The present paper adopts a computational approach to the study of nonorientable 3-manifolds: in fact...
There are essentially two ways to decompose a (compact, connected) d-mani-fold (without boundary) in...
Finding vertex-minimal triangulations of closed manifolds is a very difficult problem. Except for sp...
Finding vertex-minimal triangulations of closed manifolds is a very difficult problem. Except for sp...
In this thesis, we use normal surface theory to understand certain properties of minimal tr...
A census is presented of all closed non-orientable 3-manifold triangulations formed from at most sev...
Drawing together techniques from combinatorics and computer science, we improve the census algorithm...
Through computer enumeration with the aid of topological results, we catalogue all 18 closed nonorie...
The understanding and classication of (compact) 3-dimensional manifolds (without boundary) is with n...
The understanding and classification of (compact) 3-dimensional manifolds (without boundary) is with...
Through computer enumeration with the aid of topological results, we catalogue all 18 closed nonorie...
This thesis examines three distinct problems relating to the combinatorial structures of minimal 3-m...
This thesis examines three distinct problems relating to the combinatorial structures of minimal 3-m...
Drawing together techniques from combinatorics and computer science, we improve the census algorithm...
The present paper adopts a computational approach to the study of nonorientable 3-manifolds: in fact...
The present paper adopts a computational approach to the study of nonorientable 3-manifolds: in fact...
There are essentially two ways to decompose a (compact, connected) d-mani-fold (without boundary) in...
Finding vertex-minimal triangulations of closed manifolds is a very difficult problem. Except for sp...
Finding vertex-minimal triangulations of closed manifolds is a very difficult problem. Except for sp...
In this thesis, we use normal surface theory to understand certain properties of minimal tr...