This paper uses results on the classification of minimal triangulations of 3-manifolds to produce additional results, using covering spaces. Using previous work on minimal triangulations of lens spaces, it is shown that the lens space L(4k; 2k-1) and the generalised quaternionic space S/Q have complexity k, where k≥2. Moreover, it is shown that their minimal triangulations are unique
Finding vertex-minimal triangulations of closed manifolds is a very difficult problem. Except for sp...
The graph complexity of a compact 3-manifold is defined as the minimum order among all 4-colored gra...
The graph complexity of a compact 3-manifold is defined as the minimum order among all 4-colored gra...
The triangulation complexity of a compact 3-manifold is the minimal number of tetrahedra in any tria...
AbstractFor integers d⩾2 and ε=0 or 1, let S1,d−1(ε) denote the sphere product S1×Sd−1 if ε=0 and th...
The triangulation complexity of a closed orientable 3-manifold is the minimal number of tetrahedra i...
The notion of a layered triangulation of a lens space was defined by Jaco and Rubinstein, and unless...
For integers $d \geq 2$ and $\epsilon = 0$ or 1, let $S^{1,d-1}(\epsilon)$ denote the sphere product...
In this sequel to earlier papers by three of the authors, we obtain a new bound on the complexity of...
We explicitly construct layered-triangulations for manifolds admitting a genus-one open book decompo...
The understanding and classification of (compact) 3-dimensional manifolds (without boundary) is with...
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...
This thesis presents some results on vertex-minimal (simplicial) triangulations of manifolds. We ar...
This thesis examines three distinct problems relating to the combinatorial structures of minimal 3-m...
Finding vertex-minimal triangulations of closed manifolds is a very difficult problem. Except for sp...
The graph complexity of a compact 3-manifold is defined as the minimum order among all 4-colored gra...
The graph complexity of a compact 3-manifold is defined as the minimum order among all 4-colored gra...
The triangulation complexity of a compact 3-manifold is the minimal number of tetrahedra in any tria...
AbstractFor integers d⩾2 and ε=0 or 1, let S1,d−1(ε) denote the sphere product S1×Sd−1 if ε=0 and th...
The triangulation complexity of a closed orientable 3-manifold is the minimal number of tetrahedra i...
The notion of a layered triangulation of a lens space was defined by Jaco and Rubinstein, and unless...
For integers $d \geq 2$ and $\epsilon = 0$ or 1, let $S^{1,d-1}(\epsilon)$ denote the sphere product...
In this sequel to earlier papers by three of the authors, we obtain a new bound on the complexity of...
We explicitly construct layered-triangulations for manifolds admitting a genus-one open book decompo...
The understanding and classification of (compact) 3-dimensional manifolds (without boundary) is with...
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...
This thesis presents some results on vertex-minimal (simplicial) triangulations of manifolds. We ar...
This thesis examines three distinct problems relating to the combinatorial structures of minimal 3-m...
Finding vertex-minimal triangulations of closed manifolds is a very difficult problem. Except for sp...
The graph complexity of a compact 3-manifold is defined as the minimum order among all 4-colored gra...
The graph complexity of a compact 3-manifold is defined as the minimum order among all 4-colored gra...