AbstractFor integers d⩾2 and ε=0 or 1, let S1,d−1(ε) denote the sphere product S1×Sd−1 if ε=0 and the twisted sphere product if ε=1. The main results of this paper are: (a) if d≡ε(mod2) then S1,d−1(ε) has a unique minimal triangulation using 2d+3 vertices, and (b) if d≡1−ε(mod2) then S1,d−1(ε) has minimal triangulations (not unique) using 2d+4 vertices. In this context, a minimal triangulation of a manifold is a triangulation using the least possible number of vertices. The second result confirms a recent conjecture of Lutz. The first result provides the first known infinite family of closed manifolds (other than spheres) for which the minimal triangulation is unique. Actually, we show that while S1,d−1(ε) has at most one (2d+3)-vertex tri...
This thesis presents some results on vertex-minimal (simplicial) triangulations of manifolds. We ar...
There are essentially two ways to decompose a (compact, connected) d-mani-fold (without boundary) in...
AbstractWe give a complete characterization of all possible pairs (f0,f1), where f0 is the number of...
For integers $d \geq 2$ and $\epsilon = 0$ or 1, let $S^{1,d-1}(\epsilon)$ denote the sphere product...
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...
Finding vertex-minimal triangulations of closed manifolds is a very difficult problem. Except for sp...
AbstractFor d≥2, Walkup’s class K(d) consists of the d-dimensional simplicial complexes all whose ve...
For d >= 2, Walkup's class K (d) consists of the d-dimensional simplicial complexes all whose vertex...
For d >= 2, Walkup's class K (d) consists of the d-dimensional simplicial complexes all whose vertex...
This paper uses results on the classification of minimal triangulations of 3-manifolds to produce ad...
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...
This thesis presents some results on vertex-minimal (simplicial) triangulations of manifolds. We ar...
This thesis presents some results on vertex-minimal (simplicial) triangulations of manifolds. We ar...
This thesis presents some results on vertex-minimal (simplicial) triangulations of manifolds. We ar...
There are essentially two ways to decompose a (compact, connected) d-mani-fold (without boundary) in...
AbstractWe give a complete characterization of all possible pairs (f0,f1), where f0 is the number of...
For integers $d \geq 2$ and $\epsilon = 0$ or 1, let $S^{1,d-1}(\epsilon)$ denote the sphere product...
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...
Finding vertex-minimal triangulations of closed manifolds is a very difficult problem. Except for sp...
AbstractFor d≥2, Walkup’s class K(d) consists of the d-dimensional simplicial complexes all whose ve...
For d >= 2, Walkup's class K (d) consists of the d-dimensional simplicial complexes all whose vertex...
For d >= 2, Walkup's class K (d) consists of the d-dimensional simplicial complexes all whose vertex...
This paper uses results on the classification of minimal triangulations of 3-manifolds to produce ad...
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...
This thesis presents some results on vertex-minimal (simplicial) triangulations of manifolds. We ar...
This thesis presents some results on vertex-minimal (simplicial) triangulations of manifolds. We ar...
This thesis presents some results on vertex-minimal (simplicial) triangulations of manifolds. We ar...
There are essentially two ways to decompose a (compact, connected) d-mani-fold (without boundary) in...
AbstractWe give a complete characterization of all possible pairs (f0,f1), where f0 is the number of...