We describe an algorithm to subdivide automatically a given set of PL n-manifolds (via coloured triangulations or, equivalently, via crystallizations) into classes whose elements are PL-homeomorphic. The algorithm, implemented in the case n = 4, succeeds to solve completely the PL-homeomorphism problem among the catalogue of all closed connected PL 4-manifolds up to gem-complexity 8 (i.e., which admit a coloured triangulation with at most 18 4-simplices). Possible interactions with the (not completely known) relationship among the different classications in the TOP and DIFF=PL categories are also investigated. As a first consequence of the above PL classification, the non-existence of exotic PL 4-manifolds up to gem-complexity 8 is prove...
CRYSTALLIZATION CATALOGUES is a collection of algorithmic procedures, which can be used to construc...
The present paper studies the relationship between handle-decompositions of PL 4-manifolds and the s...
Combinatorial topology makes unlimited use of refinements. These refinements translate into an unlim...
We describe an algorithm to subdivide automatically a given set of PL n-manifolds (via coloured tria...
Crystallization theory is a graph-theoretical representation method for compact PL-manifolds of arbi...
Within crystallization theory, two interesting PL invariants for d-manifolds have been introduced an...
The goal of this paper is to give some theorems which relate to the problem of classifying smooth 4-...
The goal of this paper is to give some theorems which relate tothe problem of classifying smooth 4{m...
The present paper is a survey of up-to-date results in 3-dimensional crystallization theory, in part...
Crystallization theory is a representation method for compact PL manifolds by means of a particular ...
The present paper is a survey of up-to-date results in 3-dimensional crystallization theory, in part...
Crystallization theory is a graph-theoretical representation method for compact PL-manifolds of arbi...
Simple crystallizations are edge-colored graphs representing piecewise linear (PL) 4-manifolds with ...
The present paper is devoted to present a unifying survey about some special classes of crystallizat...
The present paper is devoted to present a unifying survey about some special classes of crystallizat...
CRYSTALLIZATION CATALOGUES is a collection of algorithmic procedures, which can be used to construc...
The present paper studies the relationship between handle-decompositions of PL 4-manifolds and the s...
Combinatorial topology makes unlimited use of refinements. These refinements translate into an unlim...
We describe an algorithm to subdivide automatically a given set of PL n-manifolds (via coloured tria...
Crystallization theory is a graph-theoretical representation method for compact PL-manifolds of arbi...
Within crystallization theory, two interesting PL invariants for d-manifolds have been introduced an...
The goal of this paper is to give some theorems which relate to the problem of classifying smooth 4-...
The goal of this paper is to give some theorems which relate tothe problem of classifying smooth 4{m...
The present paper is a survey of up-to-date results in 3-dimensional crystallization theory, in part...
Crystallization theory is a representation method for compact PL manifolds by means of a particular ...
The present paper is a survey of up-to-date results in 3-dimensional crystallization theory, in part...
Crystallization theory is a graph-theoretical representation method for compact PL-manifolds of arbi...
Simple crystallizations are edge-colored graphs representing piecewise linear (PL) 4-manifolds with ...
The present paper is devoted to present a unifying survey about some special classes of crystallizat...
The present paper is devoted to present a unifying survey about some special classes of crystallizat...
CRYSTALLIZATION CATALOGUES is a collection of algorithmic procedures, which can be used to construc...
The present paper studies the relationship between handle-decompositions of PL 4-manifolds and the s...
Combinatorial topology makes unlimited use of refinements. These refinements translate into an unlim...