The present paper follows the computational approach to 3-manifold classification via edge-coloured graphs, already performed in [1] (with respect to orientable 3-manifolds up to 28 coloured tetrahedra), in [2] (with respect to non-orientable3-manifolds up to 26 coloured tetrahedra), in [3] and [4] (with respect to genus two 3-manifolds up to 34 coloured tetrahedra): in fact, by automatic generation and analysis of suitable edge-coloured graphs, called crystallizations, we obtain a catalogue of all orientable 3-manifolds admitting coloured triangulations with 30 tetrahedra. These manifolds are unambiguously identified via JSJ decompositions and fibering structures. It is worth noting that, in the present work, a suitable use of elementary...
Combinatorial topology makes unlimited use of refinements. These refinements translate into an unlim...
AbstractThe present paper looks at Matveev's complexity (introduced in 1990 and based on the existen...
AbstractIt is well-known that every closed orientable 3-manifold M3 is the 3-fold simple covering M3...
The present paper follows the computational approach to 3-manifold classification via edge-coloured ...
We improve and extend to the non-orientable case a recent result of Kar\ue1ba\u161, Mali\u10dk\ufd a...
CRYSTALLIZATION CATALOGUES is a collection of algorithmic procedures, which can be used to construc...
The present paper adopts a computational approach to the study of nonorientable 3-manifolds: in fact...
By means of a slight modification of the notion of GM-complexity introduced in [Casali, M.R., Topol....
We characterize combinatorial representations of minimal 3-manifolds by means of edge-coloured graph...
One of the main features of crystallization theory relies on the purely combinatorial nature of the ...
The present paper looks at Matveev's complexity (introduced in 1990 and based on the existence of a ...
AbstractIn his paper ‘Tetrahedron manifolds and space forms’, Molnar describes an infinite class of ...
We describe an algorithm to subdivide automatically a given set of PL n-manifolds (via coloured tria...
Given a link L ⊂ S3, we describe a standard method for constructing a class ΓL,d of 4-coloured graph...
We present the census of all non-orientable, closed, connected 3-manifolds admitting a rigid crystal...
Combinatorial topology makes unlimited use of refinements. These refinements translate into an unlim...
AbstractThe present paper looks at Matveev's complexity (introduced in 1990 and based on the existen...
AbstractIt is well-known that every closed orientable 3-manifold M3 is the 3-fold simple covering M3...
The present paper follows the computational approach to 3-manifold classification via edge-coloured ...
We improve and extend to the non-orientable case a recent result of Kar\ue1ba\u161, Mali\u10dk\ufd a...
CRYSTALLIZATION CATALOGUES is a collection of algorithmic procedures, which can be used to construc...
The present paper adopts a computational approach to the study of nonorientable 3-manifolds: in fact...
By means of a slight modification of the notion of GM-complexity introduced in [Casali, M.R., Topol....
We characterize combinatorial representations of minimal 3-manifolds by means of edge-coloured graph...
One of the main features of crystallization theory relies on the purely combinatorial nature of the ...
The present paper looks at Matveev's complexity (introduced in 1990 and based on the existence of a ...
AbstractIn his paper ‘Tetrahedron manifolds and space forms’, Molnar describes an infinite class of ...
We describe an algorithm to subdivide automatically a given set of PL n-manifolds (via coloured tria...
Given a link L ⊂ S3, we describe a standard method for constructing a class ΓL,d of 4-coloured graph...
We present the census of all non-orientable, closed, connected 3-manifolds admitting a rigid crystal...
Combinatorial topology makes unlimited use of refinements. These refinements translate into an unlim...
AbstractThe present paper looks at Matveev's complexity (introduced in 1990 and based on the existen...
AbstractIt is well-known that every closed orientable 3-manifold M3 is the 3-fold simple covering M3...