Abstract. The crushing operation of Jaco and Rubinstein is a powerful tech-nique in algorithmic 3-manifold topology: it enabled the first practical imple-mentations of 3-sphere recognition and prime decomposition of orientable man-ifolds, and it plays a prominent role in state-of-the-art algorithms for unknot recognition and testing for essential surfaces. Although the crushing operation will always reduce the size of a triangulation, it might alter its topology, and so it requires a careful theoretical analysis for the settings in which it is used. The aim of this short paper is to make the crushing operation more accessi-ble to practitioners, and easier to generalise to new settings. When the crush-ing operation was first introduced, the ...
There are essentially two ways to decompose a (compact, connected) d-mani-fold (without boundary) in...
The present paper adopts a computational approach to the study of nonorientable 3-manifolds: in fact...
Combinatorial topology makes unlimited use of refinements. These refinements translate into an unlim...
The crushing operation of Jaco and Rubinstein is a powerful technique in algorithmic 3-manifold topo...
The understanding and classification of (compact) 3-dimensional manifolds (without boundary) is with...
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...
It is important to have fast and effective methods for simplifying 3-manifold triangulations without...
Drawing together techniques from combinatorics and computer science, we improve the census algorithm...
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...
The understanding and classication of (compact) 3-dimensional manifolds (without boundary) is with n...
. We describe theoretical backgrounds for a computer program that recognizes all closed orientable 3...
There are many fundamental algorithmic problems on triangulated 3-manifolds whose complexities are u...
Starting from any simplicial triangulation of a compact 3-manifold M, we achieve decompositions of M...
There are essentially two ways to decompose a (compact, connected) d-mani-fold (without boundary) in...
The present paper adopts a computational approach to the study of nonorientable 3-manifolds: in fact...
Combinatorial topology makes unlimited use of refinements. These refinements translate into an unlim...
The crushing operation of Jaco and Rubinstein is a powerful technique in algorithmic 3-manifold topo...
The understanding and classification of (compact) 3-dimensional manifolds (without boundary) is with...
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...
It is important to have fast and effective methods for simplifying 3-manifold triangulations without...
Drawing together techniques from combinatorics and computer science, we improve the census algorithm...
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...
The understanding and classication of (compact) 3-dimensional manifolds (without boundary) is with n...
. We describe theoretical backgrounds for a computer program that recognizes all closed orientable 3...
There are many fundamental algorithmic problems on triangulated 3-manifolds whose complexities are u...
Starting from any simplicial triangulation of a compact 3-manifold M, we achieve decompositions of M...
There are essentially two ways to decompose a (compact, connected) d-mani-fold (without boundary) in...
The present paper adopts a computational approach to the study of nonorientable 3-manifolds: in fact...
Combinatorial topology makes unlimited use of refinements. These refinements translate into an unlim...