The understanding and classication of (compact) 3-dimensional manifolds (without boundary) is with no doubt one of the most prominent tasks in topology ever since Poincare's fundamental work [88] on l'analysis situs appeared in 1904. There are various ways for constructing 3-manifolds, some of which that are general enough to yield all 3-manifolds (orientable or nonorientable) and some that produce only particular types or classes of examples. According to Moise [73], all 3-manifolds can be triangulated. This im-plies that there are only countably many distinct combinatorial (and therefore at most so many dierent topological) types that result from gluing together tetrahedra. Another way to obtain 3-manifolds is by starting with a...
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...
AbstractIt is proved that every combinatorial 3-manifold with at most eight vertices is a combinator...
The understanding and classification of (compact) 3-dimensional manifolds (without boundary) is with...
There are essentially two ways to decompose a (compact, connected) d-mani-fold (without boundary) in...
A census is presented of all closed non-orientable 3-manifold triangulations formed from at most sev...
A census is presented of all closed non-orientable 3-manifold triangulations formed from at most sev...
. We describe theoretical backgrounds for a computer program that recognizes all closed orientable 3...
This paper poses some basic questions about instances (hard to find) of a special problem in 3-manif...
We give a complete enumeration of combinatorial 3-manifolds with 10 vertices: There are precisely 24...
The present paper adopts a computational approach to the study of nonorientable 3-manifolds: in fact...
THIS paper gives another proof of the triangulability of 3-manifolds, which was first solved by Mois...
The present paper adopts a computational approach to the study of nonorientable 3-manifolds: in fact...
A careful and systematic development of the theory of the topology of 3-manifolds, focusing on the c...
A typical census of 3-manifolds contains all manifolds (under various constraints) that can be trian...
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...
AbstractIt is proved that every combinatorial 3-manifold with at most eight vertices is a combinator...
The understanding and classification of (compact) 3-dimensional manifolds (without boundary) is with...
There are essentially two ways to decompose a (compact, connected) d-mani-fold (without boundary) in...
A census is presented of all closed non-orientable 3-manifold triangulations formed from at most sev...
A census is presented of all closed non-orientable 3-manifold triangulations formed from at most sev...
. We describe theoretical backgrounds for a computer program that recognizes all closed orientable 3...
This paper poses some basic questions about instances (hard to find) of a special problem in 3-manif...
We give a complete enumeration of combinatorial 3-manifolds with 10 vertices: There are precisely 24...
The present paper adopts a computational approach to the study of nonorientable 3-manifolds: in fact...
THIS paper gives another proof of the triangulability of 3-manifolds, which was first solved by Mois...
The present paper adopts a computational approach to the study of nonorientable 3-manifolds: in fact...
A careful and systematic development of the theory of the topology of 3-manifolds, focusing on the c...
A typical census of 3-manifolds contains all manifolds (under various constraints) that can be trian...
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...
AbstractIt is proved that every combinatorial 3-manifold with at most eight vertices is a combinator...