Cataloguing PL 4-manifolds by gem-complexity
arXiv:1408.0378
Abstract
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 different classification in 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 proved. Further applications of the tool are described, related to possible PL-recognition of different triangulations of the K3-surface.
arXiv comment25 pages, 5 figures. Improvements suggested by the referee
References in corpus (9)
- Enumeration of non-orientable 3-manifolds using face pairing graphs and union-find
- Simple crystallizations of 4-manifolds
- A note about complexity of lens spaces
- Combinatorial properties of the K3 surface: Simplicial blowups and slicings
- PL 4-manifolds admitting simple crystallizations: framed links and regular genus
- A census of genus two 3-manifolds up to 42 coloured tetrahedra
- The average dual surface of a cohomology class and minimal simplicial decompositions of infinitely many lens spaces
- Complexity computation for compact 3-manifolds via crystallizations and Heegaard diagrams
- Rigid gems in dimension n