We present the census of all non-orientable, closed, connected 3-manifolds admitting a rigid crystallization with at most 30 vertices. In order to obtain the above result, we generate, manipulate and compare, by suitable computer procedures, all rigid non-bipartite crystallizations up to 30 vertices
The present paper looks at Matveev's complexity (introduced in 1990 and based on the existence of a ...
AbstractThe present paper looks at Matveev's complexity (introduced in 1990 and based on the existen...
In this thesis, we use normal surface theory to understand certain properties of minimal tr...
We present the census of all non-orientable, closed, connected 3-manifolds admitting a rigid crystal...
The present paper adopts a computational approach to the study of nonorientable 3-manifolds: in fact...
A census is presented of all closed non-orientable 3-manifold triangulations formed from at most sev...
CRYSTALLIZATION CATALOGUES is a collection of algorithmic procedures, which can be used to construc...
Drawing together techniques from combinatorics and computer science, we improve the census algorithm...
The understanding and classication of (compact) 3-dimensional manifolds (without boundary) is with n...
We improve and extend to the non-orientable case a recent result of Karábaš, Maličký and Nedela conc...
Through computer enumeration with the aid of topological results, we catalogue all 18 closed nonorie...
The present paper follows the computational approach to 3-manifold classification via edge-coloured ...
The understanding and classification of (compact) 3-dimensional manifolds (without boundary) is with...
Drawing together techniques from combinatorics and computer science, we improve the census algorithm...
The paper deals with combinatorial structures (pseudo-complexes, crystallizations) giving a direct l...
The present paper looks at Matveev's complexity (introduced in 1990 and based on the existence of a ...
AbstractThe present paper looks at Matveev's complexity (introduced in 1990 and based on the existen...
In this thesis, we use normal surface theory to understand certain properties of minimal tr...
We present the census of all non-orientable, closed, connected 3-manifolds admitting a rigid crystal...
The present paper adopts a computational approach to the study of nonorientable 3-manifolds: in fact...
A census is presented of all closed non-orientable 3-manifold triangulations formed from at most sev...
CRYSTALLIZATION CATALOGUES is a collection of algorithmic procedures, which can be used to construc...
Drawing together techniques from combinatorics and computer science, we improve the census algorithm...
The understanding and classication of (compact) 3-dimensional manifolds (without boundary) is with n...
We improve and extend to the non-orientable case a recent result of Karábaš, Maličký and Nedela conc...
Through computer enumeration with the aid of topological results, we catalogue all 18 closed nonorie...
The present paper follows the computational approach to 3-manifold classification via edge-coloured ...
The understanding and classification of (compact) 3-dimensional manifolds (without boundary) is with...
Drawing together techniques from combinatorics and computer science, we improve the census algorithm...
The paper deals with combinatorial structures (pseudo-complexes, crystallizations) giving a direct l...
The present paper looks at Matveev's complexity (introduced in 1990 and based on the existence of a ...
AbstractThe present paper looks at Matveev's complexity (introduced in 1990 and based on the existen...
In this thesis, we use normal surface theory to understand certain properties of minimal tr...